Abstract
We study the so-called Generalized Median graph problem where the task is to construct a prototype (i.e., a ‘model’) from an input set of graphs. While our primary motivation comes from an important biological imaging application, the problem effectively captures many vision (e.g., object recognition) and learning problems, where graphs are increasingly being adopted as a powerful representation tool. Existing techniques for his problem are evolutionary search based; in this paper, we propose a polynomial time algorithm based on a linear programming formulation. We propose an additional algorithm based on a bi-level method to obtain solutions arbitrarily close to the optimal in (worst case) non-polynomial time. Within this new framework, one can optimize edit distance functions that capture similarity by considering vertex labels as well as he graph structure simultaneously. We first discuss experimental evaluations in context of molecular image analysis problems—he methods will provide the basis for building a topological map of all 23 pairs of the human chromosome. Later, we include (a) applications to other biomedical problems and (b) evaluations on a public pattern recognition graph database.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Almohamad HA, Duffuaa SO (1993) A linear programming approach for the weighted graph matching problem. IEEE Trans Pattern Anal Mach Intell 15(5):522–525
Boblaender HL (1990) Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J Algorithms 11(4):631–643
Boykov Y, Veksler O, Zabih R (2001) Fast approximate energy minimization via graph cuts. IEEE Trans Pattern Anal Mach Intell 23(11):1222–1239
Boyle S, Gilchrist S, Bridger J, Mahy NL, Ellis JA, Bickmore WA (2001) The spatial organization of human chromosomes within the nuclei of normal and emerin-mutant cells. Hum Mol Genet 10:211–219
Brandes U, Gaertler M, Wagner D (2003) Experiments on graph clustering algorithms. In: Proc european symposium on algorithms, pp 568–579
Cook DJ, Holder LB (2006) Mining graph data. Wiley, New York, Chap 14
Corneil DG, Gotlieb CC (1970) An efficient algorithm for graph isomorphism. J Assoc Comput Mach 17(1):51–64
Cremer T, Cremer C (2001) Chromosome territories, nuclear architecture and gene regulation in mamalian cells. Nat Rev Genet 2:292–301
Finn PW, Muggleton S, Page D, Srinivasan A (1998) Pharmacophore discovery using the inductive logic programming system PROGOL. Mach Learn 30(2–3):241–270
Foggia P, Sansone C, Vento M (2001) A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: Proc IAPR workshop on graph-based repr
Hlaoui A, Wang S (2006) Median graph computation for graph clustering. Soft Comput 10(1):47–53
Horaud R, Skordas T (1989) Stereo correspondence through feature grouping and maximal cliques. IEEE Trans Pattern Anal Mach Intell 11(11):1168–1180
IBM frequent subgraph miner (2004)
Jiang X, Bunke H (2002) Optimal lower bound for generalized median problems in metric space. In: Proc of IAPR structural, syntactic, and statistical patt recog, pp 143–152
Jiang X, Munger A, Bunke H (2001) On median graphs: Properties, algorithms, and applications. IEEE Trans Pattern Anal Mach Intell 23(10):1144–1151
Justice D, Hero A (2006) A binary linear programming formulation of the graph edit distance. IEEE Trans Pattern Anal Mach Intell 28(8):1200–1214
Mahé P, Ralaivola L, Stoven V, Vert J (2006) The pharmacophore kernel for virtual screening with support vector machines. J Chem Inf Model 46(5):2003–2014
Muggleton S, De Raedt L (1994) Inductive logic programming: Theory and methods. J Log Program 19(20):629–679
Mukherjee L, Singh V, Peng J, Xu J, Zeitz MJ, Berezney R (2007) Generalized median graphs: Theory and applications. In: Proc international conf on computer vision
Mukherjee L, Singh V, Xu J, Malyavantham KS, Berezney R (2006) On mobility analysis of functional sites from time lapse microscopic image sequences of living cell nucleus. In: Proc medical image computing and computer-assisted intervention, pp 577–585
Nagele R, Freeman T, McMorrow L, Lee H (1998a) Precise spatial positioning of chromosomes during prometaphase: Evidence for chromosomal order. Science 270:1830–1835
Nagele R, Freeman T, McMorrow L, Thomson Z, Kitson-Wind K, Lee H (1998b) Chromosomes exhibit preferential positioning in quiescent human cells. J Cell Biol 112:525–535
Ng RT, Han J (1994) Efficient and effective clustering methods for spatial data mining. In: Proc conf on very large data bases, pp 144–155
Parada L, McQueen PG, Munson PJ, Misteli T (2002) Conservation of relative chromosome positioning in normal and cancer cells. Curr Biol 12(19):1692–1697
Phillips CA, Warnow T (1996) The asymmetric median tree: a new model for building consensus trees. Discrete Appl Math 71(1–3):311–335
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905
Siddiqi K, Shokoufandeh A, Dickinson SJ, Zucker SW (1998) Shock graphs and shape matching. In: Proc international conf on computer vision, pp 222–229
Tanabe H et al. (2002) Evolutionary conservation of chromosome territory arrangements in cell nuclei from higher primates. Proc Natl Acad Sci 99(7):4424–4429
Toda S (1999) Graph isomorphism: its complexity and algorithms. In: Proc conf on found of soft tech and theoretical computer science, p 341
Ullmann JR (1976) An algorithm for subgraph isomorphism. J Assoc Comput Mach 23(1):31–42
Umeyama S (1988) An eigendecomposition approach to weighted graph matching problems. IEEE Trans Pattern Anal Mach Intell 10(5):695–703
Yan X, Han J (2002) gSpan:Graph-based substructure pattern mining. In: Proc IEEE international conference on data mining
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by NSF grants CCF-0546509, IIS-0713489, and NIH grant GM 072131-23.
The second author was also supported in part by the Department of Biostatistics and Medical Informatics, UW-Madison and UW ICTR, funded through an NIH Clinical and Translational Science Award (CTSA), grant number 1 UL1 RR025011.
Rights and permissions
About this article
Cite this article
Mukherjee, L., Singh, V., Peng, J. et al. Generalized median graphs and applications. J Comb Optim 17, 21–44 (2009). https://doi.org/10.1007/s10878-008-9184-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-008-9184-7