A coarse‐to‐fine shape decomposition based on critical points. (21st March 2017)

• Record Type: Journal Article
• Authors: Qu, Wenyu; Ma, Minmin; Li, Zhiyang; Stojmenovic, Milos; Liu, Zhaobin
• Other Names: Lengauer Christian guestEditor.; Bolten Matthias guestEditor.; Falgout Robert guestEditor.; Schenk Olaf guestEditor.; Zhou Xiaobo guestEditor.; Zhao Laiping guestEditor.
• Is Part Of: Concurrency and computation. Volume 29:Number 17(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-03-21
• Subjects: coarse‐to‐fine manner -- part‐cut hypotheses -- shape segmentation; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4088
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The segmentation of a shape into a series of meaningful parts is a fundamental problem in shape analysis and part‐based object representation. However, it is difficult to make the result of shape segmentation accord with the expectations of humans performing the same task. There is still a need for an effective way to segment the shape although a variety of methods have been proposed. In this paper, we present a novel shape decomposition algorithm, which is implemented in a coarse‐to‐fine manner, taking into account the critical points on the silhouette. First, a part‐cut hypotheses candidate set is generated and classified into 2 categories. Then, the hypotheses with adjacent endpoints are determined first, and later, the other kinds of hypotheses are finely determined by our presented measures such as chord arc ratio and inner angle. We note that the proposed coarse‐to‐fine decomposition conforms to the mechanism of human vision. The extensive experimental results on a large set of shapes show that our algorithm can generate shape decomposition results that better accord with human intuition compared to competing algorithms.