On the Consistency of Quick Shift

10/29/2017
by   Heinrich Jiang, et al.
0

Quick Shift is a popular mode-seeking and clustering algorithm. We present finite sample statistical consistency guarantees for Quick Shift on mode and cluster recovery under mild distributional assumptions. We then apply our results to construct a consistent modal regression algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2018

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

We provide initial seedings to the Quick Shift clustering algorithm, whi...
research
05/05/2013

On the Convergence and Consistency of the Blurring Mean-Shift Process

The mean-shift algorithm is a popular algorithm in computer vision and i...
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 ...
research
07/08/2018

The modal age of Statistics

Recently, a number of statistical problems have found an unexpected solu...
research
05/10/2018

Analysis of a Mode Clustering Diagram

Mode-based clustering methods define clusters to be the basins of attrac...
research
02/23/2018

Learning Weighted Representations for Generalization Across Designs

Predictive models that generalize well under distributional shift are of...
research
12/20/2017

Fast kNN mode seeking clustering applied to active learning

A significantly faster algorithm is presented for the original kNN mode ...

Please sign up or login with your details

Forgot password? Click here to reset