GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism

  title={GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism},
  author={Julien Lerouge and Pierre Le Bodic and Pierre H{\'e}roux and S{\'e}bastien Adam},
The substitution-tolerant subgraph isomorphism is a particular error-tolerant subgraph matching that allows label substitutions for both vertices and edges. Such a matching is often required in pattern recognition applications since graphs extracted from images are generally labeled with features vectors computed from raw data which are naturally subject to noise. This paper describes an extended version of a Binary Linear Program (BLP) for solving this class of graph matching problem. The… 

Graph-based Patterns for Local Coherence Modeling

This dissertation presents a graph-based approach to local coherence modeling that accounts for the connectivity structure among sentences in a text and proposes a new graph representation of texts, rather than the entity graph.

Generating Coherent Summaries of Scientific Articles Using Coherence Patterns

This work introduces a graph-based approach to summarize scientific articles using coherence patterns in a corpus of abstracts and proposes a method to combine coherence, importance and non-redundancy to generate the summary.

Historical document image analysis : a structural approach based on texture. (Analyse d'images de documents patrimoniaux : une approche structurelle à base de texture)

The work conducted in this thesis presents an automatic approach for characterization and categorization of historical book pages which is applicable to a large variety of ancient books and is based on the use of texture and graph algorithms to provide a rich and holistic description of the layout and content of the analyzed book pages.

Contributions à la localisation adaptative de zones informatives sur des images de documents. (Contributions to adaptive field spotting in document images)

Notre troisieme contribution concerne l'optimisation des parametres d'une chaine de traitement pour ameliorer the performance of the localisation of l'information.

Exact Graph Edit Distance Computation Using a Binary Linear Program

A binary linear program which computes the exact graph edit distance between two richly attributed graphs (i.e. with attributes on both vertices and edges) and enables to process richer and larger graphs than existing approaches based on mathematical programming and the A^* algorithm.



A (sub)graph isomorphism algorithm for matching large graphs

The algorithm is improved here to reduce its spatial complexity and to achieve a better performance on large graphs; its features are analyzed in detail with special reference to time and memory requirements.

An Algorithm for Subgraph Isomorphism

A new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search by means of a brute-force tree-search enumeration procedure and a parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is described.

A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking

A database containing 72,800 couples of graphs especially devised for comparing the performance of isomorphic and graph-subgraph isomorphism algorithms is described.

Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming

This paper model the subgraph isomorphism problem as an Integer Linear Program (ILP) which enables to be error-tolerant on vectorial labels and solves the problem using a free efficient solver called SYMPHONY.

A large database of graphs and its use for benchmarking graph isomorphism algorithms

An algorithm for graph optimal monomorphism

The algorithm is a generalization of an algorithm for graph optimal isomorphism, and its potential for engineering application is demonstrated by a simple structural pattern recognition problem and a plant allocation and distribution problem.

Graph Optimal Monomorphism Algorithms

The characterization of graph morphisms in terms of the subgraphs of the Cartesian graph product is extended and used to develop algorithms for an optimal graph monomorphism problem. The objective

Performance evaluation of the VF graph matching algorithm

The paper discusses the performance of a graph matching algorithm tailored for dealing with large graphs in computer vision without using information about the topology of the graphs to be matched, with reference to its computational complexity and memory requirements.