Vector Quantization : Quantization, Signal Processing, Data Compression, Centroid, K-Means Clustering, Clustering, Density Estimation, Self-Organizing Map, Simulated Annealing, Entropy Encoding

Lambert M. Surhone

ISBN 10: 6130354576 / ISBN 13: 9786130354572

Edité par Omniscriptum, 2010

A propos de cet article

nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! Vector quantization is a classical quantization technique from signal processing which allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of points (vectors) into groups having approximately the same number of points closest to them. Each group is represented by its centroid point, as in k-means and some other clustering algorithms. The density matching property of vector quantization is powerful, especially for identifying the density of large and high-dimensioned data. Since data points are represented by the index of their closest centroid, commonly occurring data have low error, and rare data high error. This is why VQ is suitable for lossy data compression. It can also be used for lossy data correction and density estimation. Vector quantization is based on the competitive learning paradigm, so it is closely related to the self-organizing map model.

N° de réf. du vendeur 9786130354572

Détails bibliographiques

• Titre: Vector Quantization : Quantization, Signal Processing, Data Compression, Centroid, K-Means Clustering, Clustering, Density Estimation, Self-Organizing Map, Simulated Annealing, Entropy Encoding
• Éditeur: Omniscriptum
• Date de parution: 2010
• Langue: anglais
• ISBN à 10 chiffres: 6130354576
• ISBN à 13 chiffres: 9786130354572
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 220 L x 150 H x 7 P (en millimètres) 220 millimètres de largeur par 150 millimètres de hauteur par 7 millimètres de profondeur
• Poids: 179 grammes

A propos de ce titre

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Vector quantization is a classical quantization technique from signal processing which allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of points (vectors) into groups having approximately the same number of points closest to them. Each group is represented by its centroid point, as in k-means and some other clustering algorithms. The density matching property of vector quantization is powerful, especially for identifying the density of large and high-dimensioned data. Since data points are represented by the index of their closest centroid, commonly occurring data have low error, and rare data high error. This is why VQ is suitable for lossy data compression. It can also be used for lossy data correction and density estimation. Vector quantization is based on the competitive learning paradigm, so it is closely related to the self-organizing map model.