Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Hierarchical Matching Using Combinatorial Pyramid Framework
ICISP '08 Proceedings of the 3rd international conference on Image and Signal Processing
| Hi-index | 0.00 |
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.