A Method for Registration of 3-D Shapes Export

@article{besl-mckay-pami92, abstract = {The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces.}, address = {Los Alamitos, CA, USA}, author = {Besl, P. J. and Mckay, N. D.}, citeulike-article-id = {575400}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=132022}, citeulike-linkout-1 = {http://doi.ieeecomputersociety.org/10.1109/34.121791}, citeulike-linkout-2 = {http://dx.doi.org/10.1109/34.121791}, citeulike-linkout-3 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=121791}, doi = {10.1109/34.121791}, issn = {0162-8828}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, keywords = {alignment, matching, registration}, month = {February}, number = {2}, pages = {239--256}, posted-at = {2008-11-26 00:54:20}, priority = {3}, publisher = {IEEE Computer Society}, title = {A Method for Registration of 3-D Shapes}, url = {http://dx.doi.org/10.1109/34.121791}, volume = {14}, year = {1992} }

TY - JOUR ID - besl-mckay-pami92 L3 - citeulike-article-id:575400 N2 - The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces. IS - 2 JF - IEEE Transactions on Pattern Analysis and Machine Intelligence SN - 0162-8828 AD - Los Alamitos, CA, USA EP - 256 TI - A Method for Registration of 3-D Shapes PB - IEEE Computer Society VL - 14 SP - 239 KW - alignment KW - matching KW - registration AU - Besl, PJ AU - Mckay, ND PY - 1992/02// UR - http://dx.doi.org/10.1109/34.121791 ER -