Filter bank

About: Filter bank is a research topic. Over the lifetime, 10465 publications have been published within this topic receiving 189911 citations. The topic is also known as: filterbank.

Universal distortion function for steganography in an arbitrary domain

Abstract: Currently, the most successful approach to steganography in empirical objects, such as digital media, is to embed the payload while minimizing a suitably defined distortion function. The design of the distortion is essentially the only task left to the steganographer since efficient practical codes exist that embed near the payload-distortion bound. The practitioner’s goal is to design the distortion to obtain a scheme with a high empirical statistical detectability. In this paper, we propose a universal distortion design called universal wavelet relative distortion (UNIWARD) that can be applied for embedding in an arbitrary domain. The embedding distortion is computed as a sum of relative changes of coefficients in a directional filter bank decomposition of the cover image. The directionality forces the embedding changes to such parts of the cover object that are difficult to model in multiple directions, such as textures or noisy regions, while avoiding smooth regions or clean edges. We demonstrate experimentally using rich models as well as targeted attacks that steganographic methods built using UNIWARD match or outperform the current state of the art in the spatial domain, JPEG domain, and side-informed JPEG domain.

A continuously variable digital delay element

Abstract: The author describes an FIR (finite-impulse-response) filter which synthesizes a controllable delay. By changing the delay the filter has the ability to interpolate between samples in the data stream of a band-limited signal. Because high sampling rates are not required, the filter is especially suited for implementation in a digital signal processor (DSP), and has been implemented in a real-time DSP. The interpolator can be used as a practical way to reconstruct an original band limited signal from samples taken at the Nyquist rate. The variable delay filter can also be used as a more general computational element. Performance results are presented. >

A theoretical analysis of the properties of median filters

Abstract: Necessary and sufficient conditions for a signal to be invariant under a specific form of median filtering are derived. These conditions state that a signal must be locally monotone to pass through a median filter unchanged. It is proven that the form of successive median filtering of a signal (i.e., the filtered output is itself again filtered) eventually reduces the original signal to an invariant signal called a root signal. For a signal of length L samples, a maximum of \frac{1}{2}(L - 2) repeated filterings produces a root signal.

ECG beat detection using filter banks

Abstract: The authors have designed a multirate digital signal processing algorithm to detect heartbeats in the electrocardiogram (ECG). The algorithm incorporates a filter bank (FB) which decomposes the ECG into subbands with uniform frequency bandwidths. The FB-based algorithm enables independent time and frequency analysis to be performed on a signal. Features computed from a set of the subbands and a heuristic detection strategy are used to fuse decisions from multiple one-channel beat detection algorithms. The overall beat detection algorithm has a sensitivity of 99.59% and a positive predictivity of 99.56% against the MIT/BIH database. Furthermore this is a real-time algorithm since its beat detection latency is minimal. The FB-based beat detection algorithm also inherently lends itself to a computationally efficient structure since the detection logic operates at the subband rate. The FB-based structure is potentially useful for performing multiple ECG processing tasks using one set of preprocessing filters.

Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture Modeling

Abstract: This article presents a statistical theory for texture modeling. This theory combines filtering theory and Markov random field modeling through the maximum entropy principle, and interprets and clarifies many previous concepts and methods for texture analysis and synthesis from a unified point of view. Our theory characterizes the ensemble of images I with the same texture appearance by a probability distribution f(I) on a random field, and the objective of texture modeling is to make inference about f(I), given a set of observed texture examples.In our theory, texture modeling consists of two steps. (1) A set of filters is selected from a general filter bank to capture features of the texture, these filters are applied to observed texture images, and the histograms of the filtered images are extracted. These histograms are estimates of the marginal distributions of f( I). This step is called feature extraction. (2) The maximum entropy principle is employed to derive a distribution p(I), which is restricted to have the same marginal distributions as those in (1). This p(I) is considered as an estimate of f( I). This step is called feature fusion. A stepwise algorithm is proposed to choose filters from a general filter bank. The resulting model, called FRAME (Filters, Random fields And Maximum Entropy), is a Markov random field (MRF) model, but with a much enriched vocabulary and hence much stronger descriptive ability than the previous MRF models used for texture modeling. Gibbs sampler is adopted to synthesize texture images by drawing typical samples from p(I), thus the model is verified by seeing whether the synthesized texture images have similar visual appearances to the texture images being modeled. Experiments on a variety of 1D and 2D textures are described to illustrate our theory and to show the performance of our algorithms. These experiments demonstrate that many textures which are previously considered as from different categories can be modeled and synthesized in a common framework.