.png){kind=icon}
返回
Kernel Cuts: Kernel and Spectral Clustering Meet Regularization
.png){kind=icon}
PRE
AI
DOI：10.1007/s11263-018-1115-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work bridges the gap between two popular methodologies for data partitioning: kernel clustering and regularization-based segmentation. While addressing closely related practical problems, these general methodologies may seem very different based on how they are covered in the literature. The differences may show up in motivation, formulation, and optimization, e.g.spectral relaxation versus max-flow. We explain how regularization and kernel clustering can work together and why this is useful. Our joint energy combines standard regularization, e.g.MRF potentials, and kernel clustering criteria like normalized cut. Complementarity of such terms is demonstrated in many applications using our bound optimization Kernel Cut algorithm for the joint energy (code is publicly available). While detailing combinatorial move-making, our main focus are new linear kernel and spectral bounds for kernel clustering criteria allowing their integration with any regularization objectives with existing discrete or continuous solvers.
Keyword:
Segmentation
Markov random fields
Spectral clustering
Kernel methods
Bound optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.3
论文数:
3.9K
被引数:
2.8W
机构
引用论文
The effect of spin dilution on magnetism of the linear chain system β-Cu2−x Zn x V2O7自旋稀释对线性链体系 β-cu2-x Zn x V2O7磁性的影响.png)
Pramana
PramanaIF0
PREAI
分享收藏分享收藏分享收藏The Coupling Relationship between Herb Communities and Soil in a Coal Mine Reclamation Area after Different Years of RestorationForests
OAAI
ForestsIF0
OAAI分享收藏
查看更多内容