A Product Graph Based Method for Dual Subgraph Matching Applied to Symbol Spotting

  title={A Product Graph Based Method for Dual Subgraph Matching Applied to Symbol Spotting},
  author={Anjan Dutta and Josep Llad{\'o}s and Horst Bunke and Umapada Pal},
Product graph has been shown as a way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. Here we focus on the two major limitations of the previous version of the algorithm: (1) spurious nodes and edges in the graph representation and (2) inefficient node and edge attributes. To deal with noisy information of vectorized graphical documents, we consider a dual edge graph representation… 
Hierarchical Plausibility-Graphs for Symbol Spotting in Graphical Documents
The plausibility-annotated nodes of hierarchical graph as a function of distance are introduced and a modified algorithm for matching subgraphs of the hierarchical graphs is proposed to improve the performance of the matching algorithm on two hierarchical structures.
Improving Fuzzy Multilevel Graph Embedding Technique by Employing Topological Node Features: An Application to Graphics Recognition
This paper presents an improvement of the Fuzzy Multilevel Graph Embedding (FMGE) technique, by adding new topological node features, named Morgan Index, to illustrate improved results for the graph classification and graph clustering problems.
Graph Matching Applied For Textured Pattern Recognition
This paper addresses the detection of noisy structures in the context of infrared microscopy using labeled undirected graph matching using a graph tensor product-based similarity metric and achieves satisfying results.
Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism
Graph based representations have successful been used for isolated symbol recognition and new challenges in this research field have focused on symbol recognition, symbol spotting or symbol based indexing of technical drawing.
Shape Clustering Using K-Medoids in Architectural Form Finding
  • S. Yousif, Wei Yan
  • Computer Science
    Communications in Computer and Information Science
  • 2019
This work introduces a new design articulation approach, a Shape Clustering using K-Medoids (SC-KM) method that is capable of grouping a dataset of shapes with similitude in one cluster and retrieving a representative for each cluster, and incorporates the developed clustering method in architectural form finding.
Application and evaluation of a K-Medoids-based shape clustering method for an articulated design space
A method for shape clustering using K-Medoids, a machine learning-based strategy, which performs clustering of similar design shapes and retrieves a representative shape for each cluster in 2D grid-based representation is developed.


Combination of product graph and random walk kernel for symbol spotting in graphical documents
This paper explores the utilization of product graph for spotting symbols on graphical documents. Product graph is intended to find the candidate subgraphs or components in the input graph containing
A symbol spotting approach in graphical documents by hashing serialized graphs
Graph-Based Representations in Pattern Recognition
A Graph-Based Representation to Detect Linear Features and Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs and Optimization Techniques on Pixel Neighborhood Graphs for Image Processing.
Backtrackless Walks on a Graph
Efficient methods for computing graph kernels, which are based on backtrackless walks in a labeled graph and whose worst case running time is the same as that of kernels based on random walks are presented.
A Fast Matching Algorithm for Graph-Based Handwriting Recognition
This paper proposes a faster graph matching algorithm which is derived from the Hausdorff distance, and demonstrates that the proposed method achieves a speedup factor of 12.9 without significant loss in recognition accuracy.
Graph Kernels for Molecular Structure-Activity Relationship Analysis with Support Vector Machines
Two extensions to the support vector machine algorithm are proposed with the double goal to reduce the computational burden associated with the model and to enhance its predictive accuracy: description of the molecules by a Morgan index process and definition of a second-order Markov model for random walks on 2D structures.
On Graph Kernels: Hardness Results and Efficient Alternatives
As most ‘real-world’ data is structured, research in kernel methods has begun investigating kernels for various kinds of structured data, but only very specific graphs such as trees and strings have been considered.
Zeta Functions of Finite Graphs and Coverings
Abstract Three different zeta functions are attached to a finite connected, possibly irregular graph X . They originate with a zeta function of Ihara which is an analogue of Riemann's as well as
Symbol Recognition: Current Advances and Perspectives
Issues such as symbol representation, matching, segmentation, learning, scalability of recognition methods and performance evaluation are addressed in this work.
Building Synthetic Graphical Documents for Performance Evaluation
A system that allows to build synthetic graphical documents for the performance evaluation of symbol recognition systems by exploiting the layer property of graphical documents by positioning symbol sets in different ways from a same background using positioning constraints is presented.