Quickshift++: Provably Good Initializations for Sample-Based Mean Shift

05/21/2018
by   Heinrich Jiang, et al.
0

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.

READ FULL TEXT
research
03/02/2015

A review of mean-shift algorithms for clustering

A natural way to characterize the cluster structure of a dataset is by f...
research
10/29/2017

On the Consistency of Quick Shift

Quick Shift is a popular mode-seeking and clustering algorithm. We prese...
research
10/13/2016

Statistical Inference Using Mean Shift Denoising

In this paper, we study how the mean shift algorithm can be used to deno...
research
05/03/2015

Risk Bounds For Mode Clustering

Density mode clustering is a nonparametric clustering method. The cluste...
research
06/21/2021

Large-scale image segmentation based on distributed clustering algorithms

Many approaches to 3D image segmentation are based on hierarchical clust...
research
08/06/2014

The functional mean-shift algorithm for mode hunting and clustering in infinite dimensions

We introduce the functional mean-shift algorithm, an iterative algorithm...
research
04/01/2021

MeanShift++: Extremely Fast Mode-Seeking With Applications to Segmentation and Object Tracking

MeanShift is a popular mode-seeking clustering algorithm used in a wide ...

Please sign up or login with your details

Forgot password? Click here to reset