Scan segments matching for pairwise 3D alignment

This paper presents a method for pairwise 3D alignment which solves data association by matching scan segments across scans. Generating accurate segment associations allows to run a modified version of the Iterative Closest Point (ICP) algorithm where the search for point-to-point correspondences is...

Full description

Saved in:
Bibliographic Details
Main Authors: Douillard, B., Quadros, A., Morton, P., Underwood, J. P., De Deuge, M., Hugosson, S., Hallstrom, M., Bailey, T.
Format: Conference Proceeding
Language:English
Subjects:
Iterative closest point algorithm
Measurement
Pipelines
Sensors
Shape
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a method for pairwise 3D alignment which solves data association by matching scan segments across scans. Generating accurate segment associations allows to run a modified version of the Iterative Closest Point (ICP) algorithm where the search for point-to-point correspondences is constrained to associated segments. The novelty of the proposed approach is in the segment matching process which takes into account the proximity of segments, their shape, and the consistency of their relative locations in each scan. Scan segmentation is here assumed to be given (recent studies provide various alternatives [10], [19]). The method is tested on seven sequences of Velodyne scans acquired in urban environments. Unlike various other standard versions of ICP, which fail to recover correct alignment when the displacement between scans increases, the proposed method is shown to be robust to displacements of several meters. In addition, it is shown to lead to savings in computational times which are potentially critical in real-time applications.
ISSN:1050-4729
2577-087X
DOI:10.1109/ICRA.2012.6224788