Least-Squares Fitting of Two 3-D Point Sets
IEEE Transactions on Pattern Analysis and Machine Intelligence
Estimating 3-D location parameters using dual number quaternions
CVGIP: Image Understanding
A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Object modelling by registration of multiple range images
Image and Vision Computing - Special issue: range image understanding
Towards a General Multi-View Registration Technique
IEEE Transactions on Pattern Analysis and Machine Intelligence
A comparison of four algorithms for estimating 3-D rigid transformations
BMVC '95 Proceedings of the 1995 British conference on Machine vision (Vol. 1)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Globally Consistent Range Scan Alignment for Environment Mapping
Autonomous Robots
A Solution for the Registration of Multiple 3D Point Sets Using Unit Quaternions
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume II - Volume II
Bundle Adjustment - A Modern Synthesis
ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
Exploring artificial intelligence in the new millennium
Fast global registration of 3D sampled surfaces using a multi-z-buffer technique
NRC '97 Proceedings of the International Conference on Recent Advances in 3-D Digital Imaging and Modeling
Computer Vision and Image Understanding
Registration of point cloud data from a geometric optimization perspective
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Algorithm 849: A concise sparse Cholesky factorization package
ACM Transactions on Mathematical Software (TOMS)
Registration of Multiple Point Sets
ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
MonoSLAM: Real-Time Single Camera SLAM
IEEE Transactions on Pattern Analysis and Machine Intelligence
Global registration of multiple 3D point sets via optimization-on-a-manifold
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Cached k-d tree search for ICP algorithms
3DIM '07 Proceedings of the Sixth International Conference on 3-D Digital Imaging and Modeling
Globally consistent 3D mapping with scan matching
Robotics and Autonomous Systems
Benchmarking urban six-degree-of-freedom simultaneous localization and mapping
Journal of Field Robotics
Robust and efficient robotic mapping
Robust and efficient robotic mapping
Multiview registration for large data sets
3DIM'99 Proceedings of the 2nd international conference on 3-D digital imaging and modeling
Divide and Conquer: EKF SLAM in
IEEE Transactions on Robotics
Hi-index | 0.00 |
The iterative closest point (ICP) algorithm is the de facto standard for geometric alignment of three-dimensional models when an initial relative pose estimate is available. The basis of the algorithm is the minimization of an error function that takes point correspondences into account. Four closed-form solution methods are known for minimizing this function. This paper presents novel linear solutions to the scan registration problem, i.e., to the problem of putting and aligning 3D scans in a common coordinate system. We extend the methods for registering n-scans in a global and simultaneous fashion, such that the registration of the nth scan influences all previous registrations in one step.