Premium
Global Correspondence Optimization for Non‐Rigid Registration of Depth Scans
Author(s) -
Li Hao,
Sumner Robert W.,
Pauly Mark
Publication year - 2008
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2008.01282.x
Subject(s) - computer science , image warping , image registration , robustness (evolution) , artificial intelligence , computer vision , rigid transformation , matching (statistics) , correspondence problem , range (aeronautics) , optimization problem , free form deformation , algorithm , mathematics , image (mathematics) , deformation (meteorology) , biochemistry , chemistry , statistics , materials science , physics , composite material , meteorology , gene
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.