Linde–Buzo–Gray algorithm: Difference between revisions

Revision as of 00:28, 31 May 2010

Revision as of 19:21, 31 May 2010

Line 1:

{{orphan}}

The '''Linde–Buzo–Gray algorithm''' is a [[vector quantization]] algorithm to derive a good [[codebook]].

It is similar to the [[k-means]] method in [[data clustering]].

Line 15 ⟶ 13:

== References ==

* The original paper describing the algorithm, as an extension to [[Lloyd's algorithm]]:

**Linde, Y., Buzo, A., Gray, R., ''An Algorithm for Vector Quantizer Design'', [[IEEE Transactions on Communications]], vol. 28, pp. 84-94 84–94, 1980. http://ieeexplore.ieee.org/xpls/abs_all.jsp?&arnumber=1094577

==External links==

Line 23 ⟶ 21:

[[Category:Machine learning]]

[[Category:Neural networks]]

{{algorithm-stub}}