將向量壓縮再壓縮

The vector quantization (VQ) technique uses a codebook containing block
patterns with corresponding index on each of them. In this thesis, we simple TSP
(traveling salesperson) scheme in the VQ (vector quantization) index compression.
The goal of this method is to improve bit ratio scheme with the same image quality.
We apply the TSP (traveling salesperson) scheme to reorder the codewords in the
codebook such that the di erence between the indexes in neighboring blocks of the
image becomes small. Then, the block indexes in the image are remapped according
to the reordered codebook. Thus, the variation between two neighboring block
indexes is reduced. Finally, we compress the block indexes of the image with some
lossless compression methods. Adding our TSP scheme as a step in VQ (vector
quantization) index compression really achieves signi cant reducxtion of bit rates.
Our experiment results show that the bpp (bits per pixel) in our method is less than
the bpp of those without the TSP scheme.

TABLE OF CONTENTS
Page
LIST OF FIGURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
LIST OF TABLES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
ABSTRACT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0
Chapter 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Chapter 2. Vector Quantization (VQ) . . . . . . . . . . . . . . . . . . . 3
2.1 The LBG Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2 The LDF Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
Chapter 3. Lossless Compression Methods . . . . . . . . . . . . . . . . 10
3.1 Set Partitioning in Hierarchical Trees(SPIHT) . . . . . . . . . . . . . 11
3.2 Context-based, Adaptive, Lossless Image Coding (CALIC) . . . . . . 16
3.3 Search-Order Coding (SOC) . . . . . . . . . . . . . . . . . . . . . . . 21
3.4 Address VQ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
Chapter 4. The TSP Scheme for VQ Indexes . . . . . . . . . . . . . . 24
4.1 An Algorithm for the Traveling Salesperson Problem (TSP) . . . . . 25
4.2 Our Indexes Compression Algorithm . . . . . . . . . . . . . . . . . . 28
Chapter 5. Experimental Results . . . . . . . . . . . . . . . . . . . . . . 31
Chapter 6. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46

BIBLIOGRAPHY
[1] V. R. Algazi and R. R. Estes, Analysis based coding of image transform and
subband coeÆcients," Proceedings of the SPIE, Vol. 2564, pp. 11{21, Apr. 1995.
[2] C. D. Bei and R. M. Gray, An improvement of the minimum distortion encod-
ing algorithm for vector quantization," IEEE Transactions on Communications,
Vol. C-33, No. 10, pp. 1132{1133, Oct. 1985.
[3] R. Bellman, Dynamic programming treatment of the traveling salesman prob-
lem," Journal of the ACM, Vol. 9, pp. 61{63, 1962.
[4] A. Buzo, A. H. Gray, R. M. G. Jr, and J. D. Markel, Speech coding based
on vector quantization," IEEE Transactions on Acoustics, Speech, and Signal
Processing, Vol. ASSP-28, No. 10, pp. 562{574, Oct. 1980.
[5] C. K. Chan and C. K. Ma, A fast method of design better codebooks for
image vector quantization," IEEE Transactions on Communications, Vol. 42,
No. 2/3/4, pp. 237{243, Feb./Mar./Apr. 1994.
[6] C. Q. Chen, S. N. Koh, and P. Sivaprakasapillai, Codebook generation for
vector quantization," Electronics Letters, Vol. 31, No. 7, pp. 522{523, Mar.
1995.
[7] C. Q. Chen, S. N. Koh, and I. Y. Soon, Fast codebook search algorithm
for unconstrained vector quantization," IEE Proc.-Vis. Image Signal Process,
Vol. 145, No. 2, pp. 97{102, Apr. 1998.
[8] W. H. Equitz, A new vector quantization clustering algorithm," IEEE Trans-
actions on Acoustics, Speech, and Signal Processing, Vol. 37, No. 10, pp. 1568{
1575, Oct. 1989.
[9] J. K. Flanagan, D. R. Morrell, R. L. Frost, C. J. Read, and B. E. Nelson,
Vector quantization codebook generation using simulated annealing," ICASSP
89, Vol. 3, pp. 1759{1762, Oct. 1989.
[10] P. Franti and T. K. O. Nevalainen, On the splitting method for vector quan-
tization codebook generation," Optical Engineering, Vol. 36, No. 11, pp. 3043{
3051, Nov. 1994.
[11] C. H. Hsieh and J. C. Tsai, Lossless compression of vq index with search-order
coding," IEEE Transcations on Image Process, Vol. 5, No. 11, pp. 1579{1582,
Nov. 1996.
[12] C. H. Hsieh and J. C. Tsai, Lossless compression of vq index with search-order
coding," IEEE Transcations on Image Process, Vol. 5, pp. 1579{1582, 1996.
[13] M. C. Huang and C. B. Yang, Fast algorithm for designing better codebooks
in image vector quantization," Optical Engineering, Vol. 36, No. 12, pp. 3265{
3271, Dec. 1997.
[14] A. E. Jacquin, Fractal image coding: a review," IEE Proceedings, Vol. 81,
pp. 1451{1465, Oct. 1993.
[15] R. L. Joshi and P. G. Poonacha, A new mmse encoding algorithm for vector
quantization," IEEE Int. Conf. Acoust., Speech, and Signal Processing, Vol. 1,
pp. 645{648, May 1991.
[16] C. H. Lee and L. H. Chen, A fast search algorithm for vector quantization
using mean pyramids of codewords," IEEE Transactions on Communications,
Vol. 43, No. 2/3/4, pp. 1697{1702, Feb./Mar./Apr. 1995.
[17] Y. C. Lin and S. C. Tai, Fast feature-based vector quantization algorithm of
image coding," Optical Engineering, Vol. 34, No. 10, pp. 2918{2926, Oct. 1995.
[18] Y. Linde, A. Buzo, and R. M. Gray, An algorithm for vector quantizer design,"
IEEE Transactions on Communications, Vol. C-28, No. 1, pp. 84{95, Jan. 1980.
[19] J. D. C. Little, K. G. Mutry, D. W. Sweeney, and C. Karel, An algorithm for
the traveling salesman problem," Operations Research, Vol. 11, pp. 972{989,
1963.
[20] K. T. Lo and W. K. Cham, Subcodebook searching algorithm for eÆcient vq
encoding of images," IEE Proceedings-1, Vol. 140, No. 5, pp. 327{330, Oct.
1993.
[21] B. Marangelli, A vector quantizer with minimum visible distortion," IEEE
Transactions on Signal Processing, Vol. 39, No. 12, pp. 2718{2721, Dec. 1991.
[22] N. M. Nasrabadi, C. Y. Choo, and Y. Feng, Dynamic nite-state vector quan-
tization of digital images," IEEE Transactions on Communications, Vol. 42,
No. 5, pp. 2145{2154, May 1994.
[23] N. M. Nasrabadi and Y. Feng, Image compression using address-vector quanti-
zation," IEEE Transactions on Communications, Vol. 38, pp. 2166{2173, Dec.
1990.
[24] N. M. Nasrabadi and R. A. King, Image coding using vector quantization: a
review," IEEE Transactions on Communications, Vol. 36, No. 8, pp. 957{971,
Aug. 1988.
[25] T. Orchard, A fast nearest-neighbor search algorithm," IEEE Int. Conf.
Acoust., Speech, and Signal Processing, Vol. 4, pp. 2297{2300, May 1991.
[26] G. Poggi, Fast algorithm for full-search VQ encoding," Electronics Letters,
Vol. 29, No. 12, pp. 1141{1142, June 1993.
[27] W. K. Pratt, Digital image processing. New York, American: John Wiley &
Sons, second ed., 1991.
[28] V. Ramasubramanian and K. K. Paliwal, Fast k-dimensional tree algorithm
for nearest neighbor search with application to vector quantization encoding,"
IEEE Transactions on Signal Processing, Vol. 40, No. 3, pp. 518{531, Mar.
1992.
[29] A. Said and W. A. Pearlman, A new, fast, and eÆcient image codec based
on set partitioning in hierarchical trees," IEEE Transactions on Circuits and
System For video Technology, Vol. 6, No. 3, pp. 243{250, June 1996.
[30] J. M. Shapiro, Embedded image coding using zerotrees of wavelet coeÆcients,"
IEEE Transactions on Signal Processing, Vol. 41, No. 12, pp. 3445{3462, Dec.
1993.
[31] V. S. Sitaram, C. M. Huang, and P. D. Israelsen, EÆcient codebooks for vector
quantization image compression with an adaptive tree search algorithm," IEEE
Transactions on Communications, Vol. 42, No. 11, pp. 3027{3033, Nov. 1994.
[32] M. R. Soleyamani and S. D. Morgera, A new mmse encoding algorithm for
vector quantization," IEEE Transactions on Communications, Vol. 37, No. 6,
pp. 656{659, June 1989.
[33] M. R. Soleymani and S. D. Morgera, An eÆcient nearest neighbor search
method," IEEE Transactions on Communications, Vol. COM-35, No. 6,
pp. 677{679, June 1987.
[34] S. C. Tai, Data compression. Taipei, Taiwan: Unalis, second ed., 1998.
[35] S. C. Tai, C. C. Lai, and Y. C. Lin, Two fast nearest neighbor searching algo-
rithms for image vector quantization," IEEE Transactions on Communications,
Vol. 44, No. 12, pp. 1623{1628, Dec. 1996.
[36] L. Torres and J. Huguet, An improvement on codebook search for vector
quantization," IEEE Transactions on Communications, Vol. 42, No. 2/3/4,
pp. 208{210, Feb./Mar./Apr. 1994.
[37] M. J. Weinberger, J. J. Rissanen, and R. B. Arps, Applications of universal
context modeling to lossless compression of gray-scale images," IEE Proceed-
ings, Vol. 5, pp.575{586, Apr. 1990.
[38] X. Wu and N. Memon, Context-based, adaptive, lossless image coding," IEEE
Transactions on Communications, Vol. 45, No. 4, pp. 437{444, Apr. 1997.
[39] C. I. Yang, J. S. Wang, and R. C. T. Lee, A branch-and-bound algorithm
to solve the equal-execution-time job scheduling problem with precedence con-
straint and pro le," Computers and Operations Research, Vol. 16, pp. 257{269,
1989.
[40] H. K. Yong and W. M. James, Adaptive entropy-code pruned tree-structured
predictive vector quantization of image," IEEE Transactions on Communica-
tions, Vol. 41, No. 1, pp. 171{185, Jan. 1993.
[41] P. Yu and A. N. Venetsanopoulos, Hierarchical nite-state vector quantization
for image coding," IEEE Transactions on Communications, Vol. 42, No. 11,
pp. 3020{3026, Nov. 1994.
[42] S. Zhong, F. Chin, and Q. Y. Shi, Adaptive hierarchical vector quantization
for image coding: new results," Optical Engineering, Vol. 34, No. 10, pp. 2912{
2917, Oct. 1995.