Mean Field Annealing: A Formalism for Constructing GNC-Like Algorithms

IEEE Transactions on Neural Networks

Volumn 3, Issue 1, 1992, Pages 131-138

  Bilbro, Griff L ^a   Snyder, Wesley E ^b   Gault, James W ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b WAKE FOREST SCHOOL OF MEDICINE   (United States)

Author keywords

graduated nonconvexity; mean field approximation; Simulated annealing

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

MEAN FIELD ANNEALING; MINIMIZATION ALGORITHMS;

OPTIMIZATION;

EID: 0026679383     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.105426     Document Type: Article

References (16)

1. A. Blake and A. Zisserman, Visual Reconstruction. Cambridge, MA: MIT Press, 1987.
2. A. Blake, “Comparison of the efficiency of deterministic and stochastic algorithms for visual reconstruction,” IEEE Trans. Pattern Anal. Machine Intell., vol. 11, Jan. 1989.
3. H. Hiriyannaiah, G. L. Bilbro, W. E. Snyder, and R. C. Mann, “Restoration of piecewise constant images via mean field annealing,” J. Opt. Soc. Amer., A, pp. 1901–1912, Dec. 1989.
4. G. Bilbro et al., “Optimization by mean field annealing,” in Advances in Neural Information Processing Systems. San Mateo, CA: Morgan-Kauffman, 1989.
5. G. Bilbro and W. Snyder, “Mean field annealing, an application to image noise removal,” J. Neural Network Computing, fall 1990.
6. G. Bilbro and W. Snyder, “Fusion of range and reflectance image data using Markov random fields,” presented at IEEE Int. Symp. Intell. Control, Arlington, VA, Aug. 1988.
7. G. Bilbro and W. Snyder, “Mean field approximation minimizes relative entropy,” J., Opt. Soc. Amer., A, vol. 8, no. 2, Feb. 1991.
8. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and Bayesian restoration of images,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 6, no. 6, 1984.
9. G. Bilbro and W. Snyder, “Range image restoration using mean field annealing,” in Advances in Neural Network Information Processing Systems. San Mateo, CA: Morgan-Kaufman, 1989.
10. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications. Norwell, MA: D. Reidel, 1988.
11. D. E. Van den Bout and T.K. Miller, “Graph partitioning using annealed neural networks,” IEEE Trans. Neural Networks, vol. 1, pp. 192–203, 1990.
12. D. Geiger and F. Girosi, “Parallel and deterministic algorithms for MRFS: Surface reconstruction and integration,” AI Memo 1114, MIT, Cambridge, MA, 1989.
13. H. Hiriyannaiah, “Signal reconstruction using mean field annealing,” Ph.D. thesis, North Carolina State University, 1990.
14. G. Bilbro and W. Synder, “Optimization of functions with many minima,” IEEE Trans. Syst., Man, Cybern., to be published.
15. W. Snyder, G. Bilbro, A. Logenthiran, and S. Rajala, “Optimal thresholding—A new approach,” Pattern Recogn. Lett. vol. 11, no. 12, Dec. 1990.
16. C. M. Soukoulis, K. Levin, and G. S. Grest, “Irreversibility and metastability in spin-glasses. I. Ising model,” Phys. Rev. B, vol. 28, no. 3, pp. 1495–1509, Aug. 1983.