The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
From co-saliency to co-segmentation: An efficient and fully unsupervised energy minimization model
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.
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
Object recognition from local scale-invariant features
Lowe, D. G. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790410 · Cited by 16,472
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
Rao, R. P. N., & Ballard, D. H. (1999) · Nature Neuroscience · doi:10.1038/4580 · Cited by 5,483 · cited 1×
“The concept of saliency has been extensively studied by psychologists [14, 24, 27, 30].”
BackgroundComputational modelling of visual attention
Itti, L., & Koch, C. (2001) · Nature Reviews Neuroscience · doi:10.1038/35058500 · Cited by 4,733
Representing and Recognizing the Visual Appearance of Materials Using Three-Dimensional Textons
Leung, T., & Malik, J. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011126920638 · Cited by 1,498 · cited 1×
“Since such a histogram is simply composed of the frequencies of the visual words [18], how these words are derived should, in turn, be a key factor.”
Background
Cited by
Hierarchical Saliency Detection
Yan, Q., Xu, L., Shi, J., & Jia, J. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.153 · Cited by 1,773
Hierarchical Image Saliency Detection on Extended CSSD
Shi, J., Yan, Q., Xu, L., & Jia, J. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2465960 · Cited by 574
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
Review of Visual Saliency Detection With Comprehensive Information
Cong, R., Lei, J., Fu, H., Cheng, M.-M., Lin, W., & Huang, Q. (2019) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2018.2870832 · Cited by 419
Techniques and Challenges of Image Segmentation: A Review
Yu, Y., Wang, C., Fu, Q., Kou, R., Huang, F., Yang, B., Yang, T., & Gao, M. (2023) · Electronics · doi:10.3390/electronics12051199 · Cited by 370
Metadata
- Authors
- Chang, K.-Y., Liu, T.-L., & Lai, S.-H.
- Venue
- CVPR 2011
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 2129-2136
- OpenAlex
- W2153760331
- Cited by
- 215
- References
- 5
- FWCI
- 12.67
- 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: From co-saliency to co-segmentation: An efficient and fully unsupervised energy minimization model. https://app.cochat.ai/papers/10.1109/cvpr.2011.5995415
- The paper
- Chang, K.-Y., Liu, T.-L., & Lai, S.-H. (2011). From co-saliency to co-segmentation: An efficient and fully unsupervised energy minimization model. CVPR 2011. https://doi.org/10.1109/cvpr.2011.5995415
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.