Skip to main content
Log in

Graph matching by neural relaxation

  • Articles
  • Published:
Neural Computing & Applications Aims and scope Submit manuscript

Abstract

We propose a new relaxation scheme for graph matching in computer vision. The main distinguishing feature of our approach is that matching is formulated as a process of eliminating unlikely candidates rather than finding the best match directly. Bayesian development leads to a robust algorithm which can be implemented in a fast and efficient manner on a neural network architecture. We illustrate the utility of the technique through comparisons with its conventional counterpart on simulated and real-world data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Besl PJ, Jain RC. Three-dimensional object recognition. Computing Sur 1985; 17: 75–145

    Google Scholar 

  2. Boyer K, Kak A. Structural stereopsis in 3D vision. IEEE Trans PAMI 1988; 10: 144–166

    Google Scholar 

  3. Horaud R, Skordas T. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans PAMI 1989; 11: 1168–1180

    Google Scholar 

  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

    Google Scholar 

  7. Radig B. Image sequence analysis using relational structures. Patt Recognition 1984; 17: 161–167

    Google Scholar 

  8. Shapiro LG, Haralick RM. Structural description and inexact matching. IEEE Trans PAMI 1981; 3: 504–519

    Google Scholar 

  9. Bron C, Kerbosch J. Finding all cliques in an undirected graph. Comm ACM 1973; 16(9): 575–577

    Google Scholar 

  10. Kirkpatrick S, Gelatt CD, Vecchi MP. Optimisation by simulated annealing. Science 1983; 20: 671–680

    Google Scholar 

  11. Goldberg DE. Genetic Algorithms in Search Optimisation and Machine Learning. Reading, MA: Addison-Wesley, 1989

    Google Scholar 

  12. Kittler J, Hancock ER. Probabilistic relaxation. Int J Patt Recognition and Artif Intell 1989; 3(1): 29–51

    Google Scholar 

  13. Rosenfeld A, Hummel RA, Zucker SW. Scene labelling by relaxation operations. IEEE Trans SMC 1976; 6: 400–433

    Google Scholar 

  14. Hancock ER, Kittler J. Discrete relaxation. Patt Recognition 1990; 23: 711–733

    Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  20. Turner M, Austin J. Matching performance of correlation matrix memories. Neural Networks 1997; 10(a): 1637–1648

    Google Scholar 

  21. Ullman JR. An algorithm for subgraph isomorphism. J ACM 1976; 16: 31–42

    Google Scholar 

  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

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Turner, M., Austin, J. Graph matching by neural relaxation. Neural Comput & Applic 7, 238–248 (1998). https://doi.org/10.1007/BF01414885

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01414885

Keywords

Navigation