ML Anthology

Region Correspondence by Inexact Attributed Planar Graph Matching

Caihua Wang, Keiichi Abe
ICCV 1995 pp. 440-
doi:10.1109/ICCV.1995.466906 /iccv/1995/wang1995iccv-region/

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

ICCV Semantic Scholar

Cite

Text

Wang and Abe. "Region Correspondence by Inexact Attributed Planar Graph Matching." IEEE/CVF International Conference on Computer Vision, 1995. doi:10.1109/ICCV.1995.466906

Markdown

[Wang and Abe. "Region Correspondence by Inexact Attributed Planar Graph Matching." IEEE/CVF International Conference on Computer Vision, 1995.](https://mlanthology.org/iccv/1995/wang1995iccv-region/) doi:10.1109/ICCV.1995.466906

BibTeX

@inproceedings{wang1995iccv-region,
  title     = {{Region Correspondence by Inexact Attributed Planar Graph Matching}},
  author    = {Wang, Caihua and Abe, Keiichi},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {1995},
  pages     = {440-},
  doi       = {10.1109/ICCV.1995.466906},
  url       = {https://mlanthology.org/iccv/1995/wang1995iccv-region/}
}