.png){kind=icon}
.png){kind=icon}
Return
Shape decomposition and classification by searching optimal part pruning sequence
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2016.01.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Representing shapes in terms of meaningful parts is a fundamental problem in shape analysis and part based object representation. Decomposition methods typically utilize handcrafted geometric rules in a nondata-driven manner. However, these rules are insufficient to mimic human decomposition behavior, which limits the applications of decomposition in vision tasks. In this paper, we propose a novel shape analysis framework that integrates shape decomposition with shape classification in fundamental level. We first train probabilistic models for contours and part cuts involved in decomposition process. Next, we construct a data structure called decomposition graph whose nodes represent intermediate contours and whose edges represent part cut selections. The decomposition and classification results are obtained by efficiently searching the optimal path on decomposition graph with minimum energy. Experimental results show that such integrated framework improves the decomposition performance under various shape deformations and achieves competitive classification performance. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Shape decomposition
Optimal pruning sequence
Dynamic programming
Shape classification
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W