Quickshift++: Provably Good Initializations for Sample-Based Mean Shift
classification
💻 cs.LG
stat.ML
keywords
shiftclusteringquickseedingsalgorithmapplicationsapproximatecluster-cores
read the original abstract
We provide initial seedings to the Quick Shift clustering algorithm, which approximate the locally high-density regions of the data. Such seedings act as more stable and expressive cluster-cores than the singleton modes found by Quick Shift. We establish statistical consistency guarantees for this modification. We then show strong clustering performance on real datasets as well as promising applications to image segmentation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.