Structural matching via optimal basis graphs

Proceedings - International Conference on Pattern Recognition

Volumn 3, Issue , 2006, Pages 449-452

  DePiero, Fred W ^a   Carlin, John K ^b  

^a CALIFORNIA POLYTECHNIC STATE UNIVERSITY   (United States)

^b AGILENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLOR IMAGE PROCESSING; COMPUTATIONAL METHODS; CONFORMAL MAPPING; EDGE DETECTION; GRAPH THEORY; PROBABILITY;

INPUT GRAPHS; MAPPING PROBABILITIES; STRUCTURAL MATCHING;

PATTERN MATCHING;

EID: 34147133801     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2006.1086     Document Type: Conference Paper

References (22)

1. M. Carcassoni and E.R. Hancock, Correspondence Matching with Modal Clusters, IEEE Trans. PAMI, 25 (12) (2003) 1609-1614.
2. W J Christmas, J Kittler and M Petrou, Probabilistic feature-labelling schemes: modelling compatibility coefficient distributions. Image and Vision Comp, 14 (1996) 617-625.
3. A.D.J. Cross, E.R. Hancock, Graph matching with a dual-step EM algorithm, IEEE Trans. PAMI, 20 (11) (1998) 1236.
4. F. W. DePiero, "Deterministic Surface Registration at 10Hz Based on Landmark Graphs With Prediction," 14th British Machine Vision Conf. (BMVC2003), Norwich, UK, Sept, 2003.
5. F. W. DePiero and D.W. Krout, LeRP: An algorithm using length-r paths to determine subgraph isomorphism, Pattern Rec Journal, 24 (1) (2003) 33-46.
6. F. W. DePiero., "Home Page", Software for Graph Matching, www.ee.calpoly.edu/~fdepiero/ (August, 2004).
7. S. Gold, A Rangarajan, A graduated assignment algorithm for graph matching, IEEE Trans. PAMI, 18 (4) (1996) 377-388.
8. J. Kittler, E. R. Hancock, Combining Evidence in Probabilistic Relaxation, Intl. Journal of Pattern Recognition and Artificial Intelligence, 3 (1989) 29-51.
9. B. Luo and E.R. Hancock, Structural graph matching using the EM algorithm and singular value decomposition, IEEE Trans. PAMI, 23 (10) (2001) 1106-1119.
10. B.T. Messmer, H. Bunke, A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans. PAMI, 20 (5) (1998) 493-504.
11. B. McKay. Practical Graph Isomorphism, Congressus Numerantium, 30 (1981) 45-87.
12. R. Myers, R.C. Wilson, E.R. Hancock, Bayesian graph edit distance, IEEE Trans. PAMI, 22 (6) (1997) 628-635.
13. E. M. Palmer, Graphical Evolution - An Introduction to the Theory of Random Graphs, Wiley-Interscience, 1985.
14. A. Sanfeliu, K.S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Systems, Man and Cybernetics, 13 (1983) 353-363.
15. R.C. Wilson, E.R. Hancock, Structural matching by discrete relaxation, IEEE Trans. PAMI, 19 (6) (1997) 634-648.
16. R. C. Read and D. G. Corneil, The graph isomorphism disease, Journal of Graph Theory, 1 (1) 339-363 (1977).
17. F. W. DePiero, Structural Graph Matching with Polynomial Bounds on Memory and on Worst-Case Effort, (ICPR2004) Cambridge, UK, August 23-26, 2004.
18. T. Caelli and S. Kosinov, An eigenspace projection clustering method for inexact graph matching, IEEE Trans. PAMI, 26 (4) (2004) 515-519.
19. A. Robles-Kelly and E.R. Hancock, Graph Edit Distance from Spectral Seriation, IEEE T. PAMI, 27 (3) (2005) 365-378.
20. M. Gori, M. Maggini and L. Sarti, Exact and Approximate Graph Matching Using Random Walks, IEEE T. PAMI, 27 (7) (2005) 1100-1111.
21. R.C. Wilson, E.R. Hancock and B. Luo, Pattern Vectors from Algebraic Graph Theory, IEEE T. PAMI, 27 (7) (2005) 1112-1124.
22. L. Cordella, P. Foggia, C. Sansome and M. Vento, A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs, IEEE T. PAMI, 26 (10) (2004) 1367-1372.