Quickshift++: Provably Good Initializations for Sample-Based Mean Shift
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.
Code (1)
Tasks
ClusteringImage SegmentationSemantic SegmentationSimilar Papers 제목 키워드 기반
How to scale hyperparameters for quickshift image segmentation
Quickshift is a popular algorithm for image segmentation, used as a preprocessing step in many applications. Unfortunately, it is quite challenging to understand the hyperparameters' influence on the number and shape of …
Image SegmentationSemantic SegmentationSuperpixelsGood Initializations of Variational Bayes for Deep Models
Stochastic variational inference is an established way to carry out approximate Bayesian inference for deep models. While there have been effective proposals for good initializations for loss minimization in deep learnin…
Bayesian InferenceGeneral ClassificationregressionVariational InferenceIQP Born Machines under Data-dependent and Agnostic Initialization Strategies
Quantum circuit Born machines based on instantaneous quantum polynomial-time (IQP) circuits are natural candidates for quantum generative modeling, both because of their probabilistic structure and because IQP sampling i…
Quantum Machine LearningFast and Provably Good Seedings for k-Means
Seeding - the task of finding initial cluster centers - is critical in obtaining high-quality clusterings for k-Means. However, k-means++ seeding, the state of the art algorithm, does not scale well to massive datasets a…
ClusteringDistributed and Provably Good Seedings for k-Means in Constant Rounds
The k-Means++ algorithm is the state of the art algorithm to solve k-Means clustering problems as the computed clusterings are O(log k) competitive in expectation. However, its seeding step requires k inherently seq…
Clustering