Maximum-Likelihood Parameter Estimation for Unsupervised Stochastic Model-Based Image Segmentation

IEEE Transactions on Image Processing

Volumn 3, Issue 4, 1994, Pages 404-420

  Zhang, Jun ^a   Modestino, James W ^b   Langan, David A ^c  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c GENERAL ELECTRIC COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PROCESSING; DECISION THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; MONTE CARLO METHODS; PARAMETER ESTIMATION; RANDOM PROCESSES;

BESAG'S ITERATED CONDITIONAL MODE; EXPECTATION MAXIMIZATION ALGORITHM; HARD DECISION; IMAGE SEGMENTATION; MARKOV RANDOM MODELING; MAXIMUM LIKELIHOOD PARAMETER ESTIMATION; REAL IMAGES; SOFT DECISION; SYNTHETIC IMAGES; UNSUPERVISED STOCHASTIC MODEL;

IMAGE PROCESSING;

EID: 0028466714     PISSN: 10577149     EISSN: 19410042     Source Type: Journal    
DOI: 10.1109/83.298395     Document Type: Article

References (27)

1. J. W. Modestino, R. W. Fries, and A. L. Vickers, “Texture discrimination based upon an assumed stochastic texture model,” IEEE Trans. Patt. Anal. Machine Intel!., vol. PAMI-3, pp. 557–580, Sept. 1981.
2. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images,” IEEE Trans. Patt. Anal. Machine In tell., vol. PAMI-6, pp. 721–741, Nov. 1984.
3. C. W. Therrien, T. F. Quatieri, and D. E. Dudgeon, “Statistical model-based algorithms for image analysis,” Proc. IEEE, vol. 74, Apr. 1986.
4. H. Derin and H. Elliot, “Modeling and segmentation of noisy and textured images using Gibbs random fields,” IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-9, pp. 39–55, Jan. 1987.
5. J. Besag, “On the statistical analysis of dirty pictures,” J. Royal Stat. Soc. B., vol. 48, pp. 259–302, 1986.
6. J. Zhang, “Two-dimensional stochastic model-based image analysis,” Ph.D. Thesis, Rensselaer Polytech. Inst., Troy, NY. Aug. 1988.
7. J. Marroquin, S. Mitter, and T. Poggio, “Computer vision,” J. Amer. Stat. Assoc., vol. 82, pp. 76–89, Mar. 1987.
8. F. S. Cohen and D. B. Cooper, “Simple, parallel, hierarchical and relaxation algorithms for segmenting non-casual Markovian random field models,” IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-9, pp. 195–219, Mar. 1987.
9. J. F. Silverman and D. B. Cooper, “Bayesian clustering for unsupervised estimation of surface and texture models,” IEEE Trans. Patt. Anal. Machine Intell., vol. 10, pp. 482–495, July 1988.
10. T. N. Pappas and N. S. Jayant, “An adaptive clustering algorithm for image segmentation,” in Proc. ICASSP’89, Glasgow, May 1988, pp. 1667–1670.
11. P. A. Kelly, H. Derin, and K. D. Hart, “Adaptive segmentation of speckled images using a hierarchical random field model,” IEEE Trans. Acoust. Speech Signal Processing, vol. 36, pp. 1628–1641, Oct. 1988.
12. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. Roy. Soc. Statist., Series B., no. 1, pp. 1–38, 1977.
13. M. I. Miller and D. L. Snyder, “The role of likelihood and entropy in incomplete-data problems: Applications to estimating point-process intensities and Toeplitz constrained covariances,” Proc. IEEE, vol. 75, pp. 892–907, July 1987.
14. D. M. Titterington, A. F. M. Smith, and U. E. Makov, Statistical Analysis of Finite Mixture Distributions. New York: Wiley, 1985.
15. R. A. Redner and H. F. Walker, “Mixture densities, maximum-likelihood and the EM algorithm,” SIAM Rev., vol. 26, pp. 195–239, 1984.
16. A. Papoulis, Probability, Random Variables, and Stochastic Processes. New York: McGraw-Hill, 1984.
17. J. Zhang, “A maximum-likelihood approach to cluster validation,” TR. EE and CS Dept., Univ. of Wisconsin-Milwaukee, July 1989.
18. L. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains,” Ann. Math. Stat., vol. 41, no. 1, pp. 164–171, 1970.
19. J. Zhang and J. W. Modestino, “A statistical model-fitting approach to cluster validation with applications to image segmentation,” IEEE Trans. Patt. Anal. Machine Intell., vol. 12, pp. 1009–1017, Oct. 1990.
20. S. M. Kay, Modern Spectral Estimation, Theory and Application. Englewood Cliffs, NJ: Prentice Hall, 1988.
21. S. L. Marple, Jr., Digital Spectral Analysis with Applications. Englewood Cliffs, NJ: Prentice Hall, 1987.
22. G. R. Cross and A. K. Jain, “Markov Random Field Texture Models,” IEEE Trans. Patt. Anal Machine Intell., vol. PAMI-5, no. 1, Jan 1983.
23. J. Zhang and J. W. Modestino, “The mean-field theory in EM procedures for Markov random fields,” in Proc. IEEE 1991 Int. Symp. Inform. Theory, (Budapest, Hungary), June 1991.
24. T. N. Pappas, “An adaptive clustering algorithm for image segmentation,” IEEE Trans. Signal Processing, vol. SP-40, pp. 901–914, Apr. 1992.
25. D. A. Langan, “Application of the EM algorithm to unsupervised image segmentation and validation,” Ph.D. Thesis, ECSE Dept., Rensselaer Polytech. Inst., Troy, NY, Aug. 1993.
26. J. Zhang, J. W. Modestino, and D. A. Langan, “The application of information-theoretic criteria to unsupervised stochastic model-based image segmentation,” to appear in Minimum Description Length Applications to Image Processing. (W. Niblack, Ed.) New York: Academic; to be published in Proc. IEEE Int. Conf. Image Processing (ICIP-94), Austin, TX, Nov. 1994.
27. D. A. Langan, K. S. Molnar, J. W. Modestino, and J. Zhang, “Use of the mean-field approximation in an EM-based approach to unsupervised stochastic model-based image segmentation,” in Proc. IEEE ICASSP’92 (San Francisco, CA), Mar. 1992, pp. 57–60, vol. III.