350 rub
Journal Nonlinear World №9 for 2012 г.
Article in number:
Quantization in wavelet based image compression systems
Authors:
A.L. Priorov, I.S. Mochalov
Abstract:
Most current digital image wavelet-compression systems based on the principle transform / quantization / entropy coding. Naturally at each step you want to achieve maximum gains. However, this approach does not always produce the best results, because modern compression algorithms (SPIHT, EBCOT, etc.) use a complex hierarchical structure entropy coding. The problem is that the adaptive quantization techniques based on the coding of transform coefficients as a random source. Mallat showed that coding coefficients as a random source is not effective way even when the decoder knows the probability density function of the source. Because of these problems, encoders (EZW, SPIHT, EBCOT) usually use simple scalar quantization with uniform quantization scale and extended zero level. There are better methods of vector quantization, requiring additional computing resources, but they do not solve this problem completely. Therefore, building a good quantization system must be based on the hierarchical structure of the entropy coder (eg, SPIHT). We must define the partition of the set of values into the set of intervals and code book, which will contain the values that are mapped to the i-th interval in the inverse quantization (dequantization). When the system is built, the quantization process scalar or vector value into index of interval, which holds the value. Entropy coder converted indices i into bitstream. Dequantization recover corresponding index value from the codebook. A natural requirement in the construction of the system is to minimize the quantization error whit constraints on the size of the bitstream. In this work new algorithm for the quantization of wavelet coefficients proposed. It minimize distortion in the wavelet-domain at a fixed codebook, bitstream size and entropy encoder STW (SPIHT). The results of testing the algorithm fully confirm the theoretical position. The algorithm was tested on a series of test images from the University of Southern California test database (http://sipi.usc.edu/database/). At all steps of quantization and on all test images from a database developed algorithm is superior quantization algorithm SPIHT on average of 0.5 - 1 dB PSNR metric. The basic algorithms of quantization of the wavelet coefficients in compression systems are considered. New wavelet coefficients quantization algorithm based on the hierarchical structure of the entropy coder which minimizes MSE of the wavelet coefficients with a fixed codebook and restrictions on the number of bits was offered.
Pages: 595-603
References
  1. Малла С. Вейвлеты в обработке сигналов. М.: Мир. 2005.
  2. Lloyd S.P. Least squares quantization in PCM // unpublished Bell Lab. Tech. Note, portions presented at the Institute of Mathematical Statistics Meet. Atlantic City. NJ. 1957.
  3. Max J. Quantizing for minimum distortion // IEEE Trans. On Inform. Theory. 1960. V. IT-6. P. 7-12.
  4. Shannon C.E. A mathematical theory of communication // Bell Syst. Tech. J. 1948. V. 27. P. 379-423; 623-656.
  5. Shannon C.E. Coding theorems for a discrete source with a fidelity criterion // IRE Nat. Conv. Rec. 1959. Pt. 4. P. 142-163.
  6. Berger T. Rate distortion theory for sources with abstract alphabet and memory // Inform. Contr. 1968. V. 13. P. 254-273.
  7. Linde Y., Buzo A., Gray R.M. An algorithm for vector quantizer design // IEEE Trans. Commun. 1980. V. COM-28. P. 84-95.
  8. Chou P.A., Lookabaugh T., Gray R.M.Entropy-constrained vector quantization // IEEE Trans. Acoust., Speech, Signal Processing. 1989. V. 37. P. 31-42.
  9. Chou P.A., Lookabaugh T., Gray R.M. Optimal pruning with applications to tree-structured source coding and modeling // IEEE Trans. Inform. Theory. 1989. V. 35. P. 299-315.
  10. Kiang S.-Z., Baker R.L., Sullivan G.J., Chiu C.-Y.Recursive optimal pruning with applications to tree structured vector quantizers // IEEE Trans. Image Processing. 1992. V. 1. P. 162-169.
  11. Said A., Pearlman W.A. A New Fast and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees // IEEE Trans. on Circuits and Systems for Video Technology. 1996. V. 6. P. 243-250.
  12. Приоров А.Л., Ганин А.Н., Хрящёв В.В.Цифровая обработка изображений: Учеб. пособие. Ярославль: ЯрГУ. 2001.
  13. Приоров А.Л., Мочалов И.С. Применение измененной схемы вейвлет-преобразования для сжатия изображений // Электросвязь. 2009. № 11. С. 29‑34.