An efficient graph matching approach is proposed for finding region correspondence between two images of the same scene but taken from different viewpoints. Regions and their relations in an image are represented with region adjacency graph (RAG), which is a kind of attributed planar graph. The problem to find an optimal region correspondence, which matches the regions in two images with maximal similarity in region features and region relations, is formulated into the problem to find the optimal inexact matching between two RAGs. The properties specific to planar graph and that of the region adjacency relations are utilized to invent an efficient algorithm to solve the problem. Experimental results on various kinds of images show the effectiveness of the method.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Region correspondence by inexact attributed planar graph matching


    Contributors:
    Wang, C. (author) / Abe, K. (author)


    Publication date :

    1995-01-01


    Size :

    886751 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Region Correspondence by Inexact Attributed Planar Graph Matching

    Wang, C. / Abe, K. / IEEE Computer Society et al. | British Library Conference Proceedings | 1995



    A Robust Eigendecomposition Framework for Inexact Graph-Matching

    Luo, B. / Hancock, E. / IEEE | British Library Conference Proceedings | 2001


    On the Problem of Attributed Relational Graph Matching

    Budin, A. | British Library Online Contents | 1992


    Self-organizing Hopfield network for attributed relational graph matching

    Suganthan, P. N. / Teoh, E. K. / Mital, D. P. | British Library Online Contents | 1995