Dominant Sets clustering in C++

Here is a C++ implementation of the Dominant Sets clustering algorithm from [1]. It contains both the pairwise clustering and the iterative procedure to obtain multiple clusters.

Clustering results of the demo. Overlapping points in gray.

The original algorithm has been extended in order to handle 3 additional constraints: the maximum cluster size, the minimum cluster size and the number of overlaps per cluster. Overlapping clustering may be useful in some cases: we used it in our paper on 3D reconstruction to create overlaps between camera clusters.

Download the code here and run the demo!

[1] Pavan, Massimiliano, and Marcello Pelillo. “Dominant sets and pairwise clustering” Pattern Analysis and Machine Intelligence 2007

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s