Decision Making in Context

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-5, Issue 4, 1983, Pages 417-428

  Haralick, Robert M ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Artificial intelligence; context; decision theory; pattern recognition; probabilistic relaxation; Viterbi

Indexed keywords

DECISION THEORY AND ANALYSIS;

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

References (32)

1. M. Askar and H. Derin, “A recursive algorithm for the Bayes solution of the smoothing problem,” IEEE Trans. Automat. Contr., vol. AC-26, pp. 558-561, Apr. 1981.
2. W. W. Bledsoe and I. Browning, “Pattern recognition and reading by machine,” in Proc. Eastern Joint Comput. Conf., 1959, vol. 16, pp. 225-232.
3. R. Bellman and S. Dreyfus, Applied Dynamics Programming. Princeton, NJ: Princeton Univ. Press, 1963.
4. C. K. Chow, “A recognition method using neighbor dependence,” IEEE Trans. Comput., vol. C-11, pp. 683-690, 1962.
5. R. Duda and P. Hart, “Experiments in the recognition of hand-printed text: Part II–Context analysis,” in Proc. AFIPS Conf., 1968, vol. 33, pp. 1139-1149.
6. L. D. Erman, F. Hayes Roth, V. Lesser, and R. Reddy, “The hearsay II speech-understanding system: Integrating knowledge to resolve uncertainty,” Comput. Surv., vol. 12, pp. 213-253, June 1980.
7. J. A. Feldman and Y. Yakimovsky, “Decision theory and artificial intelligence: I. A semantics-based region analyze,” Art. Intell., vol. 5, pp. 349-371, 1974.
8. G. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 6, pp. 268-278, 1973.
9. K. S. Fu, “Recent developments in pattern recognition,” IEEE Trans. Comput., vol. C-29, pp. 845-854, Oct. 1980.
10. A. R. Hanson, E. M. Riseman, and E. Fisher, “Context in word recognition,” Pattern Recog., vol. 8, pp. 35-46, Jan. 1976.
11. R. M. Haralick, J. C. Mohammed, and S. W. Zucker, “Compatibilities and the fixed points of arithmetic relaxation processes,” Comput. Graphics Image Processing, vol. 13, pp. 242-256, 1980.
12. R. M. Haralick and L. Watson, “A facet model for image data,” Comput. Graphics Image Processing, vol. 15, pp. 113-129, 1981.
13. L. N. Kanal, “Problem solving models and search strategies for pattern recognition,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, no. 2, pp. 192-201, 1979.
14. F. Lehan, personal communication, 1980.
15. B. T. Lowerre and R. Reddy, “The HARPY speech understanding system,” Trends in Speech Understanding, Lea, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1980.
16. M. Nagao and T. Matsuyama, “Edge preserving smoothing,” Comput. Graphics Image Processing, vol. 9, pp. 394-407, 1979.
17. G. Nagy, “State of the art in pattern recognition,” Proc. IEEE, vol. 56, pp. 836-854, May 1968.
18. S. Peleg, “A new probabilistic relaxation scheme,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-2, pp. 362-369, July 1980.
19. J. Raviv, “Decision making in Markov chains applied to the problem of pattern recognition,” IEEE Trans. Inform. Theory, vol. IT-3, pp. 536-551, Oct. 1962.
20. E. M. Riseman and R. W. Ehrich, “Contextual word recognition using binary digrams,” IEEE Trans. Comput., vol. C-20, pp. 397-403, Apr. 1971.
21. A. Rosenfeld, R. Hummel, and S. W. Zucker, “Scene labeling by relaxation operation,” IEEE Trans. Syst., Man, Cybern., vol. SMC-6, pp. 420-433, 1976.
22. S. M. Rubin and R. Reddy, “The locus models of search and its use in image interpretation,” in Proc. Int. Joint. Conf. Art. Intell., 1977, pp. 590-595.
23. R. Shinghal, D. Roseberg, and G. T. Toussaint, “A simplified heuristic version of a recursive bayes algorithm for using contest in test recognition,” IEEE Trans. Syst., Man, Cybern., vol. SMC-8, pp. 412-414, May 1978.
24. G. Stockman, L. Kanal, and M. Kyle, “Structural pattern recognition of caratid pulse waves using a general waveform parsing system,” Commun. Ass. Comput. Mach., vol. 19, pp. 688-695, Dec. 1976.
25. J. M. Tenenbaum and H. G. Barrow, “Experiments in interpretation guided segmentation,” Art. Intell., vol. 8, pp. 241-274, 1977.
26. F. Tomita and S. Tsuji, “Extraction of multiple regions by smoothing in selected neighborhoods,” IEEE Trans. Syst., Man., Cybern., vol. SMC-7, pp. 107-109, Feb. 1977.
27. G. T. Toussaint, “The use of context in pattern recognition,” Pattern Recog., vol. 10, no. 3, pp. 189-204, 1978.
28. D. Waltz, “Generating semantic descriptions from drawings of scenes with shadows,” Artifical Intelligence Lab., Mass. Inst. Technol., Cambridge, MA, Rep. AI TR-271, 1972.
29. S. W. Zucker, E. V. Krishnamurthy, and R. L. Haar, “Relaxation processes for scene labeling: Convergence, speed, and stability,” IEEE Trans. Syst., Man, Cybern., vol. SMC-8, pp. 41-48, 1978.
30. S. W. Zucker and J. L. Mohammed, “Analysis of probabilistic relaxation labeling processes,” presented at the Pattern Recognition and Image Processing Conf., Chicago, IL, June 1978.
31. R. M. Haralick and L. G. Shapiro, “The consistent labeling problem I,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 178-184, 1979.
32. R. M. Haralick and L. G. Shapiro, “Structured descriptions and inexact matching,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, pp. 504-519, 1981.