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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Matching patterns of line segments by eigenvector decomposition


    Beteiligte:
    Chan, H.B. (Autor:in) / Hung, Y.S. (Autor:in)


    Erscheinungsdatum :

    2002-01-01


    Format / Umfang :

    482377 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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


    Eigenvector derivatives of repeated eigenvalues using singular value decomposition

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


    Eigenvector derivatives of repeated eigenvalues using singular value decomposition

    Lim, Kyong B. / Juang, Jer-Nan / Ghaemmaghami, Peiman | NTRS | 1989