
Accession Number : ADA189043
Title : On Relaxation Algorithms Based on Markov Random Fields.
Descriptive Note : Technical rept.,
Corporate Author : ROCHESTER UNIV NY DEPT OF COMPUTER SCIENCE
Personal Author(s) : Chou, Paul B ; Raman, Rajeev
PDF Url : ADA189043
Report Date : 10 Jul 1987
Pagination or Media Count : 32
Abstract : Many computer vision problems can be formulated as computing the minimum energy states of thermal dynamic systems. However, due to the complexity of the energy functions, the solutions to the minimization problem are very difficult to acquire in practice. Stochastic and deterministic methods exist to approximate the solutions, but they fail to be both efficient and robust. This paper describes a new deterministic methodthe Highest Confidence First algorithmto approximate the minimum energy solution to the image labeling problem under the Maximum A Posteriori (MAP) criterion. This method uses Markov Random Fields to model spatial prior knowledge of images and likelihood probabilities to represent external observations regarding hypotheses of image entities. Following an order decided by a dynamic stability measure, the image entities make make local estimates based on the combined knowledge of priors and observations. The solutions so constructed compare favorably to the ones produced by existing methods and that the computation is more predictable and less expensive. Keywords: Image segmentation; Bayesian approach.
Descriptors : *IMAGE PROCESSING, *MARKOV PROCESSES, *VISION, *BIONICS, ALGORITHMS, COMPUTERS, DETERMINANTS(MATHEMATICS), DYNAMICS, ESTIMATES, EXTERNAL, HYPOTHESES, IMAGES, RELAXATION, SEGMENTED, SOLUTIONS(GENERAL), STABILITY, STOCHASTIC PROCESSES, THERMAL PROPERTIES, BAYES THEOREM
Subject Categories : Bionics
Cybernetics
Distribution Statement : APPROVED FOR PUBLIC RELEASE