Sequential Convex Relaxation for Mutual Information-Based Unsupervised Figure-Ground Segmentation

Youngwook Kee, Mohamed Souiai, Daniel Cremers, Junmo Kim; Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 4082-4089

Abstract


We propose an optimization algorithm for mutual-information-based unsupervised figure-ground separation. The algorithm jointly estimates the color distributions of the foreground and background, and separates them based on their mutual information with geometric regularity. To this end, we revisit the notion of mutual information and reformulate it in terms of the photometric variable and the indicator function; and propose a sequential convex optimization strategy for solving the nonconvex optimization problem that arises. By minimizing a sequence of convex sub-problems for the mutual-information-based nonconvex energy, we efficiently attain high quality solutions for challenging unsupervised figure-ground segmentation problems. We demonstrate the capacity of our approach in numerous experiments that show convincing fully unsupervised figure-ground separation, in terms of both segmentation quality and robustness to initialization.

Related Material


[pdf]
[bibtex]
@InProceedings{Kee_2014_CVPR,
author = {Kee, Youngwook and Souiai, Mohamed and Cremers, Daniel and Kim, Junmo},
title = {Sequential Convex Relaxation for Mutual Information-Based Unsupervised Figure-Ground Segmentation},
booktitle = {Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2014}
}