TY - GEN
T1 - Space-varying color distributions for interactive multiregion segmentation
T2 - 8th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, EMMCVPR 2011
AU - Nieuwenhuis, Claudia
AU - Töppe, Eno
AU - Cremers, Daniel
PY - 2011
Y1 - 2011
N2 - State-of-the-art approaches in interactive image segmentation often fail for objects exhibiting complex color variability, similar colors or difficult lighting conditions. The reason is that they treat the given user information as independent and identically distributed in the input space yielding a single color distribution per region. Due to their strong overlap segmentation often fails. By statistically taking into account the local distribution of the scribbles we obtain spatially varying color distributions, which are locally separable and allow for weaker regularization assumptions. Starting from a Bayesian formulation for image segmentation, we derive a variational framework for multi-region segmentation, which incorporates spatially adaptive probability density functions. Minimization is done by three different optimization methods from the MRF and PDE community. We discuss advantages and drawbacks of respective algorithms and compare them experimentally in terms of segmentation accuracy, quantitative performance on the Graz benchmark and speed.
AB - State-of-the-art approaches in interactive image segmentation often fail for objects exhibiting complex color variability, similar colors or difficult lighting conditions. The reason is that they treat the given user information as independent and identically distributed in the input space yielding a single color distribution per region. Due to their strong overlap segmentation often fails. By statistically taking into account the local distribution of the scribbles we obtain spatially varying color distributions, which are locally separable and allow for weaker regularization assumptions. Starting from a Bayesian formulation for image segmentation, we derive a variational framework for multi-region segmentation, which incorporates spatially adaptive probability density functions. Minimization is done by three different optimization methods from the MRF and PDE community. We discuss advantages and drawbacks of respective algorithms and compare them experimentally in terms of segmentation accuracy, quantitative performance on the Graz benchmark and speed.
UR - http://www.scopus.com/inward/record.url?scp=80051739240&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-23094-3_13
DO - 10.1007/978-3-642-23094-3_13
M3 - Conference contribution
AN - SCOPUS:80051739240
SN - 9783642230936
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 177
EP - 190
BT - Energy Minimazation Methods in Computer Vision and Pattern Recognition - 8th International Conference, EMMCVPR 2011, Proceedings
Y2 - 25 July 2011 through 27 July 2011
ER -