2010 · 38 citations · 22 references
ComputingComputer ScienceRobotics EngineeringComputer VisionRobot VisionRoboticsImage RegistrationMotion EstimationPoint Cloud ProcessingPose EstimationScene ReconstructionScene UnderstandingComputational EfficiencyIterative Closest PointMulti-scale RepresentationMulti-scale SegmentationRansacRobot Pose EstimationSensor Noise AnalysisSystematic Sampling
The iterative closest points (ICP) algorithm is widely used for ego-motion estimation in robotics, but subject to bias in the presence of outliers. We propose a random sample consensus (RANSAC) based algorithm to simultaneously achieving robust and realtime ego-motion estimation, and multi-scale segmentation in environments with rapid changes. Instead of directly sampling on measurements, RANSAC matching investigates initial estimates at the object level of abstraction for systematic sampling and computational efficiency. A soft segmentation method using a multi-scale representation is exploited to eliminate segmentation errors. By explicitly taking into account the various noise sources degrading the effectiveness of geometric alignment: sensor noise, dynamic objects and data association uncertainty, the uncertainty of a relative pose estimate is calculated under a theoretical investigation of scoring in the RANSAC paradigm. The improved segmentation can also be used as the basis for higher level scene understanding. The effectiveness of our approach is demonstrated qualitatively and quantitatively through extensive experiments using real data.
22
Martin A. Fischler, Robert C. Bolles · Communications of the ACM · 1981 · 25.5K citations · Full text
Efficient variants of the ICP algorithm
Szymon Rusinkiewicz, Marc Levoy · 2002 · 3.7K citations
Globally Consistent Range Scan Alignment for Environment Mapping
Feng Lu, Evangelos Milios · Autonomous Robots · 1997 · 1.3K citations
Computing, Geoinformatics, Geodesy +11