Co-Segmentation of 3D Shapes via Subspace Clustering

  • Authors:

  • Ruizhen Hu;Lubin Fan;Ligang Liu

  • Affiliations:

  • Department of Mathematics, Zhejiang University, China State Key Laboratory of CAD&CG, Zhejiang University, China;Department of Mathematics, Zhejiang University, China State Key Laboratory of CAD&CG, Zhejiang University, China;Department of Mathematics, Zhejiang University, China State Key Laboratory of CAD&CG, Zhejiang University, China

  • Venue:
  • Computer Graphics Forum
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a novel algorithm for automatically co-segmenting a set of shapes from a common family into consistent parts. Starting from over-segmentations of shapes, our approach generates the segmentations by grouping the primitive patches of the shapes directly and obtains their correspondences simultaneously. The core of the algorithm is to compute an affinity matrix where each entry encodes the similarity between two patches, which is measured based on the geometric features of patches. Instead of concatenating the different features into one feature descriptor, we formulate co-segmentation into a subspace clustering problem in multiple feature spaces. Specifically, to fuse multiple features, we propose a new formulation of optimization with a consistent penalty, which facilitates both the identification of most similar patches and selection of master features for two similar patches. Therefore the affinity matrices for various features are sparsity-consistent and the similarity between a pair of patches may be determined by part of (instead of all) features. Experimental results have shown how our algorithm jointly extracts consistent parts across the collection in a good manner. © 2012 Wiley Periodicals, Inc.