Mean Field Annealing Using Compound Gauss-Markov Random Fields for Edge Detection and Image Estimation

IEEE Transactions on Neural Networks

Volumn 4, Issue 4, 1993, Pages 703-709

  Zerubia, Josiane ^a   Chellappa, Rama ^b  

^a INRLA ^*  (France)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ESTIMATION; ITERATIVE METHODS; MATHEMATICAL MODELS; NUCLEAR MAGNETIC RESONANCE; PROBABILITY; STATISTICAL METHODS; STOCHASTIC CONTROL SYSTEMS; WHITE NOISE;

A POSTERIORI; ADDITIVE GAUSSIAN NOISE; COMPOUND GAUSS-MARKOV RANDOM FIELDS; DETERMINISTIC ALGORITHMS; EDGE DETECTION; IMAGE ESTIMATION; MEAN FIELD ANNEALING; NOISE FREE IMAGE;

IMAGE ANALYSIS;

EID: 0027635418     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.238324     Document Type: Article

References (32)

1. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images,” IEEE Trans. Patt. Anal. Machine Intel!., vol. PAMI-6, pp. 721–741, Nov. 1984.
2. D. Geiger and A. L. Yuille, “A common framework for image segmentation,” in Proc. ICPR, Atlantic City, NJ, June 1990, pp. 502–507.
3. F. C. Jeng and J. W, Woods, “Simulated annealing in compound Gaussian random fields,” IEEE Trans. Inform. Theory, vol. 36, pp. 94–107, Jan. 1990.
4. S. Kirkpatrick, C. Gelatt, and M. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, pp. 671–680, 1983.
5. A. Blake and A. Zisserman, Visual Reconstruction. Cambridge, MA: MIT 1987.
6. F.C. Jeng and J. W. Woods, “Compound Gauss Markov random fields for image estimation,” IEEE Trans. Signal Processing, vol. 39, pp. 683–691, Mar. 1991.
7. T. Simchony, R. Chellappa, and Z. Lichenstein, “Pyramid implementation of optimal step conjugate search algorithms for some low level vision problems,” IEEE Trans. Syst, Man, Cybern., vol. 19, pp. 1408–1425, Nov. 1989.
8. M. Plischke and B. Bergersen, Equilibrium Statistical Physics. Englewood Cliffs, NJ: Prentice-Hall, 1989.
9. C. Campbell, D. Sherington, and K. Y. M. Wong, “Statistical mechanics and neural networks,” in Neural Computing Architecture, I. Aleksander, Ed. Cambridge, MA: MIT Press, 1989, pp. 239–257.
10. G. Bilbro, W. Snyder, S. Gamier, and J. Gault, “Mean field annealing: A formalism for constructing GNC-like algorithms,” IEEE Trans. Neural Networks, vol. 3, pp. 131–138, Jan. 1992.
11. H. Hirinyannaiah, G. Bilbro, W. Snyder, and R. Mann, “Restoration of piecewise-constant images by mean field annealing,” J. Opt. Soc. Amer. A, pp. 1901–1912, Dec. 1989.
12. J. Zerubia and F. Ployette, “Parallel algorithms for low level vision on a Connection Machine (CM2),” presented at the 2nd IEEE Symp. Parallel and Distributed Processing, Dallas, TX, Dec. 1990.
13. D. Geiger and F. Girosi, “Parallel and deterministic algorithms for MRFs: Surface reconstruction and integration,” in Proc. ECCV, Antibes, France, Apr. 1990, pp. 89–98.
14. P. Herault and J. Niez, “How neural networks can solve hard graph problems: A performance study on the graph K-partitioning,” in Proc. Neuro-Nimes, Nimes, France, Nov. 1989, pp. 237–255.
15. A. L. Yuille, D. Geiger, and H. Biilthoff, “Stereo integration, mean field theory and psychophysics,” in Proc. ECCV, Antibes, France, 1990, pp. 73–82.
16. G. Bilbro, R. Mann, T. Miller, W. Snyder, D. Van den Bout, and M. White, “Optimization by mean field annealing,” in Advances in Neural Information Processing Systems, vol. 1, D. Touretzky, Ed. 1988, pp. 91–98.
17. R. Chellappa, Y.H. Hu, and S. Y. Kung, “On two-dimensional Markov spectral estimation,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 836–841, 1983.
18. G. Sharma and R. Chellappa, “A model approach for the estimation of 2-D maximum entropy power spectra,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 90–99, Jan. 1985.
19. J. W. Woods, “Two-dimensional discrete Markovian fields,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 232–240, 1972.
20. “Two-dimensional Markov spectral estimation,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 552–559, 1976.
21. R. Kindermann and J.L. Snell, Markov Random Fields and Their Applications. Providence, RI: American Mathematical Society, 1980.
22. J. Besag, “Spatial interaction and the statistical analysis of lattice systems,” J. Roy. Stat. Soc. Ser. B, vol. 36, pp. 192–236, 1974.
23. C. Koch, J. Marroquin, and A. Yuille, “Analog neural networks in early vision,” Proc. Nat. Acad. Sci., vol. B83, pp. 4263 -4267, 1987.
24. S. Liu and J. Harris, “Generalized smoothing networks in early vision,” in Proc. CVPR, San Diego, CA, June 1989, pp. 184–191.
25. J. Marroquin, “Deterministic Bayesian estimation of Markovian random fields with applications to computational vision,” in Proc. ICCV, London, U.K., June 1987, pp. 597–601.
26. J. Marroquin, S. Mitter, and T. Poggio, “Probabilistic solution of illposed problems in computational vision,” J. Amer. Stat. Ass., vol. 82, pp. 76–89, 1987.
27. A. Rangarajan and R. Chellappa, “Generalized graduated nonconvexity algorithm for maximum a posteriori image estimation,” in Proc. ICPR, Atlantic City, NJ, June 1990, pp. 127–133.
28. A. L. Yuille, “Energy functions for early vision and analog networks,” Biolog. Cybern., vol. 61, pp. 115–123, 1989.
29. A. Yullie and D. Geiger, “Statistical physics for modeling and optimization,” Harvard Robotics Lab., Tech. Report 91–2, 1991.
30. J. Zerubia and R. Chellappa, “Mean field approximation using compound Gauss-Markov random field for edge detection and image restoration,” in Proc. ICASSP, Albuquerque, NM, Apr. 1990, pp. 2193–2196.
31. D. Luenberger, Linear and Nonlinear Programming, Reading, MA: Addison Wesley, 1984.
32. J. Zerubia and D. Geiger, “Image segmentation using 4 direction line processors,” INRIA Research Report 1338, Nov. 1990.