Bi-Level Vector Quantization Method for Codebook Generation
H. B. Kekre, Tanuja Sarode
Abstract
H. B. Kekre, Tanuja Sarode
Abstract
Vector Quantization is lossy data compression technique and has various applications. Key to Vector Quantization is good codebook. Once the codebook size is fixed then for any codebook generation algorithm the MSE reaches a value beyond which it cannot be reduced unless the codebook size is increase. In this paper we are proposing bi-level codebook generation algorithm which reduces mean squared error (MSE) for the same codebook size. For demonstration we have used codebooks obtained from well known Linde Buzo and Gray (LBG) algorithm. The proposed method is general and can be applied to any codebook generation algorithm.
OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Vector Quantization is lossy data compression technique and has various applications. Key to Vector Quantization is good codebook. Once the codebook size is fixed then for any codebook generation algorithm the MSE reaches a value beyond which it cannot be reduced unless the codebook size is increase. In this paper we are proposing bi-level codebook generation algorithm which reduces mean squared error (MSE) for the same codebook size. For demonstration we have used codebooks obtained from well known Linde Buzo and Gray (LBG) algorithm. The proposed method is general and can be applied to any codebook generation algorithm.
Key concepts: Codebook, Linde–Buzo–Gray algorithm, Vector quantization, Lossy compression, Algorithm, Quantization (signal processing), Computer science, Mean squared error