This paper presents an algorithm for matching line segments in two images which are related by an affine transformation. Images are represented as patterns Of line segments. Areas defined between line segments are used to describe a line pattern in the form of a proximity matrix. Matches are determined by comparing the feature vectors obtained from eigenvalue decomposition of the proximity matrices. Reliable matches of line segments are obtained in both synthetic and real images.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Matching patterns of line segments by eigenvector decomposition


    Contributors:
    Chan, H.B. (author) / Hung, Y.S. (author)


    Publication date :

    2002-01-01


    Size :

    482377 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Matching Patterns of Line Segments by Eigenvector Decomposition

    Chan, H. B. / Hung, Y. S. / IEEE Computer Society et al. | British Library Conference Proceedings | 2002


    A Line Feature Matching Technique Based on an Eigenvector Approach

    Park, S. H. / Lee, K. M. / Lee, S. U. | British Library Online Contents | 2000


    Wide-baseline stereo matching with line segments

    Bay, H. / Ferraris, V. / Van Gool, L. | IEEE | 2005


    Robust scene matching using line segments [4925-10]

    Chen, J. Y. / Guo, Z. M. / Tan, P. et al. | British Library Conference Proceedings | 2002


    Eigenvector derivatives of repeated eigenvalues using singular value decomposition

    LIM, KYONG B. / JUANG, JER-NAN / GHAEMMAGHAMI, PEIMAN | AIAA | 1989