Complex, linear-phase filters for efficient image coding
IEEE Transactions on Signal ProcessingPublished 1 January 1995
Benjamin J. Belzer, J.-M. Lina, John Villasenor
Citations33
SJR quartileQ1
SJR score2.05
SNIP2.36
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
By explicitly seeking solutions in which the imaginary part of the filter coefficients is small enough to be approximated to zero, real symmetric filters can be obtained that achieve excellent compression performance.
Abstract
With the exception of the Haar basis, real-valued orthogonal wavelet filter banks with compact support lack symmetry and therefore do not possess linear phase. This has led to the use of biorthogonal filters for coding of images and other multidimensional data. There are, however, complex solutions permitting the construction of compactly supported, orthogonal linear phase QMF filter banks. By explicitly seeking solutions in which the imaginary part of the filter coefficients is small enough to be approximated to zero, real symmetric filters can be obtained that achieve excellent compression performance.>
Keywords
Computer Science
Cambridge University Press eBooksMatrix Analysis
10,056 Citations1985Roger A. Horn, Charles R. Johnson
Communications on Pure and Applied MathematicsOrthonormal bases of compactly supported wavelets
8,187 Citations1988Ingrid Daubechies
This work construct orthonormal bases of compactly supported wavelets, with arbitrarily high regularity, by reviewing the concept of multiresolution analysis as well as several algorithms in vision decomposition and reconstruction.
The Caltech Institute Archives (California Institute of Technology)Multirate Systems and Filter Banks
5,446 Citations1992P. P. Vaidyanathan
This chapter discusses Multirate Filter Bank Theory and Related Topics, which focuses on the role of the wavelet transform in the construction of filter banks.
IEEE ASSP MagazineAn introduction to hidden Markov models
4,789 Citations1986L. R. Rabiner, Biing‐Hwang Juang
The purpose of this tutorial paper is to give an introduction to the theory of Markov models, and to illustrate how they have been applied to problems in speech recognition.
IEEE Transactions on Image ProcessingImage coding using wavelet transform
3,508 Citations1992Marc Antonini, Michel Barlaud +2 more
A scheme for image compression that takes into account psychovisual features both in the space and frequency domains is proposed and it is shown that the wavelet transform is particularly well adapted to progressive transmission.
IEEE Transactions on Signal ProcessingWavelets and filter banks: theory and design
1,689 Citations1992Martin Vetterli, Cormac Herley
The perfect reconstruction condition is posed as a Bezout identity, and it is shown how it is possible to find all higher-degree complementary filters based on an analogy with the theory of Diophantine equations.
IEEE Transactions on Image ProcessingWavelet filter evaluation for image compression
607 Citations1995John Villasenor, Benjamin J. Belzer +1 more
This work has evaluated all possible reasonably short (less than 36 taps in the synthesis/analysis pair) minimum-order biorthogonal wavelet filter banks and selected the filters best suited to image compression.
Sub-band coding of digital images using symmetric short kernel filters and arithmetic coding techniques
362 Citations2003Didier Le Gall, A. Tabatabai
A technique for designing symmetric short tap filters is presented, and it is shown that such filters can be easily implemented by using simple arithmetic operations (e.g. addition and multiplication).
IEEE Transactions on Signal ProcessingApplications of complex valued wavelet transforms to subband decomposition
126 Citations1993Wayne Lawton
Subband decomposition and reconstruction using both a length 6 filter associated with a Daubechies (1988) wavelet bases and a related length 6 complex valued linear phase filter are compared to illustrate the reduced border effects.
An embedded hierarchical image coder using zerotrees of wavelet coefficients
111 Citations2002J.M. Shapiro
The algorithm consistently produces compression results that are competitive with virtually all known compression algorithms on standard test images, but requires absolutely no training, no pre-stored tables or codebooks, and no prior knowledge of the image source.
IEEE Transactions on Image ProcessingVector quantization for entropy coding of image subbands
80 Citations1992Taku Senoo, Bernd Girod
The authors show that full-search entropy-constrained vector quantization of image subbands results in the best performance, but is computationally expensive.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEParameterizations for complex Daubechies wavelets
6 Citations1994Jean‐Marc Lina, Michel Mayrand
IEEE Transactions on Acoustics Speech and Signal ProcessingThe moments of matched and mismatched hidden Markov models
6 Citations1990Roy L. Streit
An algorithm for computing the moments of matched and mismatched hidden Markov models (HMMs) from their defining parameters is presented and shows that classification using a suboptimal statistic reliably distinguishes between sufficiently long quasi-stationary signals with a reasonable amount of computational effort.