.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, Cauchy and generalized Epanechnikov kernels with their shadows. The robust properties of the mean shift based on these three kernels are then investigated. According to the Mountain function concepts, we propose a graphical method of correlation comparisons as an estimation of defined stabilization parameters. The proposed method can solve these bandwidth selection problems from a different point of view. Some numerical examples and comparisons demonstrate the superiority of the proposed method including those of computational complexity, cluster validity and improvements of mean shift in large continuous, discrete data sets. We finally apply the mean shift-based clustering algorithm to image segmentation. (c) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
kernel functions
mean shift
robust clustering
generalized Epanechnikov kernel
bandwidth selection
parameter estimation
mountain method
noise
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
分享收藏
查看更多内容