|
|
|
|
RI | Publications | Registration of Multiple Range Scans as a Location Recognition Problem: Hypothesis Generation, Refinement and Verification
|
|
Text only version of this site
Registration of Multiple Range Scans as a Location Recognition Problem: Hypothesis Generation, Refinement and Verification
B.J. King, T. Malisiewicz, C.V. Stewart, and R.J. Radke
Proceedings of 3DIM 2005, June, 2005, pp. 180-187.
Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference
| Download [Help] |
Adobe portable document format (pdf) [4783 KB]
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
| Abstract |
This paper addresses the following version of the multiple range scan registration problem. A scanner with an associated intensity camera is placed at a series of locations throughout a large environment; scans are acquired at each location. The problem is to decide automatically which scans overlap and to estimate the parameters of the transformations aligning these scans. Our technique is based on (1) detecting and matching keypoints — distinctive locations in range and intensity images, (2) generating and refining a transformation estimate from each keypoint match, and (3) deciding if a given refined estimate is correct. While these steps are familiar, we present novel approaches to each. A new range keypoint technique is presented that uses spin images to describe holes in smooth surfaces. Intensity keypoints are detected using multiscale filters, described using intensity gradient histograms, and backprojected to form 3D keypoints. A hypothesized transformation is generated by matching a single keypoint from one scan to a single keypoint from another, and is refined using a robust form of the ICP algorithm in combination with controlled region growing. Deciding whether a refined transformation is correct is based on three criteria: alignment accuracy, visibility, and a novel randomness measure. Together these three steps produce good results in test scans of the Rensselaer campus.
| Notes |
Number of pages: 8
| Text Reference |
B.J. King, T. Malisiewicz, C.V. Stewart, and R.J. Radke, "Registration of Multiple Range Scans as a Location Recognition Problem: Hypothesis Generation, Refinement and Verification," Proceedings of 3DIM 2005, June, 2005, pp. 180-187.
| BibTeX Reference |
@inproceedings{King_2005_5829,
author = "Bradford J. King and Tomasz Malisiewicz and Charles V. Stewart and Richard J. Radke",
title = "Registration of Multiple Range Scans as a Location Recognition Problem: Hypothesis Generation, Refinement and Verification",
booktitle = "Proceedings of 3DIM 2005",
month = "June",
year = "2005",
pages = "180-187"
}