Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
The use of omnidirectional vision has increased during these past years. It provides a very large field of view. Nevertheless, omnidirectional images contain significant radial di...
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
Wonsik Kim (Seoul National University), Kyoung Mu ...