سند علمی

An algorithm for uniform vector quantizer design

چکیده

A vector quantizer maps a k-dimensional vector into one of a finite set of output vectors or “points”. Although certain lattices have been shown to have desirable properties for vector quantization applications, there are as yet no algorithms available in the quantization literature for building quantizers based on these lattices. An algorithm for designing vector quantizers based on the root lattices A,, 0, , and IT, and their duals is presented. Also, a coding scheme that has general applicability to all vector quantizers is presented. A four-dimensional uniform vector quantizer is used to encode Laplacian and gamma-distributed sources at entropy rates of one and two bits / sample and is demonstrated to achieve performance that compares favorably with the rate distortion bound and other scalar and vector quantizers. Finally, an application using uniform fourand eight-dimensional vector quantizers for encoding the discrete cosine transform coefficients of an image at 0.5 bit /pel is presented, which visibly illustrates the performance advantage of vector quantization over scalar quantization.

اسناد مشابه

  • Comments on “ Modified - Means Algorithm for Vector Quantizer Design ”

    سند علمی۲۰۰۰Kuldip K. Paliwal, V. Ramasubramanian

    Recently a modified -means algorithm for vector quantization design has been proposed where the codevector updating step is as follows: new codevector = current codevector + scale factor (new centroid current codevector). This algorithm uses a fixed value for the scale factor. In

  • Comments on " Modified K - means algorithm for vector quantizer design

    سند علمی۲۰۱۷Kuldip K. Paliwal, V. Ramasubramanian

    Recently a modified -means algorithm for vector quantization design has been proposed where the codevector updating step is as follows: new codevector = current codevector + scale factor (new centroid current codevector). This algorithm uses a fixed value for the scale factor. In

  • Terrain-Based Memetic Algorithms for Vector Quantizer Design

    سند علمی۲۰۰۸NICSOCarlos R. B. Azevedo, Flávia E. A. G. Azevedo, Waslon Terllizzie A. Lopes, Francisco Madeiro

    Recently, a Genetic Accelerated K-Means Algorithm (GAKM) was proposed as an approach for optimizing Vector Quantization (VQ) codebooks, relying on an accelerated version of K-Means algorithm as a new local learning module. This approach requires the determination of a scale facto

  • Comments on "modified K-means algorithm for vector quantizer design"

    مقاله‌ی دسترسی آزاد۲۰۰۰IEEE Transactions on Image ProcessingK.K.Paliwal, V.Ramasubramanian
  • Vector Quantizer Design Using Genetic Algorithms

    سند علمی۱۹۹۶Data Compression ConferenceSunghyun Choi, Wee Keong Ng

    The design of vector quantizers (VQs) that yield minimal distortion is one of the most challenging problems in source coding. The problem of VQ design is to find a codebook that gives the least overall distortion (or equivalently, the largest signal-to-noise ratio (SNR)) for a gi

  • A clustering algorithm for entropy-constrained vector quantizer design with applications in coding image pyramids

    سند علمی۱۹۹۵IEEE Trans. Circuits Syst. Video Techn.Diego P. de Garrido, William A. Pearlman, Weiler Alves Finamore

    {A clustering algorithm for the design of eecient vector quantizers to be followed by entropy coding is proposed. The algorithm, called entropy-constrained pair-wise nearest neighbor (ECPNN), designs codebooks by merging the pair of Voronoi regions which gives the least increase