A hierarchical fast encoding algorithm for vector quantization with PSNR equivalent to full search | IEEE Conference Publication | IEEE Xplore

A hierarchical fast encoding algorithm for vector quantization with PSNR equivalent to full search


Abstract:

In order to encode an image using VQ fast, it is most important to eliminate unnecessary distance computation as much as possible while searching for winner code. Sum and...Show More

Abstract:

In order to encode an image using VQ fast, it is most important to eliminate unnecessary distance computation as much as possible while searching for winner code. Sum and partial sum are used as features in this paper to roughly measure the difference between an input image block and a code to check whether current code could be a promising candidate winner code or not. A 3-step hierarchical fast search algorithm is proposed by narrowing search scope, skipping redundant distance computation and lastly simplifying must-do distance computation. For 10 standard gray-level images of size 512/spl times/512 with very different details, computational complexity can be reduced to below 5% ultimately for a codebook of size 1024 or 2048 meanwhile keeping the PSNR not as degraded as that of full search.
Date of Conference: 26-29 May 2002
Date Added to IEEE Xplore: 07 August 2002
Print ISBN:0-7803-7448-7
Conference Location: Phoenix-Scottsdale, AZ, USA
Citations are not available for this document.

1. Introduction

Image compression methods have become very important for communications and multimedia applications. Among lossy block image encoding methods, JPEG and vector quantization (VQ) [1], are famous and classical methods. VQ is proven to be an efficient and effective scheme, especially for image like computer graphics that has many abrupt discontinuities in spectrum domain. VQ uses a look up table (called codebook) principle by template matching in spatial domain so as to find a closest item (winner code) to the input image block within the table according to a certain distortion measure (usually Manhattan distance or Euclidean distance). Then VQ only transmits the index of winner code instead of winner code itself to reduce the amount of image data. Because an exactly the same table (codebook) is also available at the receiving end, the image can be decoded in inverse look-up table way by using received index of winner code and then winner code itself is pasted to corresponding position of the image to reconstruct it. Therefore, VQ features a rather heavy encoding process due to a lot of matching computation and a very simple decoding process.

Cites in Papers - |

Cites in Papers - IEEE (13)

Select All
1.
Zhibin Pan, Koji Kotani, Tadahiro Ohmi, "Fast search method for vector quantization by simultaneously using two subvectors", 2008 IEEE International Conference on Multimedia and Expo, pp.729-732, 2008.
2.
Zhibin Pan, K. Kotani, T. Ohmi, "Fast encoding method for vector quantization based on sorting elements of codewords to adaptively constructing subvectors", 2006 IEEE International Symposium on Circuits and Systems (ISCAS), pp.4 pp.-, 2006.
3.
Ming-Chieh Chung, Shung-Chih Chen, Chao-Tang Yu, Pei-Yin Chen, "An improvement of fast search algorithm for vector quantization", 2005 International Symposium on Intelligent Signal Processing and Communication Systems, pp.97-100, 2005.
4.
Zhibin Pan, Koji Kotani, Tadahiro Ohmi, "Fast encoding method for image vector quantization by using partial sum concept in Walsh domain", 2005 13th European Signal Processing Conference, pp.1-4, 2005.
5.
Chul-hyung Ryu, Sung-woong Ra, "A fast full search equivalent encoding algorithm for image vector quantization based on the WHT and a LUT", Fifth International Workshop on System-on-Chip for Real-Time Applications (IWSOC'05), pp.405-409, 2005.
6.
Zhibin Pan, K. Kotani, T. Ohmi, "Fast Search Method for Image Vector Quantization Based on Equal-Average Equal-Variance and Partial Sum Concept", 2005 IEEE International Conference on Multimedia and Expo, pp.1440-1443, 2005.
7.
Zhibin Pan, K. Kotani, T. Ohmi, "Improved fast encoding method for vector quantization based on subvector technique", 2005 IEEE International Symposium on Circuits and Systems (ISCAS), pp.6332-6335 Vol. 6, 2005.
8.
Zhibin Pan, Koji Kotani, Tadahiro Ohmi, "A fast search method for vector quantization using 2-pixel-merging sum pyramid in recursive way", 2004 12th European Signal Processing Conference, pp.1309-1312, 2004.
9.
Wang Yang, Lu Huanzhang, Sun Guangfu, "A fast search algorithm for template matching based on inequality criterion", Proceedings 7th International Conference on Signal Processing, 2004. Proceedings. ICSP '04. 2004., vol.2, pp.1211-1214 vol.2, 2004.
10.
Zhibin Pan, K. Kotani, T. Ohmi, "An efficient mettiod of constructing L/sub 1/-type norm feature to estimate euclidean distance for fast vector quantization", Proceedings World Automation Congress, 2004., vol.18, pp.217-222, 2004.
11.
Zhibin Pan, K. Kotani, T. Ohmi, "An improved fast encoding method for vector quantization based on memory-efficient data structure", 2004 IEEE International Conference on Multimedia and Expo (ICME) (IEEE Cat. No.04TH8763), vol.2, pp.1119-1122 Vol.2, 2004.
12.
Z. Pan, K. Kotani, T. Ohmi, "An improved full-search-equivalent vector quantization method using the law of cosines", IEEE Signal Processing Letters, vol.11, no.2, pp.247-250, 2004.
13.
Z. Pan, K. Kotani, T. Ohmi, "A fast full search equivalent encoding method for vector quantization by using appropriate features", 2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698), vol.2, pp.II-261, 2003.
Contact IEEE to Subscribe

References

References is not available for this document.