Global Correspondence Optimization for Non-Rigid Registration of Depth Scans

Simple item page
dc.contributor.authorLi, Haoen_US
dc.contributor.authorSumner, Robert W.en_US
dc.contributor.authorPauly, Marken_US
dc.date.accessioned2015-02-21T17:32:30Z
dc.date.available2015-02-21T17:32:30Z
dc.date.issued2008en_US
dc.description.abstractWe 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.en_US
dc.description.number5en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume27en_US
dc.identifier.doi10.1111/j.1467-8659.2008.01282.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages1421-1430en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2008.01282.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleGlobal Correspondence Optimization for Non-Rigid Registration of Depth Scansen_US
Files
Collections
27-Issue 5
SGP08: Eurographics Symposium on Geometry Processing