A polynomial algorithm for submap isomorphism of general maps

Authors:
Tao Wang;Guojun Dai;De Xu
Affiliations:
School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China;Computer School, Hangzhou Dianzi University, Hangzhou 310018, China;School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
Venue:
Pattern Recognition Letters
Year:
2011

Citing 9
Cited 3

The graph isomorphism problem: its structural complexity

The graph isomorphism problem: its structural complexity
Contraction kernels and combinatorial maps

Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Topological model for two-dimensional image representation: definition and optimal extraction algorithm

Computer Vision and Image Understanding
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth

Journal of Computer and System Sciences
Inexact graph matching using a genetic algorithm for image recognition

Pattern Recognition Letters
Topological model for 3D image representation: Definition and incremental extraction algorithm

Computer Vision and Image Understanding
Approximate graph edit distance computation by means of bipartite graph matching

Image and Vision Computing
A Polynomial Algorithm for Submap Isomorphism

GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition

A distance measure between labeled combinatorial maps

Computer Vision and Image Understanding
Combining boundary and region features inside the combinatorial pyramid for topology-preserving perceptual image segmentation

Pattern Recognition Letters
Part-based object detection into a hierarchy of image segmentations combining color and topology

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

Combinatorial maps explicitly encode orientations of edges around vertices, and have been used in many fields. In this paper, we address the problem of searching for patterns in model maps by putting forward the concept of symbol graph. A symbol graph will be constructed and stored for each model map in the preprocessing. Furthermore, an algorithm for submap isomorphism is presented based on symbol sequence searching in the symbol graphs. The computational complexity of this algorithm is quadratic in the worst case if we neglect the preprocessing step.