Skip to content

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.

master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
src
 
 
 
 
 
 
 
 
 
 

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: https://mkonrad.net/projects/gen_lloyd.html

See also my Python implementation.

The source-code is provided under LGPL license.

About

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.

Topics

Resources

Releases

No releases published

Packages

No packages published

Languages