Shape decomposition and classification by searching optimal part pruning sequence. (June 2016)

• Record Type: Journal Article
• Authors: Wang, Chun; Lai, Zhongyuan
• Is Part Of: Pattern recognition. Volume 54(2016:Jun.)
• Page Start: 206
• Page End: 217
• Publication Date: 2016-06
• Subjects: Shape decomposition -- Optimal pruning sequence -- Dynamic programming -- Shape classification; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2016.01.005
• Languages: English
• ISSNs: 0031-3203

Abstract

Abstract: 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. Abstract : Highlights: Integrating 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.