A Mean Shift Clustering Implementation for VTK
logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/3219
Mean shift clustering is an excellent technique for clustering points when the number of clusters is not known. We present a implementation (vtkMeanShiftClustering) of the simplest version of the algorithm written in a VTK context.

The code is currently hosted at http://github.com/daviddoria/vtkMeanShiftClustering .

Reviews
There is no review at this time. Be the first to review this publication!

Quick Comments


Resources
backyellow
Download All
Download Paper , View Paper

Statistics more
backyellow
Global rating: starstarstarstarstar
Review rating: starstarstarstarstar [review]
Paper Quality: plus minus

Information more
backyellow
Categories: Density Functions, Iterative clustering
Keywords: Mean shift, clustering
Export citation:

Share
backyellow
Share

Linked Publications more
backyellow
Diffeomorphic Demons Using ITK's Finite Difference Solver Hierarchy Diffeomorphic Demons Using ITK's Finite Difference Solver Hierarchy
by Vercauteren T., Pennec X., Perchant A., Ayache N.
Hough Transform Plane Detector Hough Transform Plane Detector
by Borrmann D., Doria D.

View license
Loading license...

Send a message to the author
main_flat
Powered by Midas