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. An even 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 closed-form, which implies that it always yields the best global match.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An invariant, closed-form solution for matching sets of 3D lines


    Contributors:


    Publication date :

    2004-01-01


    Size :

    656076 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Invariant, Closed-Form Solution for Matching Sets of 3D Lines

    Kamgar-Parsi, B. / IEEE Computer Society | British Library Conference Proceedings | 2004


    Rotation invariant feature lines transform for image matching

    Ye, Z. / Hongsong, Q. | British Library Online Contents | 2014


    An Open Problem in Matching Sets of 3D Lines

    Kamgar-Parsi, B. / IEEE | British Library Conference Proceedings | 2001


    An open problem in matching sets of 3D lines

    Kamgar-Parsi, B. | IEEE | 2001


    A closed-form solution for noise contours

    Stewart, Elwood C. / Carson, Thomas M. | TIBKAT | 1979