Recurring Part Arrangements in Shape Collections

Loading...
Thumbnail Image
Date
2014
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and John Wiley and Sons Ltd.
Abstract
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.
Description

        
@article{
10.1111:cgf.12309
, journal = {Computer Graphics Forum}, title = {{
Recurring Part Arrangements in Shape Collections
}}, author = {
Zheng, Youyi
 and
Cohen-Or, Daniel
 and
Averkiou, Melinos
 and
Mitra, Niloy J.
}, year = {
2014
}, publisher = {
The Eurographics Association and John Wiley and Sons Ltd.
}, ISSN = {
1467-8659
}, DOI = {
10.1111/cgf.12309
} }
Citation