Robust surface registration using <it>N</it>-points approximate congruent sets

<p>Abstract</p> <p>Scans acquired by 3D sensors are typically represented in a local coordinate system. When multiple scans, taken from different locations, represent the same scene these must be registered to a common reference frame. We propose a fast and robust registration appr...

Full description

Bibliographic Details
Main Authors: Yao Jian, Ruggeri Mauro, Taddei Pierluigi, Sequeira V&#237;tor
Format: Article
Language:English
Published: SpringerOpen 2011-01-01
Series:EURASIP Journal on Advances in Signal Processing
Online Access:http://asp.eurasipjournals.com/content/2011/1/72
id doaj-f72ea44cf1ee425aa96cd564d1b129fa
record_format Article
spelling doaj-f72ea44cf1ee425aa96cd564d1b129fa2020-11-24T21:53:58ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61721687-61802011-01-012011172Robust surface registration using <it>N</it>-points approximate congruent setsYao JianRuggeri MauroTaddei PierluigiSequeira V&#237;tor<p>Abstract</p> <p>Scans acquired by 3D sensors are typically represented in a local coordinate system. When multiple scans, taken from different locations, represent the same scene these must be registered to a common reference frame. We propose a fast and robust registration approach to automatically align two scans by finding two sets of <it>N</it>-points, that are approximately congruent under rigid transformation and leading to a good estimate of the transformation between their corresponding point clouds. Given two scans, our algorithm randomly searches for the best sets of congruent groups of points using a RANSAC-based approach. To successfully and reliably align two scans when there is only a small overlap, we improve the basic RANSAC random selection step by employing a weight function that approximates the probability of each pair of points in one scan to match one pair in the other. The search time to find pairs of congruent sets of <it>N</it>-points is greatly reduced by employing a fast search codebook based on both binary and multi-dimensional lookup tables. Moreover, we introduce a novel indicator of the overlapping region quality which is used to verify the estimated rigid transformation and to improve the alignment robustness. Our framework is general enough to incorporate and efficiently combine different point descriptors derived from geometric and texture-based feature points or scene geometrical characteristics. We also present a method to improve the matching effectiveness of texture feature descriptors by extracting them from an atlas of rectified images recovered from the scan reflectance image. Our algorithm is robust with respect to different sampling densities and also resilient to noise and outliers. We demonstrate its robustness and efficiency on several challenging scan datasets with varying degree of noise, outliers, extent of overlap, acquired from indoor and outdoor scenarios.</p> http://asp.eurasipjournals.com/content/2011/1/72
collection DOAJ
language English
format Article
sources DOAJ
author Yao Jian
Ruggeri Mauro
Taddei Pierluigi
Sequeira V&#237;tor
spellingShingle Yao Jian
Ruggeri Mauro
Taddei Pierluigi
Sequeira V&#237;tor
Robust surface registration using <it>N</it>-points approximate congruent sets
EURASIP Journal on Advances in Signal Processing
author_facet Yao Jian
Ruggeri Mauro
Taddei Pierluigi
Sequeira V&#237;tor
author_sort Yao Jian
title Robust surface registration using <it>N</it>-points approximate congruent sets
title_short Robust surface registration using <it>N</it>-points approximate congruent sets
title_full Robust surface registration using <it>N</it>-points approximate congruent sets
title_fullStr Robust surface registration using <it>N</it>-points approximate congruent sets
title_full_unstemmed Robust surface registration using <it>N</it>-points approximate congruent sets
title_sort robust surface registration using <it>n</it>-points approximate congruent sets
publisher SpringerOpen
series EURASIP Journal on Advances in Signal Processing
issn 1687-6172
1687-6180
publishDate 2011-01-01
description <p>Abstract</p> <p>Scans acquired by 3D sensors are typically represented in a local coordinate system. When multiple scans, taken from different locations, represent the same scene these must be registered to a common reference frame. We propose a fast and robust registration approach to automatically align two scans by finding two sets of <it>N</it>-points, that are approximately congruent under rigid transformation and leading to a good estimate of the transformation between their corresponding point clouds. Given two scans, our algorithm randomly searches for the best sets of congruent groups of points using a RANSAC-based approach. To successfully and reliably align two scans when there is only a small overlap, we improve the basic RANSAC random selection step by employing a weight function that approximates the probability of each pair of points in one scan to match one pair in the other. The search time to find pairs of congruent sets of <it>N</it>-points is greatly reduced by employing a fast search codebook based on both binary and multi-dimensional lookup tables. Moreover, we introduce a novel indicator of the overlapping region quality which is used to verify the estimated rigid transformation and to improve the alignment robustness. Our framework is general enough to incorporate and efficiently combine different point descriptors derived from geometric and texture-based feature points or scene geometrical characteristics. We also present a method to improve the matching effectiveness of texture feature descriptors by extracting them from an atlas of rectified images recovered from the scan reflectance image. Our algorithm is robust with respect to different sampling densities and also resilient to noise and outliers. We demonstrate its robustness and efficiency on several challenging scan datasets with varying degree of noise, outliers, extent of overlap, acquired from indoor and outdoor scenarios.</p>
url http://asp.eurasipjournals.com/content/2011/1/72
work_keys_str_mv AT yaojian robustsurfaceregistrationusingitnitpointsapproximatecongruentsets
AT ruggerimauro robustsurfaceregistrationusingitnitpointsapproximatecongruentsets
AT taddeipierluigi robustsurfaceregistrationusingitnitpointsapproximatecongruentsets
AT sequeirav237tor robustsurfaceregistrationusingitnitpointsapproximatecongruentsets
_version_ 1725869750033055744