Weighted mean of a pair of graphs

Authors:
Horst Bunke;Simon Günter
Affiliations:
Univ. of Bern, Bern, Switzerland;Univ. of Bern, Bern, Switzerland
Venue:
Computing
Year:
2001

Citing 13
Cited 14

Hierarchical attributed graph representation and recognition of handwritten Chinese characters

Pattern Recognition
Model matching in robot vision by subgraph isomorphism

Pattern Recognition
Algorithms for approximate graph matching

Information Sciences—Informatics and Computer Science: An International Journal
Self-organizing maps

Self-organizing maps
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem

Journal of the ACM (JACM)
Matching Hierarchical Structures Using Association Graphs

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
Bayesian Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Shape Analysis Model with Applications to a Character Recognition System

IEEE Transactions on Pattern Analysis and Machine Intelligence
Sensitivity Analysis for Object Recognition from Large Structural Libraries

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Processing Pictorial Queries with Multiple Instances Using Isomorphic Subgraphs

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 4

Degraded character image restoration using active contours: a first approach

Proceedings of the 2002 ACM symposium on Document engineering
Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis

IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Validation indices for graph clustering

Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Dissimilarity between two skeletal trees in a context

Pattern Recognition
A Recursive Embedding Approach to Median Graph Computation

GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Generalized median graph computation by means of graph embedding in vector spaces

Pattern Recognition
Some experiments on clustering a set of strings

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Graph-based tools for data mining and machine learning

MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
A comparison between two representatives of a set of graphs: median vs. barycenter graph

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Visual Computing in Biology and Medicine: Graph averaging as a means to compare multichannel EEG coherence networks and its application to the study of mental fatigue and neurodegenerative disease

Computers and Graphics
A generic framework for median graph computation based on a recursive embedding approach

Computer Vision and Image Understanding
Towards the unification of structural and statistical pattern recognition

Pattern Recognition Letters
Evolutionary weighted mean based framework for generalized median computation with application to strings

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Ensemble clustering by means of clustering embedding in vector spaces

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph matching and graph edit distance are fundamental concepts instructural pattern recognition. In this paper, the weighted mean ofa pair of graphs is introduced. Given two graphs, G andG', with d(G, G') being the edit distance of G andG', the weighted mean of G and G' is a graphG'' that has edit distances d(,iG, G) and(G'', G') to G and G', respectively,such that d(G, G'') + d(G'',G') = d(G, G'). We'll show formalproperties of the weighted mean, describe a procedure for itscomputation, and give examples.