.png){kind=icon}
返回
An efficient unsupervised diffusion clustering algorithm with application to shape decomposition based on visibility context
.png){kind=icon}
PRE
AI
DOI：10.1016/j.image.2016.12.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper the two and three dimensional of a single shape partitioning problem is revisited by means of an iterative, non supervised, very fast and effective algorithm. The notion of visibility context is used as the shape signature, which actually provides a physical meaning to the representation. The visibility serves as a means to manipulate on the shape parts applying clustering techniques to the corresponding graph. Therefore, the decomposition problem is re-casted as a clustering problem. An unsupervised Diffusion Clustering Algorithm is proposed, which efficiently achieves to capture the functional shape parts. Although the proposed algorithm is developed and fits very well to the specific problem of the shape partitioning, its utility is undoubtedly much more general. Experimental results conducted on two and three dimensional shape databases are very promising.
Keyword:
Graph clustering
Shape decomposition
Visibility
Diffusion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
S
IF:
2.7
论文数:
2.8K
被引数:
4.2K
机构
引用论文
.png){kind=icon}
Mechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
分享收藏
查看更多内容