Shape decomposition and classification by searching optimal part pruning sequence.

Pattern Recognition(2016)

引用 11|浏览4
暂无评分
摘要
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. HighlightsIntegrating decomposition with classification will benefit both of them.Part-based descriptor is robust to shape deformation and intra-class variation.Class and geometric information are complementary in guiding decomposition.Learning from human decomposition result improves the decomposition performance.The decomposition by optimal pruning sequence is solved in polynomial complexity.
更多
查看译文
关键词
Shape decomposition,Optimal pruning sequence,Dynamic programming,Shape classification
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要