2010
DOI: 10.1007/978-3-642-15552-9_34
|View full text |Cite
|
Sign up to set email alerts
|

Cosegmentation Revisited: Models and Optimization

Abstract: Abstract. The problem of cosegmentation consists of segmenting the same object (or objects of the same class) in two or more distinct images. Recently a number of different models have been proposed for this problem. However, no comparison of such models and corresponding optimization techniques has been done so far. We analyze three existing models: the L1 norm model of Rother et al. [1], the L2 norm model of Mukherjee et al. [2] and the "reward" model of Hochbaum and Singh [3]. We also study a new model, whi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
123
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 112 publications
(124 citation statements)
references
References 19 publications
1
123
0
Order By: Relevance
“…8 break the submodular properties of the energy. However, this model can be solved by Dual Decomposition (DD) techniques, recently proposed for enforcing similar histogram matching constraints between foreground regions in the context of cosegmentation [23]. As above, we begin by performing a single human/non-human segmentation across all frames, and for each frame individually run α-expansion using the energy of model 1.…”
Section: Training and Inferencementioning
confidence: 99%
See 1 more Smart Citation
“…8 break the submodular properties of the energy. However, this model can be solved by Dual Decomposition (DD) techniques, recently proposed for enforcing similar histogram matching constraints between foreground regions in the context of cosegmentation [23]. As above, we begin by performing a single human/non-human segmentation across all frames, and for each frame individually run α-expansion using the energy of model 1.…”
Section: Training and Inferencementioning
confidence: 99%
“…10. This can be efficiently optimized by a subgradient method using the techniques of [23], where each step involves solving a submodular graphcut. A solution to the primal is not guaranteed by solving the dual (but can be recognized if the duality gap is closed).…”
Section: Training and Inferencementioning
confidence: 99%
“…In other related works, the cosegmentation approach has also been performed across image sequences [7,15]. Slightly different variations to the MRF/graph cut [5] formulations and classification framework have been proposed to perform cosegmentation or object detection [23,6,8] where the only constraint is that the objects in the foreground are similar. Moving away from completely unsupervised methods, others have improved classification rates by incorporating an element of object training [24,12] or interaction [2].…”
Section: Background and Related Workmentioning
confidence: 99%
“…However, the cosegmentation problem encompasses a large range of variability and difficulty. For example, the problem can be formulated with a completely automatic segmentation of the same object among an image pair under angle or illumination changes [19,23,21]. On the other end of the spectrum, the problem can utilize training, and/or interactive methods to segment a large number of images with high intra-object variability [24,2].…”
Section: Introductionmentioning
confidence: 99%
“…Object discovery can also be thought of as a cosegmentation problem (see, e.g., Rother et al [13] and Vicente et al [14]). In cosegmentation, the information shared between groups of images is leveraged to improve segmentation.…”
Section: Prior Workmentioning
confidence: 99%