Share Email Print

Proceedings Paper

Computation-rate-distrotion in transform coders for image compression
Author(s): Michael J. Gormish; John T. Gill
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 8 April 1993
PDF: 7 pages
Proc. SPIE 1903, Image and Video Processing, (8 April 1993); doi: 10.1117/12.143123
Show Author Affiliations
Michael J. Gormish, Ricoh California Research Ctr. and Stanford Univ. (United States)
John T. Gill, Stanford Univ. (United States)

Published in SPIE Proceedings Vol. 1903:
Image and Video Processing
Majid Rabbani; M. Ibrahim Sezan; A. Murat Tekalp, Editor(s)

© SPIE. Terms of Use
Back to Top