返回
Mean shift: An information theoretic perspective
DOI:10.1016/j.patrec.2008.09.011.png)
摘要
En 中文
This paper develops a new understanding of mean shift algorithms from an information theoretic perspective. We show that the Gaussian blurring mean shift (GBMS) directly minimizes the Renyi's quadratic entropy of the dataset and hence is unstable by definition. Further, its stable counterpart, the Gaussian mean shift (GMS), minimizes the Renyi's cross entropy where the local stationary solutions are modes of the dataset. By doing so, we aptly answer the question What does mean shift algorithms optimize?, thus highlighting naturally the properties of these algorithms. A consequence of this new understanding is the superior performance of GMS over GBMS which we show in a wide variety of applications ranging from mode finding to clustering and image segmentation. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Mean shift
Information theoretic learning
Renyi's entropy
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
Hyposensitization with Dermatophagoides pteronyssinus Antigen: Trial in Asthma Induced by House Dust
BMJ
IF0
Tinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients耳鸣再训练疗法 (TRT) 作为治疗耳鸣和高亢患者的方法
Review by urological pathologists improves the accuracy of Gleason grading by general pathologists
BMC Urology
IF0
没有更多内容


