Visual reconstruction
Simulated annealing & boltzmann Machines: a stochastic approach to combinatorialoptimization & neural computing
Toward 3D vision from range images: an optimization framework and parallel networks
CVGIP: Image Understanding
Geometric invariance in computer vision
Geometric invariance in computer vision
Markov random field modeling in computer vision
Markov random field modeling in computer vision
Relaxation labeling using Lagrange-Hopfield method
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1
Edge Based Probabilistic Relaxation for Sub-pixel Contour Extraction
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Stereo for Image-Based Rendering using Image Over-Segmentation
International Journal of Computer Vision
Cascade Markov random fields for stroke extraction of Chinese characters
Information Sciences: an International Journal
| Hi-index | 0.00 |
Recently, there has been increasing interest in Markovrandom field (MRF) modeling for solving a variety of computer visionproblems formulated in terms of the maximum a posteriori(MAP) probability. When the label set is discrete, such as in imagesegmentation and matching, the minimization is combinatorial. Theobjective of this paper is twofold: Firstly, we propose to use thecontinuous relaxation labeling (RL) as an alternative approach forthe minimization. The motivation is that it provides a goodcompromise between the solution quality and the computational cost.We show how the original combinatorial optimization can be convertedinto a form suitable for continuous RL. Secondly, we compare variousminimization algorithms, namely, the RL algorithms proposed byRosenfeld et al., and by Hummel and Zucker, the mean field annealing ofPeterson and Soderberg, simulated annealing of Kirkpatrick, theiterative conditional modes (ICM) of Besag and an annealing versionof ICM proposed in this paper. The comparisons are in terms of theminimized energy value (i.e., the solution quality), the requirednumber of iterations (i.e., the computational cost), and also thedependence of each algorithm on heuristics.