Graph-based methods for vision: A yorkist manifesto

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2396, Issue , 2002, Pages 31-46

  Hancock, Edwin ^a   Wilson, Richard C ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; SYNTACTICS;

GRAPH-BASED METHODS; MATRIX METHODS; OPTIMISATIONS; PROBABILISTIC FRAMEWORK; SEGMENTATION AND GROUPING;

PATTERN RECOGNITION;

EID: 84951789799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70659-3_3     Document Type: Conference Paper

References (79)

1. J. Kittler and E. R. Hancock, “CombiningEv idence in Probabilistic Relaxation,” International Journal of Pattern Recognition and Artificial Intelligence, 3, pp.29-52, 1989.
2. E. R. Hancock and J. Kittler, “Discrete Relaxation,” Pattern Recognition, 23, pp.711-733, 1990.
3. E. R. Hancock and J. Kittler, “Edge-labelling using Dictionary-based Probabilistic Relaxation,” IEEE Transactions on Pattern Analysis and Machine Intelligence,12, pp 165-181 1990.
4. R. C. Wilson, A. N. Evans and E. R. Hancock, “Relational Matchingb y Discrete Relaxation”, Image and Vision Computing, 13, pp. 411-422, 1995.
5. R. C. Wilson and E. R. Hancock, “A Bayesian Compatibility Model for Graph Matching”, Pattern Recognition Letters, 17, pp. 263-276, 1996.
6. M. L. Williams, R. C. Wilson, and E. R. Hancock, “Multiple Graph Matchingwit h Bayesian Inference”, Pattern Recognition Letters, 18, pp. 1275-1281, 1997.
7. R. C. Wilson and E. R. Hancock, “Structural Matchingb y Discrete Relaxation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 19, No.6, pp.634-648, 1997.
8. A. D. J. Cross, R. C. Wilson and E. R. Hancock, “Genetic Search for Structural Matching”, Pattern Recognition, 30, pp.953-970, 1997.
9. A. M. Finch, R. C. Wilson and E. R. Hancock, “MatchingDe launay Graphs”, Pattern Recognition, 30, pp. 123-140, 1997.
10. A. M. Finch, R. C. Wilson and E. R. Hancock, “Symbolic Graph Matchingwit h the EM Algorithm”, Pattern Recognition, 31, pp. 1777-1790, 1998.
11. R. C. Wilson, A. D. J. Cross and E. R. Hancock, “Structural Matchingwit h Active Triangulations”, Computer Vision and Image Understanding, 72, pp. 21-38, 1998.
12. A. D. J. Cross and E. R. Hancock, “Matching Buildings in Aerial Stereogramms usingG enetic Search and Matched Filters”, ISPRS Journal of Photogrammetry and Remote Sensing, 53, pp. 95-107, 1998.
13. A. M. Finch, R. C. Wilson and E. R. Hancock, “An Energy Function and Continuous Edit Process for Graph Matching”, Neural Computation, 10, pp. 1873-1894, 1998.
14. A. D. J. Cross and E. R. Hancock, “Graph Matchingw ith a Dual Step EM Algorithm”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 20, pp. 1236-1253, 1998.
15. P. L Worthington and Edwin R Hancock, “New Constraints on Data-Closeness and Needle Map Consistency for Shape-from-Shaping”, IEEE Transactions on Pattern Analysis and Machine Intelligence, IEEE Computer Society Press, vol. 21, no. 12, pp 1250-1267, 1999.
16. R. C. Wilson and E. R. Hancock, “Graph matchingwit h hierarchical discrete relaxation”, Pattern Recognition Letters, 20, pp 1041-1052, 1999.
17. M. L. Williams and R. C. Wilson and E. R. Hancock, “Deterministic Search For Relational Graph Matching”, Pattern Recognition, 32, pp. 1255-1271, 1999.
18. S. Moss and Richard C. Wilson and E. R. Hancock, “A mixture model of pose clustering”, Pattern Recognition Letters, 20, pp 1093-1101, 1999.
19. B. Huet and E. R. Hancock, “Shape recognition from large image libraries by inexact graph matching”, Pattern Recognition Letters, 20, pp. 1259-1269, 1999.
20. B. Huet and E. R. Hancock, “Line Pattern Retrieval UsingR elational Histograms”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 21, pp. 1363-1370, 1999.
21. R. Myers, R. C. Wilson and E. R. Hancock, “Bayesian Graph Edit Distance”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, pp 628-635, 2000.
22. A. D. J. Cross and E. R. Hancock, “Convergence of a Hill Climbing Genetic Algorithm for Graph Matching”, Pattern Recognition, 33, pp 1863-1880, 2000.
23. R. C. Wilson and E. R. Hancock, “Bias Variance Analysis for ControllingA daptive Surface Meshes”, Computer Vision and Image Understanding 77, pp 25-47, 2000.
24. R. Myers, E. R. Hancock, “Genetic Algorithms for Ambiguous Labelling Problems”, Pattern Recognition, 33, pp. 685-704, 2000.
25. P. L. Worthington and E. R. Hancock, “Object Recognition using Shape-fromshading”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 33, pp. 535-562, 2001.
26. R. Myers and E. R. Hancock, “Least Commitment Graph Matchingw ith Genetic Algorithms”, Pattern Recognition, 34, pp 375-394, 2001.
27. B. Luo and E. R. Hancock “Structural Matchingus ing the EM algorithm and singular value decomposition”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 23, pp. 1120-1136, 2001.
28. R. Myers and E. R. Hancock, “Empirical Modellingof Genetic Algorithms”, Evolutionary Computation, 9, pp. 461-493, 2001.
29. B. Huet and E. R. Hancock, “Relational Object Recognition from Large Structural Libraries”, Pattern Recognition, 2002.
30. M. Carcassoni and E. R. Hancock, “Spectral Correspondence for Point Pattern Matching”, Pattern Recognition, to appear 2002.
31. B. Luo and E. R. Hancock, “Iterative Procrustes Analysis usingt he EM Algorithm, Image and Vision Computing, to appear 2002.
32. B. Huet and E. R. Hancock, “Object Recognition from Large Structural Libraries”, Advances in Structural and Syntactic Pattern Recognition, Springer, Lecture Notes in Computer Science, 1451, pp. 190-199, 1998.
33. S. Moss and Edwin R. Hancock, “Structural Constraints for Pose Clustering”, Computer Analysis of Images and Patterns, Springer Lecture Notes in Computer Science, 1689, Franc Solina and Ales Leonardis eds.,pp. 632-640, 1999.
34. A. Torsello and E. R. Hancock, “A Skeletal Measure of 2D Shape Similarity”, Springer Lecture Notes in Computer Science, 2059, Edited by C. Arcelli, L. P. Cordella and G. Sannitii di Baja, pp. 260-271, 2001.
35. A. Robles-Kelly and E. R. Hancock, “An Expectation-Maximisation Framework for Perceptual Grouping”, Springer Lecture Notes in Computer Science, 2059, Edited by C. Arcelli, L. P. Cordella and G. Sannitii di Baja, pp. 594-605, 2001.
36. A. Kelly and E. R. Hancock, “A maximum likelihood framework for grouping and segmentation”, Springer Lecture notes in Computer Science, 2134, pp. 251-266, 2001.
37. A. Torsello and E. R. Hancock, “Efficiently computingw eighted tree edit distance usingrelax ation labeling”, Springer Lecture notes in Computer Science, 2134, pp. 438-453, 2001.
38. B. Luo, A. Robles-Kelly, A. Torsello, R. C. Wilson, E. R. Hancock, “Discovering Shape Categories by Clustering Shock Trees”, Springer Lecture notes in Computer Science, 2124, pp. 151-160, 2001.
39. B. Huet and E. R. Hancock, “Fuzzy Relational Distance for Large-scale Object Recognition”, IEEE Computer Society Computer Vision and Pattern Recognition Conference, IEEE Computer Society Press, pp. 138-143, 1998.
40. S. Moss and E. R. Hancock, “Pose Clusteringw ith Density Estimation and Structural Constraints”, IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society Press, Fort Collins, vol II, pp. 85-91, 1999.
41. M. Carcassoni and E. R. Hancock, “Point Pattern Matchingwit h Robust Spectral Correspondence”, IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society Press, I, pp. 649-655, 2000.
42. A. Robles-Kelly and E. R. Hancock, “A Maximum Likelihood Framework for Iterative Eigendecomposition”, Eighth International Conference on Computer Vision, IEEE Computer Society Press, Vancouver, Canada, pp. 654-661, 1999.
43. A. Robles-Kelly and E. R. Hancock, “Graph Matchingu sing Adjacency Matrix Markov Chains”, British Machine Vision Conference, pp. 383-390, 2001.
44. A. Torsello, B. Luo, A. Robles-Kelly, R. C. Wilson and E. R. Hancock, “A Probabilistic Framework for Graph Clustering”, IEEE Computer Vision and Pattern Recognition Conference, pp. 912-919, 2001.
45. A. Torsello and E. R. Hancock, “Matchinga nd Embedding through Edit Union of Trees”, ECCV 2002, to appear.
46. H. G. Barrow and R. J. Popplestone. Relational descriptions in picture processing. Machine Intelligence, VI:377-396, 1971.
47. K. Boyer and A. Kak. Structural Stereopsis for 3D Vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10:144-166, 1988
48. H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19:255-259, 1998.
49. H. Bunke. Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21:917-922, 1999.
50. W. J. Christmas, J. Kittler, and M. Petrou. Structural matchingi n computer vision usingp robabilistic relaxation. IEEE PAMI, 17(8):749-764, 1995.
51. F. R. K. Chung. Spectral Graph Theory. American Mathmatical Society Ed., CBMS series 92, 1997.
52. A. D. J. Cross, R. C. Wilson, and E. R. Hancock. Inexact graph matching with genetic search. Pattern Recognition 30(6):953-970, 1997.
53. M. A. Eshera and K. S. Fu. An image understanding system using attributed symbolic representation and inexact graph-matching. Journal of the Association for Computing Machinery, 8(5):604-618, 1986.
54. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE PAMI, 18(4):377-388, 1996.
55. M. Fischler and R. Elschlager. The representation and matching of pictorical structures. IEEE Transactions on Computers, 22(1):67-92, 1973.
56. L. Herault, R. Horaud, F. Veillon, and J. J. Niez. Symbolic image matching by simulated annealing. In Proceedings of British Machine Vision Conference, pag es 319-324, 1990.
57. R. Horaud and H. Sossa. Polyhedral object recognition by indexing. Pattern Recognition, 28(12):1855-1870, 1995.
58. M. I. Jordan and R. A. Jacobs. Hierarchical mixture of experts and the EM algorithm. Neural Computation, 6:181-214, 1994.
59. B. Luo and E. R. Hancock. Relational constraints for point distribution models. Springer Lecture Notes in Computer Science, 2124:646-656, 2001.
60. M. Pellilo. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11(8):1933-1955, 1999.
61. A. Sanfeliu and K. S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Systems, Man and Cybernetics, 13(3):353-362, May 1983.
62. G. L. Scott and H. C. Longuet-Higgins. An Algorithm for Associating the Features of 2 Images. Proceedings of the Royal Society of London Series B-Biological, 244(1309):21-26, 1991.
63. K. Sengupta and K. L. Boyer. Modelbase partitioningus ingpro perty matrix spectra. Computer Vision and Image Understanding, 70(2):177-196, 1998.
64. L. G. Shapiro and R. M. Haralick. A metric for comparingrelat ional descriptions. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(1):90-94, January 1985.
65. L. S. Shapiro and J. M. Brady. Feature-based Correspondence-An Eigenvector Approach. Image and Vision Computing, 10:283-288, 1992.
66. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 22(8):888-905, August 2000.
67. A. Shokoufandeh, S. J. Dickinson, K. Siddiqi, and S. W. Zucker. Indexingus ing a spectral encodingof topological structure. In Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pages 491-497, 1999.
68. P. D. Simic. Constrained nets for graph matching and other quadratic assignment problems. Neural Computation, 3:268-281, 1991.
69. S. Tirthapura, D. Sharvit, P. Klein, and B. B. Kimia. Indexingba sed on editdistance matchingo f shape graphs. Multimedia Storage And Archiving Systems III, 3527:25-36, 1998.
70. S. Umeyama. An eigen decomposition approach to weighted graph matching problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10:695-703, 1988.
71. M. L. Williams, R. C. Wilson, and E. R. Hancock. Deterministic search for relational graph matching. Pattern Recognition, 32(7):1255-1271, 1999.
72. A. K. C. Wonga nd M. You. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7:509-609, 1985.
73. A. L. Yuille, P. Stolorz, and J. Utans. Statistical Physics, Mixtures of Distributions, and the EM Algorithm. Neural Computation, 6:334-340, 1994.
74. M. Pelillo, K. Siddiqi, and S. W. Zucker. Matchingh ierarchical structures using association graphs. IEEE PAMI, 21(11):1105-1120, 1999.
75. W. J. Christmas, J. Kittler, and M. Petrou. Structural matchingi n computer vision usingp robabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8):749-764, 1995.
76. J. Kittler and E. R. Hancock. Combiningev idence in probabilistic relaxation. IEEE PRAI, 3:29-51, 1989.
77. V. Levenshtein. Binary codes capable of correctingde letions, insertions, and reversals. Soviet Physics-Doklady, 10:707-710, 1966.
78. P. N. Suganthan, E. K. Teoh, and D. P. Mital. Pattern-recognition by graph matchingus ingthe potts mft neural networks.
79. T. Hofmann and J. M. Buhmann. Pairwise data clusteringb y deterministic annealing. PAMI, 19(2):192-192, February 1997.