Recurring part arrangements in shape collections: Recurring part arrangement in shape collections

Citation data:

Computer Graphics Forum, ISSN: 0167-7055, Vol: 33, Issue: 2, Page: 115-124

Publication Year:
2014
Usage 75
Abstract Views 62
Full Text Views 12
Link-outs 1
Captures 51
Readers 51
Citations 31
Citation Indexes 31
Repository URL:
http://hdl.handle.net/10754/575714
DOI:
10.1111/cgf.12309
Author(s):
Zheng, Youyi; Cohen-Or, Daniel; Averkiou, Melinos; Mitra, Niloy J.
Publisher(s):
Wiley-Blackwell; Wiley
Tags:
Computer Science
article description
Extracting semantically related parts across models remains challenging, especially without supervision. The common approach is to co-analyze a model collection, while assuming the existence of descriptive geometric features that can directly identify related parts. In the presence of large shape variations, common geometric features, however, are no longer sufficiently descriptive. In this paper, we explore an indirect top-down approach, where instead of part geometry, part arrangements extracted from each model are compared. The key observation is that while a direct comparison of part geometry can be ambiguous, part arrangements, being higher level structures, remain consistent, and hence can be used to discover latent commonalities among semantically related shapes. We show that our indirect analysis leads to the detection of recurring arrangements of parts, which are otherwise difficult to discover in a direct unsupervised setting. We evaluate our algorithm on ground truth datasets and report advantages over geometric similarity-based bottom-up co-segmentation algorithms. © 2014 The Author(s) Computer Graphics Forum © 2014 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.