hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1)



Sequential Leader algorithm:



Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY.



1. Select maximum cluster "radius"

2. Start with zero clusters

3. Add each item to be clustered to:

* Closest cluster if distance <= r

* New cluster if distance to closest cluster > r

4. Compute new center from members in cluster

5. Empty the clusters (keeping the centers)

6. Return to step 3 (until no changes are made)

-hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1)



Sequential Leader algorithm:



Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY.



　 1. Select maximum cluster "radius"

　 2. Start with zero clusters

　 3. Add each item to be clustered to:

　　　　　* Closest cluster if distance <= r

　　　　　* New cluster if distance to closest cluster > r

　 4. Compute new center from members in cluster

　 5. Empty the clusters (keeping the centers)

　 6. Return to step 3 (until no changes are made)