Integer and combinatorial optimization
Integer and combinatorial optimization
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
A Linear Programming Approach for the Weighted Graph Matching Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding Frequent Patterns in a Large Sparse Graph*
Data Mining and Knowledge Discovery
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Protein classification by matching and clustering surface graphs
Pattern Recognition
Graph matching and clustering using spectral partitions
Pattern Recognition
Edit distance-based kernel functions for structural pattern classification
Pattern Recognition
Inexact graph matching using a genetic algorithm for image recognition
Pattern Recognition Letters
A New Vectorial Signature for Quick Symbol Indexing, Filtering and Recognition
ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Fast online graph clustering via Erdős-Rényi mixture
Pattern Recognition
Generating Multiple Solutions for Mixed Integer Programming Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Spotting Symbols in Line Drawing Images Using Graph Representations
Graphics Recognition. Recent Advances and New Opportunities
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
ICDAR '09 Proceedings of the 2009 10th International Conference on Document Analysis and Recognition
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
International Journal on Document Analysis and Recognition
Learning graph prototypes for shape recognition
Computer Vision and Image Understanding
Using bags of symbols for automatic indexing of graphical document image databases
GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
A symbol spotting approach in graphical documents by hashing serialized graphs
Pattern Recognition
| Hi-index | 0.01 |
This paper tackles the problem of substitution-tolerant subgraph isomorphism which is a specific class of error-tolerant isomorphism. This problem aims at finding a subgraph isomorphism of a pattern graph S in a target graph G. This isomorphism only considers label substitutions and forbids vertex and edge insertion in G. This kind of subgraph isomorphism is often needed in pattern recognition problems when graphs are attributed with real values and no exact matching can be found between attributes due to noise. Our proposal to solve the problem of substitution-tolerant subgraph isomorphism relies on its formulation in the Integer Linear Program (ILP) formalism. Using a general ILP solver, the approach is able to find, if one exists, a mapping of a pattern graph into a target graph such that the topology of the searched graph is kept and the editing operations between the labels have a minimal cost. This technique is evaluated on both a set of synthetic graphs and a problem of symbol detection in technical drawings. In the second case, document and symbol images are represented by vector-attributed Region Adjacency Graphs built from a segmentation process. Obtained results demonstrate the relevance of considering subgraph isomorphism as an optimization process.