Translator Disclaimer
Paper
8 April 1993 Computation-rate-distortion in transform coders for image compression
Author Affiliations +
Proceedings Volume 1903, Image and Video Processing; (1993) https://doi.org/10.1117/12.143123
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1993, San Jose, CA, United States
Abstract
We consider the computational complexity of block transform coding and tradeoffs among computation, bit rate, and distortion. In particular, we illustrate a method of coding that allows decompression time to be traded with bit rate under a fixed quality criteria, or allows quality to be traded for speed with a fixed average bit rate. We provide a brief analysis of the entropy coded infinite uniform quantizer that leads to a simple bit allocation for transform coefficients. Finally, we consider the computational cost of transform coding for both the discrete cosine transform (DCT) and the Karhunen-Loeve transform (KLT). In general, a computation-rate- distortion surface can be used to select the appropriate size transform and the quantization matrix for a given bandwidth/CPU channel.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michael J. Gormish and John T. Gill "Computation-rate-distortion in transform coders for image compression", Proc. SPIE 1903, Image and Video Processing, (8 April 1993); https://doi.org/10.1117/12.143123
PROCEEDINGS
7 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

4K-based intra and interprediction techniques for HEVC
Proceedings of SPIE (April 29 2016)
Multiview image compression based on LDV scheme
Proceedings of SPIE (February 15 2011)
A rate control method for motion JPEG 2000
Proceedings of SPIE (November 02 2004)
Research of motion estimation algorithm based on H.264
Proceedings of SPIE (July 08 2011)

Back to Top