Optimized nonorthogonal transforms for image compression

@article{Guleryuz1997OptimizedNT,
  title={Optimized nonorthogonal transforms for image compression},
  author={Onur G. Guleryuz and Michael T. Orchard},
  journal={IEEE transactions on image processing : a publication of the IEEE Signal Processing Society},
  year={1997},
  volume={6 4},
  pages={
          507-22
        }
}
  • O. Guleryuz, M. Orchard
  • Published 1 April 1997
  • Computer Science
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
The transform coding of images is analyzed from a common standpoint in order to generate a framework for the design of optimal transforms. It is argued that all transform coders are alike in the way they manipulate the data structure formed by transform coefficients. A general energy compaction measure is proposed to generate optimized transforms with desirable characteristics particularly suited to the simple transform coding operation of scalar quantization and entropy coding. It is shown… 
Coding-adaptive transforms
TLDR
This work presents a new class of transforms called coding-adaptive transforms, that are derived under an optimality criterion which incorporates the elements of transform coding and is formulated for coding efficiency.
Approximation and Compression With Sparse Orthonormal Transforms
TLDR
This work designs sparse orthonormal transforms (SOTs) that automatically exploit regularity over different signal structures and provides an adaptation method that determines the best representation over localized regions and provides consistent increase in compression and approximation performance compared with conventional methods.
Linear, Worst-Case Estimators for Denoising Quantization Noise in Transform Coded Images
  • O. Guleryuz
  • Computer Science
    IEEE Transactions on Image Processing
  • 2006
TLDR
This paper uses tools from robust signal processing to construct linear, worst-case estimators for the denoising of transform compressed images and derives optimal, linear estimators of the original image that are optimal in the mean-squared error sense for the worst- case cross correlation between the original and the quantization error.
Design of general block oriented expansions for efficient signal representation
TLDR
It is demonstrated that the approximation capabilities of the corresponding linear combinations are superior to those obtained when using the discrete cosine transform (DCT) or for that matter the Karhunen-Loeve transform (KLT) computed for the signals at hand.
Non-causal encoding of predictively coded samples
TLDR
It is shown that this joint, non-causal encoding can be represented with a nonorthogonal transform whose form and parameters the authors derive and augment the HEVC standard with this work and shows significant compression improvements on images/video that contain directional structures.
Local probability distribution of natural signals in sparse domains
  • H. Rabbani, S. Gazor
  • Engineering
    2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2011
TLDR
The experiments show that a conditionally (given locally estimated variance and shape) independent Bessel K-form (BKF) pdf locally fits the sparse domain's coefficients of natural signals, accurately, which justifies why the BKF pdf is an appropriate fit.
Optimisation d'un schéma de codage d'image à base d'une TCD. Application à un codeur JPEG pour l'enregistrement numérique à bas débit
Nous considerons dans cette these le probleme dotpimisation dun schema de codage/decodage JPEG et le post-traitement de reduction des effets de blocs dans les images codees par JPEG. Nous proposons
Decoder-side motion vector derivation for hybrid video coding

References

SHOWING 1-10 OF 15 REFERENCES
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.
Embedded image coding using zerotrees of wavelet coefficients
The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkably effective, image compression algorithm, having the property that the bits in the bit stream are generated in order of
Joint optimization of scalar and tree-structured quantization of wavelet image decompositions
TLDR
An image compression algorithm based on optimal bit rate allocation between scalar and tree-structured quantizers is proposed, and achieves excellent coding efficiency in the rate-distortion sense.
The LOT: transform coding without blocking effects
An exact derivation of an optimal lapped orthogonal transform (LOT) is presented. The optimal LOT is related to the discrete cosine transform (DCT) in such a way that a fast algorithm for a nearly
Extension of the Karhunen-Loeve transform for wavelets and perfect reconstruction filterbanks
  • M. Unser
  • Computer Science
    Optics & Photonics
  • 1993
TLDR
It is shown that low-order Daubechies wavelets and wavelet packets are near optimal for the representation of Markov-1 processes, and a variety of suboptimal schemes using FIR filterbanks are investigated.
Theory and design of M-channel maximally decimated quadrature mirror filters with arbitrary M, having the perfect-reconstruction property
TLDR
A general class of maximally decimated M-channel quadrature mirror filter banks that lead to perfect reconstruction is derived, and it is shown that such a property can be satisfied if the alias component matrix is unitary on the unit circle of the z plane.
Principal component filter banks for optimal multiresolution analysis
TLDR
An optimal P-band perfect reconstruction filter bank (PRFB) is derived in this paper, which minimizes the approximation error (in the mean-square sense) between the original signal and its low-resolution version.
Matching pursuits with time-frequency dictionaries
The authors introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions. These
Optimal L/sup 2/ approximation of images in nonorthogonal multiresolution bases
  • P. Moulin
  • Computer Science
    1993 IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 1993
The author presents a fast optimization algorithm for L/sup 2/ approximation in 2-D, separable, nonorthogonal multiresolution bases and discusses its application to image coding. The algorithm is
Fundamentals of Digital Image Processing
  • Anil K. Jain
  • Computer Science
    Control of Color Imaging Systems
  • 2018
TLDR
This chapter discusses two Dimensional Systems and Mathematical Preliminaries and their applications in Image Analysis and Computer Vision, as well as image reconstruction from Projections and image enhancement.
...
1
2
...