arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.15146cs.LGcs.CV
收藏

模糊均值漂移的收敛性分析

Convergence Analysis of Blurring Mean Shift

Ryoya Yamasaki, Toshiyuki Tanaka

AI总结:

本文通过将模糊均值漂移算法解释为优化过程,突破现有多维收敛结果仅适用于单点收敛的限制,证明了在多点收敛形成多簇情况下的收敛保证,并利用收敛点的几何特征进一步表明该算法收敛速度快。

摘要:

模糊均值漂移(BMS)算法是均值漂移算法的一种变体,是一种基于核的迭代数据聚类方法,其中数据点通过迭代模糊化根据其收敛点进行聚类。本文通过利用其作为优化过程的解释来分析BMS算法的收敛性质,这一解释虽已为人所知,但在现有收敛研究中尚未得到充分利用。现有适用于多维数据的收敛性质结果仅涵盖所有模糊数据点序列收敛到单个点的情况,而本研究即使在这些序列可以收敛到多个点、从而产生多个簇的情况下也提供了收敛保证。本研究还通过进一步利用收敛点的几何特征,表明BMS算法的收敛速度很快。

英文摘要:

Blurring mean shift (BMS) algorithm, a variant of the mean shift algorithm, is a kernel-based iterative method for data clustering, where data points are clustered according to their convergent points via iterative blurring. In this paper, we analyze convergence properties of the BMS algorithm by leveraging its interpretation as an optimization procedure, which is known but has been underutilized in existing convergence studies. Whereas existing results on convergence properties applicable to multi-dimensional data only cover the case where all the blurred data point sequences converge to a single point, this study provides a convergence guarantee even when those sequences can converge to multiple points, yielding multiple clusters. This study also shows that the convergence of the BMS algorithm is fast by further leveraging geometrical characterization of the convergent points.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑