Mathematical properties of the JPEG2000 wavelet filters

@article{Unser2003MathematicalPO,
  title={Mathematical properties of the JPEG2000 wavelet filters},
  author={Michael A. Unser and Thierry Blu},
  journal={IEEE transactions on image processing : a publication of the IEEE Signal Processing Society},
  year={2003},
  volume={12 9},
  pages={
          1080-90
        }
}
  • M. Unser, T. Blu
  • Published 1 September 2003
  • Mathematics
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
The LeGall 5/3 and Daubechies 9/7 filters have risen to special prominence because they were selected for inclusion in the JPEG2000 standard. We determine their key mathematical features: Riesz bounds, order of approximation, and regularity (Hölder and Sobolev). We give approximation theoretic quantities such as the asymptotic constant for the L2 error and the angle between the analysis and synthesis spaces which characterizes the loss of performance with respect to an orthogonal projection. We… 

Figures and Tables from this paper

Mathematical properties of the two-parameter family of 9/7 biorthogonal filters
The family of biorthogonal filters considered here are of lengths 9 and 7 and represent a super-set of the 9/7 pair that is used in the JPEG2000 compression standard. The filters have two vanishing
Generalized Daubechies Wavelet Families
TLDR
A generalization of the orthonormal Daubechies wavelets and of their related biorthogonal flavors and it is proved that these functions are square-integrable and that they converge to their classical counterparts of the corresponding order.
Wavelet theoretic properties of the family of 6/10 biorthogonal filters
The family of biorthogonal filters considered here are of lengths 6 and 10 and represent a superset of the 6/10 pair introduced by Villasenor et al. (1995). The filters have a fixed number of
Lossless Image Compression Using New Biorthogonal Wavelets
TLDR
Four new biorthogonal wavelets are proposed which gives better compression performance and are compared with traditional wavelets by using the design metrics Peak Signal to Noise Ratio (PSNR) and Compression Ratio (CR).
The construction of a statistical prediction lifting operator and its application
A new method of nonseparable nonlinear wavelet decomposition is proposed, which is suited for the task of image compression, especially for lossless coding applications. It is based on a certain
Performance analysis of embedded-wavelet coders
TLDR
This work analyzes the design issues for the SPIHT (set partitioning in hierarchical trees) coding, one of the best-regarded embedded-wavelet-based algorithms in the literature, and explores a scaling scheme in quantization that minimizes the overall mean squared error.
A Novel 9/7 Wavelet Filter banks For Texture Image Coding
This paper proposes a novel 9/7 wavelet filter bank for texture image coding applications based on lifting a 5/3 filter to a 7/5 filter, and then to a 9/7 filter. Moreover, a one-dimensional
Image processing with JPEG2000 coders
TLDR
In the note, several wavelet-based image processing algorithms are presented, offering simplification of the final circuitry (or the software package) and the reduction of the power consumption (program size) when compared to solutions based on separate components.
...
...

References

SHOWING 1-10 OF 49 REFERENCES
On the choice of 'wavelet' filter for still image compression
  • O. Rioul
  • Engineering
    1993 IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 1993
TLDR
It is shown that regularity may be relevant for still image compression, at least for short filters (L<or=12), for which the regularity order is relatively small.
Analysis of low bit rate image transform coding
TLDR
Calculations based on high-resolution quantizations prove that the distortion rate D(R) of an image transform coding is proportional to 2/sup -2R/ when R is large enough, and shows that the compression performance of an orthonormal basis depends mostly on its ability to approximate images with a few nonzero vectors.
Image coding using wavelet transform
TLDR
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.
Image compression through wavelet transform coding
TLDR
If pictures can be characterized by their membership in the smoothness classes considered, then wavelet-based methods are near-optimal within a larger class of stable transform-based, nonlinear methods of image compression.
Approximation power of biorthogonal wavelet expansions
  • M. Unser
  • Mathematics
    IEEE Trans. Signal Process.
  • 1996
TLDR
It is proved that the Strang-Fix conditions imply that the error for an orthogonal wavelet approximation at scale a=2/sup -i/ globally decays as a/sup N/, and that this result carries over for the general biorthogonal case and that the rate of decay of the error is determined by the order properties of the synthesis scaling function alone.
A multiscale relaxation algorithm for SNR maximization in nonorthogonal subband coding
  • P. Moulin
  • Computer Science
    IEEE Trans. Image Process.
  • 1995
TLDR
A practical solution to the optimization problem is presented in the form of a multiscale relaxation algorithm, using inter- and intrascale quantization noise feedback filters, and bounds on the coding gain over the standard coding technique are derived.
Approximation Error for Quasi-Interpolators and (Multi-)Wavelet Expansions
We investigate the approximation properties of general polynomial preserving operators that approximate a function into some scaled subspace of L 2 via an appropriate sequence of inner products. In
Pointwise smoothness, two-microlocalization and wavelet coefficients
In this paper we shall compare three notions of pointwise smoothness: the usual definition, J.M. Bony's two-microlocal spaces Cx0s,s', and the corresponding definition on the wavelet coefficients.
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
TLDR
The image coding results, calculated from actual file sizes and images reconstructed by the decoding algorithm, are either comparable to or surpass previous results obtained through much more sophisticated and computationally complex methods.
Quantitative Fourier Analysis of Approximation Techniques : Part II — Wavelets
TLDR
A general Fourier method that provides an accurate prediction of the approximation error, irrespective of the scaling properties of the approximating functions is proposed, and sharp, asymptotically optimal upper bounds for the least-squares approximation error are computed.
...
...