Lagrangian-based methods for finding MAP solutions for MRF models

IEEE Transactions on Image Processing

Volumn 9, Issue 3, 2000, Pages 469-479

  Storvik, Geir ^a   Dahl, Geir ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE ANALYSIS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS; SPURIOUS SIGNAL NOISE;

INTEGER LINEAR PROGRAMMING; LAGRANGE RELAXATION; MAXIMUM A POSTERIORI (MAP) SOLUTIONS;

IMAGE SEGMENTATION;

EID: 0033900568     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/83.826783     Document Type: Article

References (17)

1. J. Besag, "Spatial interaction and the statistical analysis of lattice systems," J. R. Stat. Soc., vol. 36, pp. 192-236, 1974.
2. _, "On the statistical analysis of dirty pictures," J. R. Stat. Soc. B, vol. 48, no. 3, pp. 259-302, 1986.
3. S. Geman and D. Geman, "Stochastic relaxation, Gibbs distribution, and Bayesian restoration of images," IEEE Trans. Pattern Anal. Machine Intell., vol. 6, no. 6, pp. 721-741, 1984.
4. W. Qian and D. M. Titterington, "On the use of Gibbs Markov chain models in the analysis of images based on second-order pairwise interactive distributions," J. Appl. Stat., vol. 16, no. 2, pp. 267-281, 1989.
5. M. Hum and C. Jennison, "A study of simulated annealing and revised cascade algorithm for image reconstruction," Stat. Comput., vol. 5, pp. 175-190, 1995.
6. R. H. Swendsen and J.-S. Wang, "Nonuniversal critical dynamics in Monte Carlo simulations," Phys. Rev. Lett., vol. 58, pp. 86-88, 1987.
7. D. M. Greig, B. T. Porteous, and A. H. Seheult, "Exact maximum a posterior estimation for binary images," J. R. Stat. Soc. B, vol. 51, pp. 271-279, 1989.
8. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
9. P. A. Ferrari, A. Frigessi, and P. Gonzaga De SÁ, "Fast approximative maximum a posteriori restoration of multicolor images," J. R. Stat. Soc. B, vol. 57, no. 3, pp. 485-500, 1995.
10. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Opimization, New York: Wiley, 1988.
11. M. Garey and D. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
12. K. Holmberg, personal communication, 1996.
13. A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimal decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, no. 3, pp. 260-269, 1967.
14. K. O. Jörnsten and M. Näsberg, "A new Lagrangian relaxation approach to the generalized assignment problem," Eur. J. Oper. Res., vol. 27, pp. 313-323, 1986.
15. A. J. Gray, "Contribution: Meeting on MCMC methods," J. R. Stat. Soc. B, vol. 55, pp. 58-61, 1993.
16. A. H. S. Solberg and A. K. Jain, "Feature selection applied to SAR imagery," IEEE Trans. Geosci. Remote Sensing, to be published.
17. R. T. Frankot and R. Chellappa, "Lognormal random-field models and their applications to radar image synthesis," IEEE Trans. Geosci. Remote Sensing, vol. GE-25, pp. 195-206, 1987.