Graph matching by neural relaxation

Neural Computing and Applications

Volumn 7, Issue 3, 1998, Pages 238-248

  Turner, Mick ^a   Austin, J ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Correlation matrix memories; Graph matching; Relaxation labelling

Indexed keywords

EID: 0032283944     PISSN: 09410643     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01414885     Document Type: Article

References (23)

1. Besl PJ, Jain RC. Three-dimensional object recognition. Computing Sur 1985; 17: 75-145
2. Boyer K, Kak A. Structural stereopsis in 3D vision. IEEE Trans PAMI 1988; 10: 144-166
3. Horaud R, Skordas T. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans PAMI 1989; 11: 1168-1180
4. Christmas WJ, Kittler J, Petrou M. Structural matching in computer vision using probabilistic relaxation. IEEE Trans PAMI 1995; 17
5. Kittler J, Christmas WJ, Petrou M. Probabilistic relaxation for matching problems in machine vision. Proc 4th Int Conf Computer Vision 1993; 666-674
6. Li SZ. Matching invariant to translations, rotations and scale changes. Patt Recognition 1992; 25: 583-595
7. Radig B. Image sequence analysis using relational structures. Patt Recognition 1984; 17: 161-167
8. Shapiro LG, Haralick RM. Structural description and inexact matching. IEEE Trans PAMI 1981; 3: 504-519
9. Bron C, Kerbosch J. Finding all cliques in an undirected graph. Comm ACM 1973; 16(9): 575-577
10. Kirkpatrick S, Gelatt CD, Vecchi MP. Optimisation by simulated annealing. Science 1983; 20: 671-680
11. Goldberg DE. Genetic Algorithms in Search Optimisation and Machine Learning. Reading, MA: AddisonWesley, 1989
12. Kittler J, Hancock ER. Probabilistic relaxation. Int J Patt Recognition and Artif Intell 1989; 3(1): 29-51
13. Rosenfeld A, Hummel RA, Zucker SW. Scene labelling by relaxation operations. IEEE Trans SMC 1976; 6; 400-433
14. Hancock ER, Kittler J. Discrete relaxation. Patt Recognition 1990; 23: 711-733
15. Austin J. A review of RAM-based neural networks. Proc 4th Int Conf Microelectronics for Neural Networks and Fuzzy Systems, Turin, IEEE Press, 1994; 58-66
16. Kohonen T, Ruohonen HC. Representation of associated data by matrix operators. IEEE Trans Computers 1973
17. Willshaw DJ, Buneman OP, Longet-Higgins HC. Non-holographic associative memory. Nature 1969; 222: 960-962
18. Austin J, Kennedy J. A hardware implementation of a binary neural network. MicroNeuro, IEEE Press, 1994
19. Dempster NM, Laird DB. Maximum-likelihood from incomplete data via the EM algorithm. J Roy Statistical Soc Ser B (methodological) 1977; 39: 1-38
20. Turner M, Austin J. Matching performance of correlation matrix memories. Neural Networks 1997; 10(a): 1637-1648
21. Ullman JR. An algorithm for subgraph isomorphism. J ACM 1976; 16: 31-42
22. Turner M. Molecular structure matching: a review. Internal Report, Department of Computer Science, University of York, 1995
23. Turner M, Austin J. A neural relaxation technique for chemical graph matching. Proc 5th Int Conf Arti Neural Networks, Cambridge, 1997