TY - GEN
T1 - Point-plane SLAM for hand-held 3D sensors
AU - Taguchi, Yuichi
AU - Jian, Yong Dian
AU - Ramalingam, Srikumar
AU - Feng, Chen
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2013
Y1 - 2013
N2 - We present a simultaneous localization and mapping (SLAM) algorithm for a hand-held 3D sensor that uses both points and planes as primitives. We show that it is possible to register 3D data in two different coordinate systems using any combination of three point/plane primitives (3 planes, 2 planes and 1 point, 1 plane and 2 points, and 3 points). Our algorithm uses the minimal set of primitives in a RANSAC framework to robustly compute correspondences and estimate the sensor pose. As the number of planes is significantly smaller than the number of points in typical 3D data, our RANSAC algorithm prefers primitive combinations involving more planes than points. In contrast to existing approaches that mainly use points for registration, our algorithm has the following advantages: (1) it enables faster correspondence search and registration due to the smaller number of plane primitives; (2) it produces plane-based 3D models that are more compact than point-based ones; and (3) being a global registration algorithm, our approach does not suffer from local minima or any initialization problems. Our experiments demonstrate real-time, interactive 3D reconstruction of indoor spaces using a hand-held Kinect sensor.
AB - We present a simultaneous localization and mapping (SLAM) algorithm for a hand-held 3D sensor that uses both points and planes as primitives. We show that it is possible to register 3D data in two different coordinate systems using any combination of three point/plane primitives (3 planes, 2 planes and 1 point, 1 plane and 2 points, and 3 points). Our algorithm uses the minimal set of primitives in a RANSAC framework to robustly compute correspondences and estimate the sensor pose. As the number of planes is significantly smaller than the number of points in typical 3D data, our RANSAC algorithm prefers primitive combinations involving more planes than points. In contrast to existing approaches that mainly use points for registration, our algorithm has the following advantages: (1) it enables faster correspondence search and registration due to the smaller number of plane primitives; (2) it produces plane-based 3D models that are more compact than point-based ones; and (3) being a global registration algorithm, our approach does not suffer from local minima or any initialization problems. Our experiments demonstrate real-time, interactive 3D reconstruction of indoor spaces using a hand-held Kinect sensor.
UR - http://www.scopus.com/inward/record.url?scp=84887306130&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84887306130&partnerID=8YFLogxK
U2 - 10.1109/ICRA.2013.6631318
DO - 10.1109/ICRA.2013.6631318
M3 - Conference contribution
AN - SCOPUS:84887306130
SN - 9781467356411
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 5182
EP - 5189
BT - 2013 IEEE International Conference on Robotics and Automation, ICRA 2013
T2 - 2013 IEEE International Conference on Robotics and Automation, ICRA 2013
Y2 - 6 May 2013 through 10 May 2013
ER -