A fast computation scheme of partial distortion entropy updating

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

Original languageEnglish
Title of host publicationInternational Conferen ON Information Technology
Subtitle of host publicationCoding Computing, ITCC 2004
EditorsP.K. Srimani, A. Abraham, M. Cannataro, J. Domingo-Ferrer, R. Hashemi
Pages736-741
Number of pages6
DOIs
Publication statusPublished - 2004 Jul 7
EventInternational Conference on Information Technology: Coding Computing, ITCC 2004 - Las Vegas, NV, United States
Duration: 2004 Apr 52004 Apr 7

Publication series

NameInternational Conference on Information Technology: Coding Computing, ITCC
Volume1

Other

OtherInternational Conference on Information Technology: Coding Computing, ITCC 2004
CountryUnited States
CityLas Vegas, NV
Period04/4/504/4/7

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Engineering(all)

Fingerprint Dive into the research topics of 'A fast computation scheme of partial distortion entropy updating'. Together they form a unique fingerprint.

  • Cite this

    Takizawa, H., & Kobayashi, H. (2004). A fast computation scheme of partial distortion entropy updating. In P. K. Srimani, A. Abraham, M. Cannataro, J. Domingo-Ferrer, & R. Hashemi (Eds.), International Conferen ON Information Technology: Coding Computing, ITCC 2004 (pp. 736-741). (International Conference on Information Technology: Coding Computing, ITCC; Vol. 1). https://doi.org/10.1109/ITCC.2004.1286555