To refer to this page use:
|Abstract:||As large repositories of 3D shape collections continue to grow, understanding the data, especially encoding the inter-model similarity and their variations, is of central importance. For example, many data-driven approaches now rely on access to semantic segmentation information, accurate inter-model point-to-point correspondence, and deformation models that characterize the model collections. Existing approaches, however, are either supervised requiring manual labeling; or employ super-linear matching algorithms and thus are unsuited for analyzing large collections spanning many thousands of models. We propose an automatic algorithm that starts with an initial template model and then jointly optimizes for part segmentation, point-to-point surface correspondence, and a compact deformation model to best explain the input model collection. As output, the algorithm produces a set of probabilistic part-based templates that groups the original models into clusters of models capturing their styles and variations. We evaluate our algorithm on several standard datasets and demonstrate its scalability by analyzing much larger collections of up to thousands of shapes.|
|Citation:||Kim, Vladimir G., Wilmot Li, Niloy J. Mitra, Siddhartha Chaudhuri, Stephen DiVerdi, and Thomas Funkhouser. "Learning part-based templates from large collections of 3D shapes." ACM Transactions on Graphics (TOG) 32, no. 4 (2013): pp. 70:1-70:12. doi:10.1145/2461912.2461933|
|Pages:||70:1 - 70:12|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||ACM Transactions on Graphics|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.