Towards Bridging the Gap between Statistical and Structural Pattern Recognition: Two New Concepts in Graph Matching

Authors:
Horst Bunke;Simon Günter;Xiaoyi Jiang
Affiliations:
-;-;-
Venue:
ICAPR '01 Proceedings of the Second International Conference on Advances in Pattern Recognition
Year:
2001

Citing 11
Cited 6

Using consensus sequence voting to correct OCR errors

Computer Vision and Image Understanding
Self-organizing maps

Self-organizing maps
The String-to-String Correction Problem

Journal of the ACM (JACM)
Statistical Pattern Recognition: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved greedy algorithm for computing approximate median strings

Acta Cybernetica
Combinatorial search versus genetic algorithms: a case study based on the generalized median graph problem

Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Mean and maximum common subgraph of two graphs

Pattern Recognition Letters
Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition

SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition

SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Error-Tolerant Graph Matching: A Formal Framework and Algorithms

SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Synthesis of Representative Graphical Symbols by Computing Generalized Median Graph

GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances

A similarity-based approach for shape classification using Aslan skeletons

Pattern Recognition Letters
Fuzzy intervals for designing structural signature: an application to graphic symbol recognition

GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Comparing graph similarity measures for graphical recognition

GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Graph embedding using constant shift embedding

ICPR'10 Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos
Structural inference of sensor-based measurements

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Improving fuzzy multilevel graph embedding through feature selection technique

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two novel concepts in structural pattern recognition are discussed in this paper. The first, median of a set of graphs, can be used to characterize a set of graphs by just a single prototype. Such a characterization is needed in various tasks, for example, in clustering. The second novel concept is weighted mean of a pair of graphs. It can be used to synthesize a graph that has a specified degree of similarity, or distance, to each of a pair of given graphs. Such an operation is needed in many machine learning tasks. It is argued that with these new concepts various well-established techniques from statistical pattern recognition become applicable in the structural domain, particularly to graph representations. Concrete examples include k-means clustering, vector quantization, and Kohonen maps.