DocumentCode :
1934146
Title :
Computation-distortion characteristics of JPEG encoding and decoding
Author :
Goyal, Vivek K. ; Vetterli, Martin
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Volume :
1
fYear :
1997
fDate :
2-5 Nov. 1997
Firstpage :
229
Abstract :
A distortion-computation function D(C) is defined as the minimum expected distortion in computing some quantity-using an algorithm from a predefined set of algorithms-while using no more than C computational units. When the computational problem is to encode at rate R, this gives slices of a computation-rate-distortion surface. This framework is used in the analysis of a family of JPEG coders that use output-pruned DCT calculations in place of some full DCT calculations. For encoding the Lena image at 0.5 bits/pixel, this yields a 30% reduction in complexity while lowering the PSNR by only 0.4 dB. The decoding complexity can be similarly reduced.
Keywords :
code standards; computational complexity; decoding; discrete cosine transforms; image coding; rate distortion theory; source coding; telecommunication standards; transform coding; vector quantisation; JPEG coders; JPEG decoding; JPEG encoding; complexity reduction; computation-distortion characteristics; computation-rate-distortion surface; decoding complexity; distortion-computation function; encoding rate; entropy pruned tree-structured VQ; image coding; minimum expected distortion; output-pruned DCT; source coding; Algorithm design and analysis; Computational efficiency; Decoding; Discrete cosine transforms; Discrete transforms; Distributed computing; Encoding; Image coding; Rate-distortion; Source coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signals, Systems & Computers, 1997. Conference Record of the Thirty-First Asilomar Conference on
Conference_Location :
Pacific Grove, CA, USA
ISSN :
1058-6393
Print_ISBN :
0-8186-8316-3
Type :
conf
DOI :
10.1109/ACSSC.1997.680170
Filename :
680170
Link To Document :
بازگشت