Evaluation of Spectral-Based Methods for Median Graph Computation

Authors:
Miquel Ferrer;Francesc Serratosa;Ernest Valveny
Affiliations:
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;Computer Vision Center, Dep. Ciències de la Computació, Universitat Autònoma de Barcelona, Bellaterra, Spain
Venue:
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
Year:
2007

Citing 7
Cited 2

An Eigendecomposition Approach to Weighted Graph Matching Problems

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
Synthesis of Representative Graphical Symbols by Computing Generalized Median Graph

GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances
Mixing spectral representations of graphs

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 04
Report on the second symbol recognition contest

GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
Synthesis of median spectral graph

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

On the relation between the common labelling and the median graph

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A comparison between structural and embedding methods for graph classification

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

The median graph is a useful tool to cluster a set of graphs and obtain a prototype of them. The spectral graph theory is another approach to represent graphs and find "good" approximate solutions for the graph-matching problem. Recently, both approaches have been put together and a new representation has emerged, which is called Spectral-Median Graphs. In this paper, we summarize and compare two techniques to synthesize a Spectral-Median Graph: one is based on the correlation of the modal matrices and the other one is based on the averaging of the spectral modes. Results show that, although both approaches obtain good prototypes of the clusters, the first one is slightly more robust against the noise than the second one.