The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An efficient algorithm for Co-segmentation
Abstract
This paper is focused on the Co-segmentation problem [1] - where the objective is to segment a similar object from a pair of images. The background in the two images may be arbitrary; therefore, simultaneous segmentation of both images must be performed with a requirement that the appearance of the two sets of foreground pixels in the respective images are consistent. Existing approaches [1, 2] cast this problem as a Markov Random Field (MRF) based segmentation of the image pair with a regularized difference of the two histograms - assuming a Gaussian prior on the foreground appearance [1] or by calculating the sum of squared differences [2]. Both are interesting formulations but lead to difficult optimization problems, due to the presence of the second (histogram difference) term. The model proposed here bypasses measurement of the histogram differences in a direct fashion; we show that this enables obtaining efficient solutions to the underlying optimization model. Our new algorithm is similar to the existing methods in spirit, but differs substantially in that it can be solved to optimality in polynomial time using a maximum flow procedure on an appropriately constructed graph. We discuss our ideas and present promising experimental results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Cited by
iCoseg: Interactive co-segmentation with intelligent scribble guidance
Batra, D., Kowdle, A., Parikh, D., Luo, J., & Chen, T. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540080 · Cited by 468
Discriminative clustering for image co-segmentation
Joulin, A., Bach, F., & Ponce, J. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539868 · Cited by 438
Cluster-Based Co-Saliency Detection
Fu, H., Cao, X., & Tu, Z. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2260166 · Cited by 427
Unsupervised Joint Object Discovery and Segmentation in Internet Images
Rubinstein, M., Joulin, A., Kopf, J., & Liu, C. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.253 · Cited by 355
A Co-Saliency Model of Image Pairs
Li, H., & Ngan, K. N. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2156803 · Cited by 319
Metadata
- Authors
- Hochbaum, D. S., & Singh, V
- Venue
- 2009 IEEE 12th International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2009-09
- Pages
- 269-276
- OpenAlex
- W2118802082
- Cited by
- 223
- References
- 1
- FWCI
- 14.18
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An efficient algorithm for Co-segmentation. https://app.cochat.ai/papers/10.1109/iccv.2009.5459261
- The paper
- Hochbaum, D. S., & Singh, V. (2009). An efficient algorithm for Co-segmentation. 2009 IEEE 12th International Conference on Computer Vision. https://doi.org/10.1109/iccv.2009.5459261
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.