2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2 An Invariant, Closed-Form Solution for Matching Sets of 3D Lines Washington, D.C., USA June 27-July 02 ISBN: 0-7695-2158-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.33
Existing algorithms for finding the best match between two sets of 3D lines are not completely satisfactory in the sense that they either yield approximate solutions, or are iterative which means they may not converge to the globally optimal solution. A neven more serious shortcoming of the existing algorithms is that they are all non-invariant with respect to the translation of the coordinate system. Thus, any best match found becomes rather meaningless. In this paper, we discuss the source of this non-invariance and present a new algorithm that is invariant to coordinate transforms. Moreover, the algorithm is close d-form which implies that it always yields the best global match.
Citation:
Behzad Kamgar-Parsi, Behrooz Kamgar-Parsi, "An Invariant, Closed-Form Solution for Matching Sets of 3D Lines," cvpr, vol. 2, pp.431-436, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb