In computer vision, co-segmentation is defined as the task of jointly segmenting the common objects in a given set of images. Most proposed co-segmentation algorithms have the assumptions that the common objects are singletons or with the similar size. In addition, they might assume that the background features are simple or discriminative. This paper presents a cooperative co-segmentation without these assumptions. In the proposed cooperative co-segmentation algorithm, each image is treated as a player. By using the cooperative game, heat diffusion, and image saliency, we design a constrained utility function for each player. This constrained utility function push all players, with the instinct to maximize their self-utility, to cooperatively define the common-object labels. We then use cooperative cut to segment the common objects according to the common-object labels. Experimental results demonstrate that the proposed method outperforms the stateof- the-art co-segmentation methods in the segmentation accuracy of the common objects in the images.
CITATION STYLE
Lin, B. C., Chen, D. J., & Chang, L. W. (2015). Unsupervised image co-segmentation based on cooperative game. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9005, pp. 51–63). Springer Verlag. https://doi.org/10.1007/978-3-319-16811-1_4
Mendeley helps you to discover research relevant for your work.