Shape decomposition and classification by searching optimal part pruning sequence
作者：
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.
摘要
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.
论文关键词：Shape decomposition,Optimal pruning sequence,Dynamic programming,Shape classification
论文评审过程：Received 10 September 2015, Revised 11 December 2015, Accepted 6 January 2016, Available online 18 January 2016, Version of Record 27 February 2016.
论文官网地址：https://doi.org/10.1016/j.patcog.2016.01.005
