DocumentCode
408350
Title
A fast computation scheme of partial distortion entropy updating
Author
Takizawa, Hiroyuki ; Kobayashi, Hiroaki
Author_Institution
Inf. Synergy Center, Tohoku Univ., Japan
Volume
1
fYear
2004
fDate
5-7 April 2004
Firstpage
736
Abstract
The entropy of normalized partial distortions, referred to as the partial distortion entropy, is a very useful metric for online optimality evaluation of a vector quantization code-book. However, it is computationally expensive to update the partial distortion entropy so that it adapts to the changes in a codebook. Hence, its naive computation results in considerably increasing the cost of vector quantization code-book design, especially in the case of a large codebook. This paper presents a novel scheme of the partial distortion entropy updating. The proposed scheme is devised to update the partial distortion entropy without fully recalculating it. Therefore, the scheme requires much less computation than the recalculation, and its computational cost is constant irrespective of a codebook size. Experimental results clearly show that the proposed scheme is significantly effective for saving the computational cost of vector quantization codebook design with the partial distortion entropy.
Keywords
data compression; entropy; image coding; quantisation (signal); code vectors; data compression; online optimality evaluation; partial distortion entropy; vector quantization codebook; Algorithm design and analysis; Computational efficiency; Costs; Data compression; Entropy; Equations; Heuristic algorithms; Minimization methods; Neural networks; Vector quantization;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on
Print_ISBN
0-7695-2108-8
Type
conf
DOI
10.1109/ITCC.2004.1286555
Filename
1286555
Link To Document