A Bidirectional Adaptive Bandwidth Mean Shift Strategy for Clustering

12/22/2017
by   Fanyang Meng, et al.
0

The bandwidth of a kernel function is a crucial parameter in the mean shift algorithm. This paper proposes a novel adaptive bandwidth strategy which contains three main contributions. (1) The differences among different adaptive bandwidth are analyzed. (2) A new mean shift vector based on bidirectional adaptive bandwidth is defined, which combines the advantages of different adaptive bandwidth strategies. (3) A bidirectional adaptive bandwidth mean shift (BAMS) strategy is proposed to improve the ability to escape from the local maximum density. Compared with contemporary adaptive bandwidth mean shift strategies, experiments demonstrate the effectiveness of the proposed strategy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2014

Anisotropic Agglomerative Adaptive Mean-Shift

Mean Shift today, is widely used for mode detection and clustering. The ...
research
07/11/2012

A Novel Approach Coloured Object Tracker with Adaptive Model and Bandwidth using Mean Shift Algorithm

The traditional color-based mean-shift tracking algorithm is popular amo...
research
09/12/2007

Bandwidth selection for kernel estimation in mixed multi-dimensional spaces

Kernel estimation techniques, such as mean shift, suffer from one major ...
research
06/07/2022

An extension to the applicability of adaptive bandwidth choice

In this paper, we extend the applicability of the bandwidth choice metho...
research
05/26/2022

Kernel Ridgeless Regression is Inconsistent for Low Dimensions

We show that kernel interpolation for a large class of shift-invariant k...
research
06/10/2013

Adaptive Noisy Clustering

The problem of adaptive noisy clustering is investigated. Given a set of...
research
01/07/2020

Generalized mean shift with triangular kernel profile

The mean shift algorithm is a popular way to find modes of some probabil...

Please sign up or login with your details

Forgot password? Click here to reset