Vector Quantization Using a Dynamic Address Mapping


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 5, pp. 1307-1316, Sep. 1996
10.3745/KIPSTE.1996.3.5.1307,   PDF Download:

Abstract

In this paper, we propose a vector Quantization method which uses a dynamic adress mapping based on exploiting the high interblock correlation. In this proposed method, we reduce bit-rate by defining an address transform function, which maps a VQ address of an input block which will be encoded into a new address in the reordered codebook by using side match error. In one case that an original address can be transformed into a new transformed address which is lower than the threshold value, we encode the new address of the transformed codevector, and in the other case we encode the address of the original codevector which is not transformed. Experimental results indicate that the proposed scheme reduces the bit-rate by 45-50% compared with the ordinary VQ method for image compression, at the same quality of the reconstructed image as that of the ordinary VQ system.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. D. Wha, B. S. Ho, P. K. Houm, "Vector Quantization Using a Dynamic Address Mapping," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 5, pp. 1307-1316, 1996. DOI: 10.3745/KIPSTE.1996.3.5.1307.

[ACM Style]
Seo Dae Wha, Bae Sung Ho, and Park Kil Houm. 1996. Vector Quantization Using a Dynamic Address Mapping. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 5, (1996), 1307-1316. DOI: 10.3745/KIPSTE.1996.3.5.1307.