<title>Variational versus Markov random field methods for image segmentation</title>
Lists
Only you see this
Abstract
Variational and Markov random field (MRF) methods have been proposed for a number of tasks in image processing and early vision. Continuous (variational) formulations have the advantages of being more amenable to analysis and more easily incorporating geometric constraints and invariants. However, discrete (MRF) formulations have computational advantages and are typically used in implementing such methods. Certain commonly used MRF models for image segmentation do not properly approximate a standard continuous formulation in the sense that the discrete solutions may not converge to a solution of the continuous problem as the lattice spacing tends to zero. We propose several modifications of the MRF formulations for which we prove convergence in the continuum limit. Although these MRF models require complex neighborhood structures, we discuss results that indicate that for MRF models with bounded number of states, the difficulties are inherent and cannot be avoided in any scheme with the desired convergence properties.
BibTeX
@inproceedings{kulkarni1994lt,
author = {Sanjeev R. Kulkarni and Sanjoy K. Mitter},
title = {{\<title\>Variational versus Markov random field methods for image segmentation\</title\>}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {1994},
doi = {10.1117/12.179231},
}Loading related content...