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

Computer Vision and Image Understanding

Volumn 115, Issue 7, 2011, Pages 919-928

  Ferrer, M ^a   Karatzas, D ^b   Valveny, E ^b   Bardaji, I ^a   Bunke, H ^c  

^a CSIC   (Spain)

^b UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^c UNIVERSITY OF BERN   (Switzerland)

Author keywords

Graph embedding; Graph matching; Median graph; Structural pattern recognition

Indexed keywords

COMPLEX PROBLEMS; GENERIC FRAMEWORKS; GRAPH EMBEDDINGS; GRAPH MATCHINGS; GRAPH-MATCHING ALGORITHMS; MEDIAN GRAPH; REAL WORLD DATA; RECURSIVE PROCEDURE; STRUCTURAL PATTERN RECOGNITION; SUM OF DISTANCES;

APPROXIMATION ALGORITHMS; PATTERN MATCHING; VECTORS;

VECTOR SPACES;

EID: 79956112009     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2010.12.010     Document Type: Article

References (36)

1. D. Conte, P. Foggia, C. Sansone, and M. Vento Thirty years of graph matching in pattern recognition Int. J. Pattern Recognit. Artif. Intell. 18 3 2004 265 298
2. X. Jiang, A. Münger, and H. Bunke On median graphs: properties, algorithms, and applications IEEE Trans. Pattern Anal. Mach. Intell. 23 10 2001 1144 1151 (Pubitemid 33047952)
3. M. Ferrer, E. Valveny, F. Serratosa, I. Bardají, and H. Bunke Graph-based -means clustering: a comparison of the set median versus the generalized median graph X. Jiang, N. Petkov, CAIP Lecture Notes in Computer Science vol. 5702 2009 Springer 342 350
4. M. Ferrer, E. Valveny, F. Serratosa, K. Riesen, H. Bunke, Generalized median graph computation by means of graph embedding in vector spaces, Pattern Recognit., in press. doi:10.1016/j.patcog.2009.10.013.
5. H. Bunke, A. Münger, and X. Jiang Combinatorial search versus genetic algorithms: a case study based on the generalized median graph problem Pattern Recognit. Lett. 20 11-13 1999 1271 1277 (Pubitemid 32261905)
6. A. Münger, Synthesis of Prototype Graphs from Sample Graphs, in: Diploma Thesis, University of Bern (in German), 1998.
7. M. Ferrer, E. Valveny, and F. Serratosa Median graph: a new exact algorithm using a distance based on the maximum common subgraph Pattern Recognit. Lett. 30 5 2009 579 588
8. A. Hlaoui, and S. Wang Median graph computation for graph clustering Soft Comput. 10 1 2006 47 53 (Pubitemid 41631145)
9. M. Ferrer, F. Serratosa, A. Sanfeliu, Synthesis of median spectral graph, in: Second Iberian Conference of Pattern Recognition and Image Analysis, vol. 3523, LNCS, 2005, pp. 139-146.
10. D. White, and R.C. Wilson Mixing spectral representations of graphs 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China 2006 IEEE Computer Society 140 144 (Pubitemid 46553382)
11. P. Indyk, Algorithmic applications of low-distortion geometric embeddings, in: IEEE Symposium on Foundations of Computer Science, 2001, pp. 10-33. (Pubitemid 33068364)
12. R. Babilon, J. Matousek, J. Maxová, and P. Valtr Low-distortion embeddings of trees J. Graph Algorithms Appl. 7 4 2003 399 409
13. M.F. Demirci, A. Shokoufandeh, and S.J. Dickinson Skeletal shape abstraction from examples IEEE Trans. Pattern Anal. Mach. Intell. 31 5 2009 944 952
14. B. Luo, R.C. Wilson, and E.R. Hancock Spectral embedding of graphs Pattern Recognit. 36 10 2003 2213 2230 (Pubitemid 36947209)
15. R.C. Wilson, E.R. Hancock, Levenshtein distance for graph spectral features, in: 17th International Conference on Pattern Recognition, 2004, pp. 489-492.
16. R.C. Wilson, E.R. Hancock, and B. Luo Pattern vectors from algebraic graph theory IEEE Trans. Pattern Anal. Mach. Intell. 27 7 2005 1112 1124 (Pubitemid 41046906)
17. A. Robles-Kelly, and E.R. Hancock A Riemannian approach to graph embedding Pattern Recognit. 40 3 2007 1042 1056 (Pubitemid 44755293)
18. H. Bunke, and G. Allerman Inexact graph matching for structural pattern recognition Pattern Recognit. Lett. 1 4 1983 245 253
19. K. Riesen, and H. Bunke Graph classification based on vector space embedding IJPRAI 23 6 2009 1053 1081
20. E. Weiszfeld Sur le point pour lequel la somme des distances de n points donnés est minimum Tohoku Math. Journal 43 1937 355 386
21. H. Bunke, and S. Günter Weighted mean of a pair of graphs Computing 67 3 2001 209 224 (Pubitemid 33112698)
22. M. Ferrer, D. Karatzas, E. Valveny, and H. Bunke A recursive embedding approach to median graph computation A. Torsello, F. Escolano, L. Brun, GbRPR Lecture Notes in Computer Science vol. 5534 2009 Springer 113 123
23. A. Sanfeliu, and K. Fu A distance measure between attributed relational graphs for pattern recognition IEEE Trans. Syst. Man Cybernet. 13 3 1983 353 362 (Pubitemid 13591176)
24. M. Neuhaus, and H. Bunke An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification A.L.N. Fred, T. Caelli, R.P.W. Duin, A.C. Campilho, D. de Ridder, SSPR/SPR Lecture Notes in Computer Science vol. 3138 2004 Springer 180 189
25. D. Justice, and A.O. Hero A binary linear programming formulation of the graph edit distance IEEE Trans. Pattern Anal. Mach. Intell. 28 8 2006 1200 1214 (Pubitemid 46405019)
26. M. Neuhaus, K. Riesen, H. Bunke, Fast suboptimal algorithms for the computation of graph edit distance, in: Joint IAPR International Workshops, SSPR and SPR 2006, Lecture Notes in Computer Science 4109, 2006, pp. 163-172.
27. K. Riesen, and H. Bunke Approximate graph edit distance computation by means of bipartite graph matching Image Vision Comput. 27 7 2009 950 959
28. E. Pekalska, and R. Duin The Dissimilarity Representation for Pattern Recognition-Foundations and Applications 2005 World Scientific
29. C. de la Higuera, and F. Casacuberta Topology of strings: median string is NP-complete Theor. Comput. Sci. 230 1-2 2000 39 48
30. K. Grauman, T. Darrell, Fast contour matching using approximate earth mover's distance, in: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004, pp. 220-227.
31. M.F. Demirci, A. Shokoufandeh, Y. Keselman, L. Bretzner, and S.J. Dickinson Object recognition as many-to-many feature matching Int. J. Comput. Vision 69 2 2006 203 222 (Pubitemid 43814118)
32. K. Riesen, and H. Bunke Graph Classification and Clustering Based on Vector Space Embedding 2010 World Scientific
33. E. Pekalska, R.P.W. Duin, and P. Paclík Prototype selection for dissimilarity-based classifiers Pattern Recognition 39 2 2006 189 208 (Pubitemid 41586089)
34. C. Bajaj The algebraic degree of geometric optimization problems Discrete Comput. Geom. 3 2 1988 177 191
35. S.L. Hakimi Location Theory 2000 CRC Press
36. K. Riesen, H. Bunke, IAM graph database repository for graph based pattern recognition and machine learning, in: SSPR/SPR, 2008, pp. 287-297.