Global correspondence optimization for non-rigid registration of depth scans

被引:264
作者
Li, Hao [1 ]
Sumner, Robert W. [1 ]
Pauly, Mark [1 ]
机构
[1] Swiss Fed Inst Technol, Appl Geometry Grp, Zurich, Switzerland
关键词
D O I
10.1111/j.1467-8659.2008.01282.x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization. Our algorithm simultaneously solves for correspondences between points on source and target scans, confidence weights that measure the reliability of each correspondence and identify non-overlapping areas, and a warping field that brings the source scan into alignment with the target geometry. The optimization maximizes the region of overlap and the spatial coherence of the deformation while minimizing registration error All optimization parameters are chosen automatically; hand-tuning is not necessary. Our method is not restricted to part-in-whole matching, but addresses the general problem of partial matching, and requires no explicit prior correspondences or feature points. We evaluate the performance and robustness of our method using scan data acquired by a structured light scanner and compare our method with existing non-rigid registration algorithms.
引用
收藏
页码:1421 / 1430
页数:10
相关论文
共 27 条
[1]  
ALLEN B, 2003, ACM T GRAPH, V22
[2]  
AMBERG B, 2007, P IEEE CVPR JUN
[3]  
ANGUELOV D, 2004, ADV NEURAL INF P SYS, V17
[4]  
ANGUELOV D, 2005, ACM T GRAPH, V24
[5]  
[Anonymous], 2005, Symposium on Geometry Processing
[6]   A morphable model for the synthesis of 3D faces [J].
Blanz, V ;
Vetter, T .
SIGGRAPH 99 CONFERENCE PROCEEDINGS, 1999, :187-194
[7]  
BRONSTEIN AM, 2006, P NATL ACAD SCI PNAS, V103
[8]  
BROWN B, 2004, S 3D DAT PROC VIS TR
[9]  
Brown BJ, 2007, ACM T GRAPHIC, V26, DOI [10.1145/1276377.1276404, 10.1145/1239451.1239472]
[10]   OBJECT MODELING BY REGISTRATION OF MULTIPLE RANGE IMAGES [J].
CHEN, Y ;
MEDIONI, G .
IMAGE AND VISION COMPUTING, 1992, 10 (03) :145-155