Theory for Variational Area-Based Segmentation Using Non-Quadratic Penalty Functions
Abstract
In this paper a theory is developed for variational segmentation of images using area-based segmentation functionals with non-quadratic penalty functions in the fidelity term. Two small theorems, which we believe are new to the vision community, allow us to compute the Gateaux derivative of the considered functional, and to construct the corresponding gradient descent flow. The functional is minimized by evolving an initial curve using this gradient descent flow. If the penalty function is sub-quadratic, i.e. behaves like the p'th power of the error for p<2, the obtained segmentation model is more robust with respect to noise and outliers than the classical Chan-Vese model and the curve evolution has better convergence properties.
Cite
Text
Karlsson and Overgaard. "Theory for Variational Area-Based Segmentation Using Non-Quadratic Penalty Functions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005. doi:10.1109/CVPR.2005.344Markdown
[Karlsson and Overgaard. "Theory for Variational Area-Based Segmentation Using Non-Quadratic Penalty Functions." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005.](https://mlanthology.org/cvpr/2005/karlsson2005cvpr-theory/) doi:10.1109/CVPR.2005.344BibTeX
@inproceedings{karlsson2005cvpr-theory,
title = {{Theory for Variational Area-Based Segmentation Using Non-Quadratic Penalty Functions}},
author = {Karlsson, Adam and Overgaard, Niels Chr.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2005},
pages = {1089-1096},
doi = {10.1109/CVPR.2005.344},
url = {https://mlanthology.org/cvpr/2005/karlsson2005cvpr-theory/}
}