Comments on "modified K-means algorithm for vector quantizer design"
چکیده
چکیدهای برای این سند ثبت نشده است.
چکیدهای برای این سند ثبت نشده است.
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
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
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 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
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 literat
In this paper, a fast search algorithm for mean-removed vector quantization is proposed. Two inequalities are used to reduce distortion computations. Our algorithm makes use of a mean-removed vector’s features (edge and texture strengths) to reject many unlikely codewords and it