Structural Matching in Computer Vision Using Probabilistic Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 17, Issue 8, 1995, Pages 749-764

  Kittler, Josef ^a   Petrou, Maria ^a   Christmas, William J ^a  

^a UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

Matching; object recognition; probabilistic relaxation

Indexed keywords

COMPUTER VISION; FEATURE EXTRACTION; GRAPH THEORY; HEURISTIC METHODS; OBJECT RECOGNITION; PROBABILITY;

EDGE MATCHING; IMAGE MATCHING; PROBABILISTIC RELAXATION;

IMAGE SEGMENTATION;

EID: 0029358760     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.400565     Document Type: Article

References (45)

1. D.H. Ackley, G.E. Hinton, and T.J. Sejnowski, “A learning algorithm for Boltzmann machines,” Cognitive Science, vol. 9, pp. 147–169, 1985.
2. H.S. Baird, Model-Based Image Matching Using Location. MIT Press, 1985.
3. H. Ballard and M. Brown, Computer Vision. Prentice-Hall, 1982.
4. P.J. Besl and R.C. Jain, “Three-dimensional object recognition,” Computing Surveys, vol. 17, pp. 75–145, 1985.
5. J.R. Beveridge and E.M. Riseman, “Hybrid weak-perspective and full-perspective matching,” Conf. Computer Vision and Pattern Recognition, pp. 432–438, 1992.
6. B. Bhanu, “Representation and shape matching of 3-D objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 3, pp. 340–351, 1984.
7. B. Bhanu and O.D. Faugeras, “Shape matching of two-dimensional objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 137–156, 1984.
8. E. Bienenstock, “Neural-like graph-matching techniques for image processing,” D.Z. Anderson, ed., Neural Information Processing Systems, pp. 211–235, Addison-Wesley, 1988.
9. A. Blake, “The least disturbance principle and weak constraints,” Pattern Recognition Letters, vol. 1, pp. 393–399, 1983.
10. A. Blake and A. Zisserman, Visual Reconstruction. Cambridge, Mass.: MIT Press, 1987.
11. R.C. Bolles, “Robust feature matching through maximal cliques,” Proc. Soc. Photo-Optical Instrument Engineers, vol. 182, pp. 140–149, Apr. 1979.
12. K.L. Boyer and A.C. Kak, “Structural stereopsis for 3-D vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, pp. 144–166, 1988.
13. T.A. Cass, “Polynomial-time object recognition in the presence of clutter, occlusion, and uncertainty,” Second European Conf. Computer Vision, Santa Margherita Ligure, Italy, May 1992, pp. 834–842. Springer-Verlag, 1992.
14. L.S. Davis, “Shape matching using relaxation techniques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 1, pp. 60–72, Jan. 1979.
15. O.D. Faugeras and M. Berthod, “Improving consistency and reducing ambiguity in stochastic labeling: An optimization approach,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 412–423, Apr. 1981.
16. O.D. Faugeras and M. Hebert, “The representation, recognition, and locating of 3-D objects,” Int'l J. Robotics Research, vol. 5, no. 3, pp. 27–52, 1986.
17. M. Fischler and R. Elschlager, “The representation and matching of pictorial structures,” IEEE Trans. on Computers, vol. 22, pp. 67–92, 1973.
18. D. Geiger and F. Girosi, “Parallel and deterministic algorithms from MRF's: Surface reconstruction,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 5, pp. 401–412, May 1991.
19. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721–741, 1984.
20. D.E. Gharhaman, A.K.C. Wong, and T. Au, “Graph optimal monomorphism algorithms,” IEEE Trans. Systems, Man, and Cybernetics, vol. 10, no. 4, pp. 181–188, Apr. 1980.
21. B. Gidas, “A renormalization group approach to image processing problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 164–180, 1989.
22. W.E.L. Grimson and T. Lozano-Perez, “Localizing overlapping parts by searching the interpretation tree,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, pp. 469–482, 1987.
23. E.R. Hancock and J. Kittler, “Edge labeling using dictionary-based relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, pp. 165–181, 1990.
24. J.J. Hopfield, “Neurons with graded response have collective computational properties like those of two-state neurons,” Proc. National Academy of Science, USA, vol. 81, pp. 3,088–3,092, 1984.
25. R.A. Hummel and S.W. Zucker, “On the foundations of relaxation labeling process,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 3, pp. 267–286, May 1983.
26. R.L. Kirby, “A product rule relaxation method,” CGIP, vol. 13, pp. 158–189, 1980.
27. S. Kirkpatrick, C.D. Gellatt, and M.P. Vecchi, “Optimisation by simulated annealing,” Science, vol. 220, pp. 671–680, 1983.
28. J. Kittler and J. Föglein, “On compatibility and support functions in probabilistic relaxation,” CVGIP, vol. 34, pp. 257–267, 1986.
29. J. Kittler and E.R. Hancock, “Combining evidence in probabilistic relaxation,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 3, pp. 29–51, 1989.
30. C. Koch, J. Marroquin, and A. Yuille, “Analog ‘neuronal’ networks in early vision,” Proc. National Academy of Science, USA, vol. 83, pp. 4,263–4,267, 1986.
31. S.Z. Li, “Matching: invariant to translations, rotations and scale changes,” Pattern Recognition, vol. 25, pp. 583–594, 1992.
32. S.Z. Li, J. Kittler, and M. Petrou, “On the automatic registration of aerial photographs and digitised maps,” Optical Engineering, vol. 32, no. 6, pp. 1,213–1,221, June 1993.
33. S. Peleg, “A new probabilistic relaxation scheme,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 2, pp. 362–369, 1980.
34. M. Petrou, “Optimal convolution filters and an algorithm for the detection of wide linear features,” IEEE Proc.-I, vol. 140, no. 5, pp. 331–339, Oct. 1993.
35. B. Radig, “Image sequence analysis using relational structures,” Pattern Recognition, vol. 17, pp. 161–167, 1984.
36. A. Rosenfeld, R. Hummel, and S. Zucker, “Scene labeling by relaxation operations,” IEEE Trans. Systems, Man, and Cybernetics, vol. 6, pp. 420–433, June 1976.
37. L.G. Shapiro and R.M. Haralick, “Structural description and inexact matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 504–519, Sept. 1981.
38. F. Stein and G. Medioni, “Structural indexing: Efficient 3-D object recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, pp. 125–145, 1992.
39. S. Ullman, “Relaxation and constraint optimization by local process,” Computer Graphics and Image Processing, vol. 10, pp. 115–195, 1979.
40. N.M. Vaidya and K.L. Boyer, “Stereopsis and image registration from extended range features in the absence of camera pose information,” Conf. Computer Vision and Pattern Recognition, pp. 76, 82.
41. W.M. Wells, “MAP model matching,” Conf. Computer Vision and Pattern Recognition, pp. 486–492, 1991.
42. A. Witkin, D. Terzopoulos, and M. Kass, “Signal matching through scale space,” Int'l J. Computer Vision, vol. 1, pp. 133–144, 1987.
43. K. Yamamoto, “A method of deriving compatibility coefficients for relaxation operators,” Computer Graphics and Image Processing, vol. 10, pp. 256–271, 1979.
44. B. Yang, W.E. Snyder, and G.L. Bilbro, “Matching oversegmented 3-D images to models using association graphs,” Image and Vision Computing, vol. 7, pp. 135–143, 1989.
45. S. Zucker and J. Mohammed, “Analysis of probabilistic labeling process,” IEEE PRIP Conf., Chicago, USA, pp. 167–173, 1978.