Vector quantization and signal compression
Vector quantization and signal compression
Rate conversion of MPEG coded video by re-quantization process
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
On psychoacoustic noise shaping for audio requantization
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 3 (ICME '03) - Volume 03
A fast scheme for arbitrarily resizing of digital image in the compressed domain
IEEE Transactions on Consumer Electronics
Requantization for transcoding of MPEG-2 intraframes
IEEE Transactions on Image Processing
A fast exact GLA based on code vector activity detection
IEEE Transactions on Image Processing
Recompression of JPEG images by requantization
IEEE Transactions on Image Processing
L/M-fold image resizing in block-DCT domain using symmetric convolution
IEEE Transactions on Image Processing
Fast-searching algorithm for vector quantization using projection and triangular inequality
IEEE Transactions on Image Processing
Optimization of requantization codebook for vector quantization
IEEE Transactions on Image Processing
Accelerating the Optimization of Requantization Codebook for Vector Quantization
IEEE Transactions on Image Processing
An HDTV-to-SDTV spatial transcoder
IEEE Transactions on Circuits and Systems for Video Technology
A Fast Arbitrary Factor Video Resizing Algorithm
IEEE Transactions on Circuits and Systems for Video Technology
Grouping strategies for promoting image quality of watermarking on the basis of vector quantization
Journal of Visual Communication and Image Representation
Fast requantization using self organizing feature map with orthogonal polynomials transform
Proceedings of the 2011 International Conference on Communication, Computing & Security
An edge preserving requantization model for color image coding with orthogonal polynomials
Digital Signal Processing
Hi-index | 0.01 |
In this paper, we present a fast codebook re-quantization algorithm (FCRA) using codewords of a codebook being re-quantized as the training vectors to generate the re-quantized codebook. Our method is different from the available approach, which uses the original training set to generate a re-quantized codebook. Compared to the traditional approach, our method can reduce the computing time dramatically, since the number of codewords of a codebook being re-quantized is usually much smaller than the number of original training vectors. Our method first classifies codewords of a re-quantized codebook into static and active groups. This approach uses the information of codeword displacements between successive partitions to reject impossible candidates in the partition process of codebook re-quantization. By implementing a fast search algorithm used for vector quantization encoding (MFAUPI) in the partition step of FCRA, the computational complexity of codebook re-quantization can be further reduced significantly. Using MFAUPI, the computing time of FCRA can be reduced by a factor of 1.55-3.78. Compared with the available approach OARC (optimization algorithm for re-quantization codebook), our proposed method can reduce the codebook re-quantization time by a factor of about 8005 using a training set of six real images. This reduction factor is increased when the re-quantized codebook size and/or training set size are increased. It is noted that our proposed algorithm can generate the same re-quantized codebook as that produced by the OARC.