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 this paper, we propose the use of a variable scale factor which is a function of the iteration number. For the vector quantization of image data, we show that it offers faster convergence than the modified -means algorithm with a fixed scale factor, without affecting the optimality of the codebook.
منابع مشابه
Comments on “ Modified - 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 this paper, we propose the use of a variable scale factor which is a function of the iteration number. For the vecto...
متن کاملAn Entropy Based Study of Scaling Factors: Vector Quantizer Design
− A modified K−means algorithm for vector quantization design has been proposed recently. In this proposition the codevector updating step is as follows: new codevector = current codevector + scale factor (new centroid − current codevector). A fixed scale factor is being used in this algorithm. In this paper, we have studied a class of scaling functions which satisfy criteria derived in the pap...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملGradient algorithms for designing predictive vector quantizers
A predictive vector quantizer (PVQ) is a vector extension of a predictive quantizer. It consists of two parts: a conventional memoryless vector quantizer (VQ) and a vector predictor. Two gradient algorithms for designing a PVQ are developed in this paper: the steepest descent (SD) algorithm and the stochastic gradient (SG) algorithm. Both have the property of improving the quantizer and the pre...
متن کاملAn adaptive-search residual vector quantizer for airborne reconnaissance
A lossy image compression algorithm designed for highspeed, high quality data applications is described. The algorithm consists of a vector quantizer followed by a modified Huffman entropy encoder. The quantizer is a meanremoved, adaptive-search, residual vector quantizer. A few details of a high-speed hardware implementation for reconnaissance are given, as well as an example of the performanc...
متن کامل