Discrete Models for Energy-Minimizing Segmentation
Abstract
The image segmentation problem may be considered as the search for a way to subdivide an image domain into regions which represent the projection of visible parts of objects in a real scene. The authors analyze the problem of image segmentation in the framework of the approximation theory as defined by D. Mumford and J. Shah (1988). They show that for real images the problem of the choice of the energy functional is dictated by the model of the world, and they propose a method to optimize it based on a deterministic algorithm processed at multiple levels of resolution. Problems encountered in dealing with real scenes lead to several modifications of the algorithm and the energy functional. Images are shown on which the algorithm was tested.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Ackah-Miezan and Gagalowicz. "Discrete Models for Energy-Minimizing Segmentation." IEEE/CVF International Conference on Computer Vision, 1993. doi:10.1109/ICCV.1993.378219Markdown
[Ackah-Miezan and Gagalowicz. "Discrete Models for Energy-Minimizing Segmentation." IEEE/CVF International Conference on Computer Vision, 1993.](https://mlanthology.org/iccv/1993/ackahmiezan1993iccv-discrete/) doi:10.1109/ICCV.1993.378219BibTeX
@inproceedings{ackahmiezan1993iccv-discrete,
title = {{Discrete Models for Energy-Minimizing Segmentation}},
author = {Ackah-Miezan, Andrew and Gagalowicz, André},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1993},
pages = {200-207},
doi = {10.1109/ICCV.1993.378219},
url = {https://mlanthology.org/iccv/1993/ackahmiezan1993iccv-discrete/}
}