Paper
8 April 1993 Computation-rate-distortion in transform coders for image compression
Michael J. Gormish, John T. Gill
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
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Distortion

Quantization

Image compression

Computer programming

Image processing

Video processing

Video

Back to Top