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

June 2010

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

Authors:

Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Dimitris Samaras, and Nikos Paragios
Conference Paper
Proceedings of (CVPR) Computer Vision and Pattern Recognition

Abstract:

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.
@conference{Zeng-2010-10471,
author = {Yun Zeng And Chaohui Wang And Yang Wang And Xianfeng Gu And Dimitris Samaras And Nikos Paragios},
title = {Dense Non-rigid Surface Registration Using High-Order Graph Matching},
booktitle = {Proceedings of (CVPR) Computer Vision and Pattern Recognition},
year = {2010},
month = {June},
pages = {382 - 389},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.