Nonparametric Higher-Order Learning
for Interactive Segmentation



In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulation additionally imposing the soft label consistency constraint whereby the pixels in the regions, generated by unsupervised image segmentation algorithms, tend to have the same label. In contrast with previous works which focus on the parametric model of the higher-order cliques for adding this soft constraint, we address a nonparametric learning technique to recursively estimate the region likelihoods as higher-order cues from the resulting likelihoods of pixels included in the regions. Therefore the main idea of our algorithm is to design two quadratic cost functions of pixel and region likelihoods, that are supplementary to each other, in a proposed multi-layer graph and to estimate them simultaneously by a simple optimization technique. In this manner, we consider long-range connections between the regions that facilitate propagation of local grouping cues across larger image areas. The experiments on challenging data sets show that integration of higher-order cues quantitatively and qualitatively improves the segmentation results with detailed boundaries and reduces sensitivity with respect to seed quantity and placement.


paper thumbnail


CVPR 2010 paper. (pdf, 2.67MB), [Supplement]. (pdf, 15.91MB)


Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee. Nonparametric Higher-Order Learning for Interactive Segmentation, Proc. Computer Vision and Pattern Recognition (CVPR), 2010


code. (zip, 1.30MB) dataset. (zip, 24.1MB)


This research is supported in part by: