Fast codebook generation for Vector Quantization using Ordered Pairwise Nearest Neighbor with Multiple Merging (original) (raw)
Related papers
Novel codebook generation algorithms for vector quantization image compression
Novel algorithms for vector quantization codebook design are presented in this paper. Two basic techniques are proposed. The first technique takes into consideration specific characteristics of the blocks of the training sequence during the generation of the initial codebook. In this way a representative initial codebook is generated. Starting from a high quality initial codebook the iterative optimization procedure converges fast to a representative final codebook which in turn leads to high output image quality. The second proposed technique extends small codebooks computationally. The main idea is the application of simple transformations on the codewords. This technique reduces the memory requirements of the traditional vector quantization making it useful for applications requiring lowpower consumption.
International Journal of Computer Applications, 2011
Vector Quantization (VQ) is one of the lossy image compression techniques. VQ comprises of three different phases: Codebook Generation, Image Encoding and Image Decoding. The performance of VQ is mainly based on the codebook generation phase. In this paper, five different codebook generation techniques namely the Simple Codebook Generation (SCG), Ordered Codebook Generation (OCG), Codebook Generation by Sorting the Sum of Sib Vectors (CBSSSV), Codebook Generation with Edge Features (CBEF) and Codebook Generation with Cluster Density (CBCD) for Vector Quantization have been discussed and their performance in terms of number of iterations required to converge with respect to Peak Signal to Noise Ratio (PSNR) is compared when k-Means Clustering technique is used to optimize the initial codebook that is created by any of the above techniques. Of these discussed techniques, the CBEF technique performs better.
Novel codebook design techniques for vector quantization image compression
Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97, 1997
ABSTRACT In this paper new techniques for codebook design are presented. A new algorithm for codebook design is described. Specific characteristics of the blocks of the training sequence are taken into consideration during generation of the initial codebook. Beginning with a representative initial codebook the iterative optimization procedure converges quickly in representative final codebook which in turn leads to high output image quality. A technique for computational extension of small codebooks is also proposed. It is based on the application of simple transformations on the codewords. The reduced memory requirements of the proposed technique makes it very useful for applications requiring low-power consumption
Image compression by vector quantization: a review focused on codebook generation
Image and Vision Computing, 1994
ABSTRACT Recently, vector quantization (VQ) has received considerable attention, and has become an effective tool for image compression. It provides a high compression ratio and a simple decoding process. However, studies on the practical implementation of VQ have revealed some major difficulties such as edge integrity and codebook design efficiency. After reviewing the state-of-the-art in the field of vector quantization, we focus on iterative and non-iterative codebook generation algorithms.
“Survey on Vector Quantization for Image Compression”
2020
This paper presents a hybrid (loss less and lossy) technique for image vector quantization. The codebook is generated in two steps and first step is training set is sorted based on the magnitudes of the training vectors and step 2 is from the sorted list, training vector from every nth position is selected to for the code vectors. Followed by that, centroid computation with clustering is done by repeated iterations to improve the optimality of the codebook. The code book thus generated is compressed (Iossy) to reduce the memory needed to store the codebook with the slight degradation in the quality of the reconstructed image. The future wireless networks, such as Centralized Radio Access Network (C-RAN), c will requirement to deliver data rate about 100 times to 1000 times the current 4G technology. For C-RAN based network layout, there is a pressing The future wireless networks, such as Centralized Radio Access Network (CRAN), will need to deliver data rate about 100 times to 1000 ...
An improved vector quantization method for image compression
Vector quantization (VQ) is considered a common used image compression method. Due to the uncomplicated process of decompression and high compression ratio, it is widely used for network transmission or medical image storage. However, the reconstructed image after decompression has high distortion. To improve the quality of the reconstructed image without increasing computational complexity, a novel VQ method combined with Block Truncation Coding (BTC) is proposed to reduce the distortion of decompression image. The compressed codes of proposed method for an image block contain the block mean and the index recording the closest residual vector in the codebook is calculated. Moreover, a bit-plan which records the relationship between the pixels and the mean value. With the bit-plan, the residual vector can be consists of positive value only. Because the method of codebook training is a clustering approach, smaller variations within the residual vector make training more accurate. The proposed method is tested using public image. The experimental results show that the proposed method can get better Peak Signal to Noise Ratio (PSNR) without increasing the codebook size and the compression complexity.
Compression of vector quantization code sequences based on code frequencies and spatial redundancies
1996
Vector quantization (VQ) can be used to compress images with high compression ratios. The VQ methods produce a sequence of code values which identifies the codebook model vectors to be used as blocks of pixels in the decoded image. In this paper we define a novel non-lossy and computationally efficient method to further compress the code sequence based on the relative frequencies of the code values, and the spatial distribution of each code. In an example case we reduced the bit rate by 29 %. A further reduction of 7 percentage units was obtained when the VQ codebook was produced by the self-organizing map (SOM) algorithm. A SOM codebook has the property that similar blocks have similar codes, which was used to take advantage of spatial redundancies in the image.
Techniques for generating initial codebook for Vector Quantization
2011 3rd International Conference on Electronics Computer Technology, 2011
Vector Quantization (VQ) is one of the lossy image compression techniques. VQ comprises of three stages: Codebook Generation, Image Encoding and Image Decoding. The key component of VQ is the codebook generation. The performance of VQ depends on the quality of the codebook that is generated. In this paper, we have proposed novel ideas for generating the initial codebook. The proposed ideas are implemented with standard images of varying gray levels. The pros and cons of the proposed methods are discussed with the results obtained out of the experiments. Experimental results show that the proposed methods give better results when compared to other existing methods.
Simple and Fast Ordered Codebook for Vector Quantization
In this paper, we propose two fast and efficient methods to generate codebook for Vector Quantization (VQ). The computational complexity is very simple when compared to any one of the existing algorithms for generating codebook for VQ. In the first method, codevectors are selected at regular intervals from the training set. The second method is an improvement over the first one. In the second method, the training vectors are ordered by the sum of the elements in each training vector. From the ordered training set, codebook is generated by taking the training vectors at regular intervals. Experimental results on standard images show that both methods give better results in image quality and computation time than the popular LGB algorithm. Among the two, the second method gives better results than the first one.
Fast codebook searching in a SOM-based vector quantizer for image compression
Signal, Image and Video Processing, 2007
We propose a novel method for fast codebook searching in self-organizing map (SOM)-generated codebooks. This method performs a non-exhaustive search of the codebook to find a good match for an input vector. While performing an exhaustive search in a large codebook with high dimensional vectors, the encoder faces a significant computational barrier. Due to its topology preservation property, SOM holds a good promise of being utilized for fast codebook searching. This aspect of SOM remained largely unexploited till date. In this paper we first develop two separate strategies for fast codebook searching by exploiting the properties of SOM and then combine these strategies to develop the proposed method for improved overall performance. Though the method is general enough to be applied for any kind of signal domain, in the present paper we demonstrate its efficacy with spatial vector quantization of gray-scale images.