{"categories":[],"blog_title":"OLD hanecci\u2019s blog : \u65e7 \u306f\u306d\u3063\u3061\u30d6\u30ed\u30b0","title":"Algorithms of Vector Quantization","author_url":"https://blog.hatena.ne.jp/hanecci/","height":"190","width":"100%","published":"2012-12-23 00:00:00","provider_url":"https://hatena.blog","author_name":"hanecci","blog_url":"https://hanecci.hatenadiary.org/","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fhanecci.hatenadiary.org%2Fentry%2F20121223%2Fp1\" title=\"Algorithms of Vector Quantization - OLD hanecci\u2019s blog : \u65e7 \u306f\u306d\u3063\u3061\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://hanecci.hatenadiary.org/entry/20121223/p1","description":"Vector Quantization (VQ) is used to compress the input vectors to a small number of vectors by using some kind of algorithms.These are some basic algorithms for doing it. K-Means [0] Linde-Buzo-Gray (LBG) Algorithm[1][2] Pairwise Nearest Neighbor (PNN)[2] This combines the two clusters which have sm\u2026","type":"rich","image_url":null,"version":"1.0"}