Generlized Lloyd / Linde-Buzo-Gray implementation in Java. Can be used to generate cluster points from a big amount of multidimensional vectors. Also includes a set of distance metrics (hausdorff / modified hausdorf, histogram intersection, etc.) to calculate distances between vectors.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.

Java Implementation for Generalized Lloyd / Linde-Buzo-Gray Algorithm

This small Java library implements the Generalized-Lloyd or Linde-Buzo-Gray Algorithm for vector quantization. It therefore allows clustering of vectors of any dimension. This is helpful for example for image classification when using the SIFT or SURF algorithms. It might be also useful if you want to cluster a large amount of points on a map.

See also:

See also my Python implementation.

The source-code is provided under LGPL license.