Robust scaling iterative closest point algorithm with bidirectional distance measurement

Electronics Letters

Volumn 46, Issue 24, 2010, Pages 1604-1605

  Zhu, J H ^a   Zheng, N N ^a   Yuan, Z J ^a   Du, S Y ^a   Ma, L ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE ALGORITHM; ITERATIVE CLOSEST POINT ALGORITHM; LEAST SQUARE PROBLEMS; POINT SET; ROBUST ALGORITHM;

GEOMETRY;

ALGORITHMS;

EID: 80053229987     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el.2010.2844     Document Type: Article

References (5)

1. Besl, P.J., and McKay, N.D.: ' A method for registration of 3D shapes ', IEEE Trans. Pattern Anal. Mach. Intell., 1992, 14, (2), p. 239-256 0162-8828
2. Du, S., Zheng, N., Xiong, L., Ying, S., and Xue, J.: ' Scaling iterative closest point algorithm for registration of m-D point sets ', J. Vis. Commun. Image Represent., 2010, 21, (5-6), p. 442-452 1047-3203
3. Nuchter, A., Lingemann, K., and Hertzberg, J.: ' Cached k-d tree search for ICP algorithms ', Proc. 6th Int. Conf. 3-D Digital Imaging and Modeling, (3DIM), Montréal, Québec, Canada, 2007, p. 419-426
4. Latecki, L., Lakamper, R., and Eckhardt, U.: ' Shape descriptors for non-rigid shapes with a single closed contour ', Proc. IEEE Conf. on Computer Vision and Pattern Recognition, (CVPR), Hilton Head, SC, USA, 2000, p. 424-429
5. http://graphics.stanford.edu/data/3Dscanrep/