Theoretical foundations of transform coding

@article{Goyal2001TheoreticalFO,
  title={Theoretical foundations of transform coding},
  author={Vivek K Goyal},
  journal={IEEE Signal Process. Mag.},
  year={2001},
  volume={18},
  pages={9-21}
}
  • Vivek K Goyal
  • Published 1 September 2001
  • Computer Science
  • IEEE Signal Process. Mag.
Discusses various aspects of transform coding, including: source coding, constrained source coding, the standard theoretical model for transform coding, entropy codes, Huffman codes, quantizers, uniform quantization, bit allocation, optimal transforms, transforms visualization, partition cell shapes, autoregressive sources, transform optimization, synthesis transform optimization, orthogonality and independence, and departures form the standard model. 

Figures from this paper

Theorems and Counterexamples in Transform Coding

Results presented here to some extent reveal the importance of orthogonality and of independent transform coefficients when the source is not necessarily Gaussian and the rates are not necessarily high.

Source Coding: Part I of Fundamentals of Source and Video Coding

Based on the fundamentals of information and rate distortion theory, the most relevant techniques used in source coding algorithms are described: entropy coding, quantization as well as predictive and transform coding.

Towards Optimality in Multiterminal Transform Coding

This paper is concerned with transform coding of correlated sources in conjunction with variable rate quantization at high resolution, and derived the necessary and sufficient condition for optimality of a unitary transform in the side information setting is derived.

Quantization and Entropy Coding in the Versatile Video Coding (VVC) Standard

The paper provides an overview of the quantization and entropy coding methods in the Versatile Video Coding (VVC) standard and discusses motivations and implementation aspects.

Multi-rate adaptive transform coding for video compression

This study proposes learned transforms and entropy coding that may either serve as (non)linear drop-in replacements, or enhancements for linear transforms in existing codecs, and augmented the DCT with learned quantization matrices and adaptive entropy coding to compress intra-frame AV1 block prediction residuals.

Hybrid Video Coding with Trellis-Coded Quantization

It is shown that the coding efficiency of transform coding can be improved by replacing scalar quantization with trellis-coded quantization (TCQ) and using advanced entropy coding techniques for coding the quantization indexes.

Optimization of Product Code

This work proposes an optimization method for a product coding, which avoids this computational explosion problem by applying a reasonable restriction to the model architecture.

Rate-Distortion Analysis of Sparse Overcomplete Codes

A rate-distortion theory for source codes based on sparse approximations is developed and can be used to compare different overcomplete transforms by estimating these parameters for a class of signals to be encoded.

Identification of Transform Coding Chains

This paper considers the problem of identifying the transform matrix as well as the quantization step sizes, and proposes an algorithm that is able to find the optimal solution and formally study its convergence properties.
...

References

SHOWING 1-10 OF 38 REFERENCES

Transform coding with integer-to-integer transforms

A transform coding technique where the source samples are first scalar-quantized and then transformed with an integer-to-integer approximation to a nonorthogonal linear transform, showing that for high-rate coding of a Gaussian source, this reduction in memory requirements comes without any degradation of rate-distortion performance.

Bit allocation and encoding for vector sources

  • A. Segall
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1976
This paper considers the problem of efficient transmission of vector sources over a digital noiseless channel and gives the optimally decorrelating scheme for a source whose components are dependent and treats the problems of selecting the optimum characteristic of the encoding scheme such that the overall mean-squared error is minimized.

JPEG: Still Image Data Compression Standard

This chapter discusses JPEG Syntax and Data Organization, the history of JPEG, and some of the aspects of the Human Visual Systems that make up JPEG.

High-rate transform coding: how high is high, and does it matter?

  • Vivek K Goyal
  • Computer Science
    2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
  • 2000
Karhunen-Loeve transforms are the optimal orthogonal transforms for transform coding of Gaussian sources but rely on a scale invariance property, but not on high-resolution approximations or properties of optimal fixed-rate quantization.

Efficient bit allocation for an arbitrary set of quantizers [speech coding]

A bit allocation algorithm that is capable of efficiently allocating a given quota of bits to an arbitrary set of different quantizers is proposed, producing an optimal or very nearly optimal allocation, while allowing the set of admissible bit allocation values to be constrained to nonnegative integers.

A linear coding for transmitting a set of correlated signals

The coding theory can be extended to include the minimization of the expectation of any positive definite quadratic function of the differences between the original and reconstructed signals.

Rate-distortion methods for image and video compression

An overview of rate-distortion (R-D) based optimization techniques and their practical application to image and video coding is provided and two popular techniques for resource allocation are introduced, namely, Lagrangian optimization and dynamic programming.

Multiple description coding: compression meets the network

By allowing image reconstruction to continue even after a packet is lost, this type of representation can prevent a Web browser from becoming dormant, and the source can be approximated from any subset of the chunks.

Block Quantization of Correlated Gaussian Random Variables

Substantial improvements over single sample quantizing are attained with blocks of relatively short length, and the final selection of the optimal set of quantizers becomes a matter of a few simple trials.