scispace - formally typeset
Search or ask a question
Topic

Quadrature mirror filter

About: Quadrature mirror filter is a research topic. Over the lifetime, 955 publications have been published within this topic receiving 28900 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a theory is outlined whereby it is possible to design a M \times N channel two-dimensional quadrature mirror filter bank which has perfect reconstruction property, such a property ensures freedom from aliasing, amplitude distortion, and phase distortion.
Abstract: A theory is outlined whereby it is possible to design a M \times N channel two-dimensional quadrature mirror filter bank which has perfect reconstruction property. Such a property ensures freedom from aliasing, amplitude distortion, and phase distortion. The method is based on a simple property of certain transfer matrices, namely the losslessness property.

33 citations

Book
Siwei Lyu1, Hany Farid1
07 Feb 2008
TL;DR: A set of natural image statistics are described that are built upon two multi-scale image decompositions, the quadrature mirror filter pyramid decomposition and the local angular harmonic decomposition that capture certain statistical regularities of natural images.
Abstract: We describe a set of natural image statistics that are built upon two multi-scale image decompositions, the quadrature mirror filter pyramid decomposition and the local angular harmonic decomposition. These image statistics consist of first- and higher-order statistics that capture certain statistical regularities of natural images. We propose to apply these image statistics, together with classification techniques, to three problems in digital image forensics: (1) differentiating photographic images from computer-generated photorealistic images, (2) generic steganalysis; (3) rebroadcast image detection. We also apply these image statistics to the traditional art authentication for forgery detection and identification of artists in an art work. For each application we show the effectiveness of these image statistics and analyze their sensitivity and robustness.

33 citations

Journal ArticleDOI
TL;DR: A novel genetic algorithm for the design of a canonical signed power-of-two (SPT) coefficient lattice structure quadrature mirror filter bank is presented, and the performance of the new GA outperforms conventional GAs.
Abstract: A novel genetic algorithm (GA) for the design of a canonical signed power-of-two (SPT) coefficient lattice structure quadrature mirror filter bank is presented in this paper. Genetic operations may render the SPT representation of a value noncanonical. In this paper, a new encoding scheme is introduced to encode the SPT values. In this new scheme, the canonical property of the SPT values is preserved under genetic operations. Additionally, two new features that drastically improve the performance of our GA are introduced. (1) An additional level of natural selection is introduced to simulate the effect of natural selection when sperm cells compete to fertilize an ovule; this dramatically improves the offspring survival rate. A conventional GA is analogous to intracytoplasmic sperm injection and has an extremely low offspring survival rate, resulting in very slow convergence. (2) The probability of mutation for each codon of a chromosome is weighted by the reciprocal of its effect. Because of these new features, the performance of our new GA outperforms conventional GAs.

33 citations

Journal ArticleDOI
TL;DR: In this paper, the classical constructions of wavelets and scaling functions from conjugate mirror filters are extended to settings that lack multiresolution analyses using analogues of the classical filter conditions.

32 citations

Journal ArticleDOI
TL;DR: This paper proposes a structure of orthogonal QMF lattice with SPT coefficients, which has much denser discrete coefficient space than the conventional structure, and shows less coefficient quantization error than theventional Q MF lattice.
Abstract: Lattice structures have several advantages over the tapped delay line form, especially for the hardware implementation of general digital filters. It is also efficient for the implementation of quadrature mirror filter (QMF), because the perfect reconstruction is preserved under the coefficient quantization. Moreover, if lattice coefficients are implemented in signed powers-of-two (SPT), the hardware complexity can also be reduced. But the discrete coefficient space with the SPT representation is sparse when the number of nonzero bits is small. This paper proposes a structure of orthogonal QMF lattice with SPT coefficients, which has much denser discrete coefficient space than the conventional structure. While the conventional approaches directly quantize the lattice coefficients into SPT form, the proposed algorithm considers the quantization in the SPT angle space. For this, each lattice stage is implemented by the cascade of several variants of COordinate Rotation DIgital Computer. The resulting angle space and corresponding discrete coefficient space is much denser than the one generated by the conventional direct quantization approach. An efficient coefficient search algorithm for this structure is also proposed. Since the proposed architecture provides denser coefficient space, it shows less coefficient quantization error than the conventional QMF lattice

32 citations

Network Information
Related Topics (5)
Filter (signal processing)
81.4K papers, 1M citations
80% related
Wavelet
78K papers, 1.3M citations
79% related
Estimation theory
35.3K papers, 1M citations
78% related
Robustness (computer science)
94.7K papers, 1.6M citations
78% related
Feature extraction
111.8K papers, 2.1M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20231
20227
20214
20203
20197
201812