From co-saliency to co-segmentation: An efficient and fully unsupervised energy minimization model

219Citations
Citations of this article
106Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address two key issues of co-segmentation over multiple images. The first is whether a pure unsupervised algorithm can satisfactorily solve this problem. Without the user's guidance, segmenting the foregrounds implied by the common object is quite a challenging task, especially when substantial variations in the object's appearance, shape, and scale are allowed. The second issue concerns the efficiency if the technique can lead to practical uses. With these in mind, we establish an MRF optimization model that has an energy function with nice properties and can be shown to effectively resolve the two difficulties. Specifically, instead of relying on the user inputs, our approach introduces a co-saliency prior as the hint about possible foreground locations, and uses it to construct the MRF data terms. To complete the optimization framework, we include a novel global term that is more appropriate to co-segmentation, and results in a submodular energy function. The proposed model can thus be optimally solved by graph cuts. We demonstrate these advantages by testing our method on several benchmark datasets. © 2011 IEEE.

Cite

CITATION STYLE

APA

Chang, K. Y., Liu, T. L., & Lai, S. H. (2011). From co-saliency to co-segmentation: An efficient and fully unsupervised energy minimization model. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (pp. 2129–2136). IEEE Computer Society. https://doi.org/10.1109/CVPR.2011.5995415

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free