Sciweavers

Share
CVPR
2010
IEEE

Dense Non-rigid Surface Registration Using High-Order Graph Matching

10 years 9 months ago
Dense Non-rigid Surface Registration Using High-Order Graph Matching
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g., curvature and texture) while the high-order terms model the intrinsic embedding energy. The novelty of this paper includes: 1) casting 3D surface registration into a graph matching problem that combines both geometric and appearance similarities and intrinsic embedding information, 2) the first implementation of high-order graph matching algorithm that solves a non-convex optimization problem, and 3) an efficient two-stage optimization approach to constrain the search space for dense surface registration. Our method is validated through a series of experiments demonstrating its accuracy and efficiency, notably in challenging cases of large and/or non-isometric deformations, or meshes that are partially occluded.
Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Di
Added 13 Apr 2010
Updated 14 May 2010
Type Conference
Year 2010
Where CVPR
Authors Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Dimitris Samaras, Nikos Paragios
Comments (0)
books