Bayesian image classification using Markov random fields

Image and Vision Computing

Volumn 14, Issue 4, 1996, Pages 285-295

  Berthod, Marc ^a   Kato, Zoltan ^a   Yu, Shan ^a   Zerubia, Josiane ^a  

^a INRIA   (France)

Author keywords

Bayesian image classification; Markov random fields; Optimisation

Indexed keywords

ALGORITHMS; ANNEALING; COMPUTER VISION; CONSTRAINT THEORY; DECISION THEORY; DYNAMICS; GAME THEORY; ITERATIVE METHODS; LABELING; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

BAYESIAN IMAGE CLASSIFICATION; DETERMINISTIC PSEUDO ANNEALING; GAME STRATEGY APPROACH; GIBBS SAMPLER; ITERATED CONDITIONAL MODE; MARKOV RANDOM FIELDS; METROPOLIS ALGORITHM; MODIFIED METROPOLIS DYNAMICS; NASH EQUILIBRIUM POINTS;

IMAGE PROCESSING;

EID: 0030148684     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/0262-8856(95)01072-6     Document Type: Article

References (29)

1. S. Geman and D. Geman, Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images, IEEE Trans. Patt. Analysis and Mach. Intel. 6 (1984) 721-741.
2. R. Azencott, Markov fields and image analysis, Proc. AFCET. Antibes, France, 1987.
3. J. Besag, On the statistical analysis of dirty pictures, J. Roy. Statis. Soc. B., 68 (1986) 259-302.
4. F.C. Jeng and J.M. Woods, Compound Gauss-Markov Random Fields for image estimation, IEEE Trans. Acoust., Speech and Signal Proc., 39 (1991) 638-697.
5. A. Blake and A. Zisserman, Visual Reconstruction, MIT Press, Cambridge, MA. 1987.
6. A. Rangarajan and R. Chellappa, Generalised graduated non-convexity algorithm for maximum a posteriori image estimation, Proc. ICPR, June 1990, pp. 127-133.
7. D. Geiger and F. Girosi, Parallel and deterministic algorithms for MRFs: surface reconstruction and integration, Proc. ECCV90, Antibes, France, 1990. pp. 89-98.
8. J. Zerubia and R. Chellappa. Mean field approximation using compound Gauss-Markov random field for edge detection and image restoration, Proc. ICASSP, Albuquerque, NM, 1990.
9. P.V. Laarhoven and E. Aarts, Simulated Annealing: Theory and applications, Reidel, Dordrecht, Holland, 1987.
10. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculations by fast computing machines, J. Chem. Physics, 21 (1953) 1087-1092.
11. H. Derin, H. Elliott, R. Cristi and D. Geman, Bayes smoothing algorithms for segmentation of binary images modeled by markov random fields, IEEE Trans. Patt. Analysis and Mach. Intel., 6 (1984).
12. O. Faugeras and M. Berthod, Improving consistency and reducing ambiguity in stochastic labeling: an optimization approach, IEEE Trans. Patt. Analysis and Mach. Intel., 4 (1981) 412-423.
13. R. Hummel and S. Zucker, On the foundations of relaxation labeling processes, IEEE Trans. Patt. Analysis and Mach. Intel., 5(3) (1983) 267-287.
14. R.H.A. Rosenfeld and S.W. Zucker, Scene labeling by relaxation operation, IEEE Trans. Systems, Man and Cybernetics, 6(6) (1984) 420-433.
15. H.I. Bozma and J.S. Duncan, Integration of vision modules: a game-theoretic approach, Proc. Int. Conf. Computer Vision and Pattern Recognition, Maui, HI. 1991, pp. 501-507.
16. H.I. Bozma and J.S. Duncan, Modular system for image analysis using a game-theoretic framework, Image & Vision Computing, 10(6) (1992) 431-443.
17. D.A. Miller and S.W. Zucker, Copositive-plus Lemke algorithm solves polymatrix games. Oper. Res. Letters, 10 (1991) 285-290.
18. D.A. Miller and S.W. Zucker, Efficient simplex-like methods for equilibria of nonsymmetric analog networks, Neural Computation, 4 (1992) 167-190.
19. T. Basar and G.J. Olsder. Dynamic Noncooperative Game Theory, Academic Press, New York, 1982.
20. M. Berthod, L'amélioration d'étiquetage: une approche pour l'utilisation du contexte en reconnaissance des formes. Thèse d'état, Université de Paris VI, December 1980.
21. M. Berthod, Definition of a consistent labeling as a global extremum. Proc. ICPR6, Munich, Germany 1982, pp. 339-341.
22. J.E. Besag, Spatial interaction and the statistical analysis of lattice systems (with discussion), J. Roy. Statis. Soc. B, 36 (1974) 192-236.
23. A. -Berman and R. Plemmons, Non-negative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
24. p constraints. Technical report, INRIA, France, 1995.
25. S. Yu and M. Berthod, A game strategy approach to relaxation labeling, Computer Vision and Image Understanding, 61(1) (January 1995) 32-37.
26. J.F. Nash, Equilibrium points in n-person games, Proc. Nat. Acad. Sci. USA, 36 (1950) 48-49.
27. Z. Kato, Modélisation Markovienne en classification d'image mise en oeuvre d'algorithmes de relaxation, Rapport de stage de DEA, Université de Nice, 1991.
28. W.D. Hillis, The Connection Machine. MIT Press, Cambridge, MA, 1985.
29. J. Little, G. Belloch and T. Cass, Algorithmic techniques for computer vision on a fine-grain parallel machine, IEEE Trans. Patt. Analysis and Mach. Intel. 11 (1989) 244-257.