On the Foundations of Relaxation Labeling Processes

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-5, Issue 3, 1983, Pages 267-287

  Hummel, Robert A ^a   Zucker, Steven W ^b  

^a NEW YORK UNIVERSITY   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

EID: 0020750605     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1983.4767390     Document Type: Article

References (20)

1. K. Arrow, L. Hurwicz, and K. Uzawa, Studies in Linear and Nonlinear Programming. Stanford, CA: Stanford Univ. Press, 1960.
2. M. Berthod and O. Faugeras, “Using context in the global recognition of a set of objects: An optimization approach,” in Proc. IFIP, 1980.
3. N. P. Bhatia and G. P. Szego, Dynamical Systems: Stability Theory and Applications (Lecture Notes in Mathematics), vol. 35. New York: Springer-Verlag, 1967.
4. L. Davis and A. Rosenfeld, “Cooperating processes for low-level vision: A survey,” Artificial Intell., vol. 17, p. 412, 1981.
5. O. Faugeras and M. Berthod, “Improving consistency and reducing ambiguity in stochastic labeling: An optimization approach,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, p. 245, 1981.
6. R. M. Haralick and L. Shapiro, “The consistent labeling problem: Part 1,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, p. 173, 1979.
7. G. E. Hinton, “Relaxation and its role in vision,” Ph.D. dissertation, Univ. Edinburgh, Dec. 1979.
8. D. Kinderlehrer and G. Stampacchia, An Introduction to Variational Inequalities and Their Applications. New York: Academic, 1980.
9. D. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
10. J. Mohammed, R. Hummel, and S. Zucker, “A feasible direction operator for relaxation methods,” this issue, pp. 330-332.
11. S. Peleg, “A new probabilistic relaxation scheme,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, p. 362, 1980.
12. A. Rosenfeld, R. Hummel, and S. Zucker, “Scene labeling by relaxation operations,” IEEE Trans. Syst., Man, Cybern., vol. SMC-6, p. 420, 1976.
13. R. Southwell, Relaxation Methods in Engineering Science. Clarendon, 1940.
14. S. Ullman, “Relaxation and constrained optimization by local processes,” Comput. Graphics Image Processing, vol. 10, p. 115, 1979.
15. S. Ullman, The Interpretation of Structure from Motion. Cambridge, MA: MIT Press, 1979.
16. D. Waltz, “Understanding line drawings of scenes with shadows,” in The Psychology of Computer Vision, P. Winston, Ed. New York: McGraw-Hill, 1975.
17. S. Zucker, “Labeling lines and links: An experiment in cooperating computation,” in Consistent Labeling Problems in Pattern Recognition, R. Haralick, Ed. New York: Plenum, 1980.
18. S. Zucker, R. Hummel, and A. Rosenfeld, “An application of relaxation labeling to line and curve enhancement,” IEEE Trans. Comput., vol. C-26, pp. 394-403, 922-929, 1977.
19. S. Zucker, Y. Leclerc, and J. Mohammed, “Relaxation labeling and local maxima selection: Conditions for equivalence,” IEEE Trans. Pattern Anal. Machine Intell., to be published.
20. R. B. K. Dewar et al., “Programming by refinement,” TOPLAS, vol. 1, p. 27, 1979.