Spectral median graphs applied to graphical symbol recognition

Authors:
Miquel Ferrer;Ernest Valveny;Francesc Serratosa
Affiliations:
Computer Vision Center, Dep. Ciències de la Computació, Universitat Autònoma de Barcelona, Bellaterra, Spain;Computer Vision Center, Dep. Ciències de la Computació, Universitat Autònoma de Barcelona, Bellaterra, Spain;Departament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Spain
Venue:
CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
Year:
2006

Citing 7
Cited 3

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Graduated Assignment Algorithm for Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
On Median Graphs: Properties, Algorithms, and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Symbol Recognition: Current Advances and Perspectives

GREC '01 Selected Papers from the Fourth International Workshop on Graphics Recognition Algorithms and Applications
Synthesis of Representative Graphical Symbols by Computing Generalized Median Graph

GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances
Synthesis of median spectral graph

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II

Median graphs: A genetic approach based on new theoretical properties

Pattern Recognition
A graph matching method and a graph matching distance based on subgraph assignments

Pattern Recognition Letters
Learning graph prototypes for shape recognition

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generalized median graph is a general concept useful to capture the essential information of a set of graphs. In addition, spectral techniques can be used to obtain approximate solutions of graph matching problems in a reasonable time. In this work we use the novel concept of spectral median graph which takes advantage of both the median concept and the spectral techniques, to synthesize the representative of a set of graphical symbols. The results show that this concept represents appropriately the most important intra-class features, while rejecting small distortions and, for extension, it can be used to infer a prototype of a set of symbols.