Iterative closest geometric objects registration
Li, QD; Li, Qingde; Griffiths, J. G.
Dr Qingde Li Q.Li@hull.ac.uk
J. G. Griffiths
In this paper, closed-form solutions are obtained for registering two sets of line segments, triangle patches, or even general simple geometric objects that are defined by a set of ordered points. Based on these new registration approaches, the iterative closest line segment registration (ICL) algorithm and the iterative closest triangle patch registration (ICT) algorithm are developed similar to the ICP algorithm. To simplify the mathematical representation, the concept of matrix scalar product is defined and some of its properties are given. The newly developed registration methods are tested. The test shows that the ICL algorithm and the ICT algorithm work much better than the conventional ICP algorithm considering that the ICL and the ICT algorithms are much less sensitive to the initial orientations of the object.
|Journal Article Type||Article|
|Journal||COMPUTERS & MATHEMATICS WITH APPLICATIONS|
|Peer Reviewed||Peer Reviewed|
|APA6 Citation||Li, Q., & Griffiths, J. G. (2000). Iterative closest geometric objects registration. Computers & mathematics with applications, 40(10-11), (1171-1188). doi:10.1016/s0898-1221(00)00230-3. ISSN 0898-1221|
|Keywords||Rotation estimation; Matrix scalar product; Iterative line segment registration|
You might also like
Local keypoint-based Faster R-CNN
Developing a Semantic-Driven Hybrid Segmentation Method for Point Clouds of 3D Shapes