The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
iCoseg: Interactive co-segmentation with intelligent scribble guidance
Abstract
This paper presents an algorithm for Interactive Co-segmentation of a foreground object from a group of related images. While previous approaches focus on unsupervised co-segmentation, we use successful ideas from the interactive object-cutout literature. We develop an algorithm that allows users to decide what foreground is, and then guide the output of the co-segmentation algorithm towards it via scribbles. Interestingly, keeping a user in the loop leads to simpler and highly parallelizable energy functions, allowing us to work with significantly more images per group. However, unlike the interactive single image counterpart, a user cannot be expected to exhaustively examine all cutouts (from tens of images) returned by the system to make corrections. Hence, we propose iCoseg, an automatic recommendation system that intelligently recommends where the user should scribble next. We introduce and make publicly available the largest co-segmentation datasetyet, the CMU-Cornell iCoseg Dataset, with 38 groups, 643 images, and pixelwise hand-annotated groundtruth. Through machine experiments and real user studies with our developed interface, we show that iCoseg can intelligently recommend regions to scribble on, and users following these recommendations can achieve good quality cutouts with significantly lower time and effort than exhaustively examining all cutouts.
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
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
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
GrabCut: Interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015720 · Cited by 5,703
(2009) · Minds at UW (University of Wisconsin) · Cited by 4,791
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images
Boykov, Y. Y., & Jolly, M.-P. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937505 · Cited by 3,674
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Seung, H. S., Opper, M., & Sompolinsky, H. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130417 · Cited by 1,651
Li, Y., Sun, J., Tang, C.-K., & Shum, H.-Y. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015719 · Cited by 1,097
"GrabCut": interactive foreground extraction using iterated graph cuts
Rother, C., Kolmogorov, V., & Blake, A. (2004) · ACM SIGGRAPH 2004 Papers · doi:10.1145/1186562.1015720 · Cited by 935
Geometric context from a single image
Hoiem, D., Efros, A. A., & Hebert, M. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.107 · Cited by 662
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
Rother, C., Minka, T., Blake, A., & Kolmogorov, V. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.91 · Cited by 535
A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting
Bai, X., & Sapiro, G. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408931 · Cited by 438
Active Learning with Gaussian Processes for Object Categorization
Kapoor, A., Grauman, K., Urtasun, R., & Darrell, T. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408844 · Cited by 322
GeoS: Geodesic Image Segmentation
Criminisi, A., Sharp, T., & Blake, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88682-2_9 · Cited by 277
Li, Y., Sun, J., Tang, C.-K., & Shum, H.-Y. (2004) · ACM SIGGRAPH 2004 Papers · doi:10.1145/1186562.1015719 · Cited by 249
An efficient algorithm for Co-segmentation
Hochbaum, D. S., & Singh, V (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459261 · Cited by 223
Automatically labeling video data using multi-class active learning
Yan, Y., Yang, J., & Hauptmann (2003) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2003.1238391 · Cited by 173
Half-integrality based algorithms for cosegmentation of images
Mukherjee, L., Singh, V., & Dyer, C. R. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206652 · Cited by 170
CLUSTER: An Unsupervised Algorithm for Modeling Gaussian Mixtures
Bouman, C. A. (2014) · Cited by 154
Vijayanarasimhan, S., & Grauman, K. L. (2009) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2009.5206705 · Cited by 148
Towards Scalable Dataset Construction: An Active Learning Approach
Collins, B. M., Deng, J., Li, K., & Fei-Fei, L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88682-2_8 · Cited by 118
Measuring uncertainty in graph cut solutions
Kohli, P., & Torr, P. H. S. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2008.07.002 · Cited by 75
Semi-Supervised Clustering via Learnt Codeword Distances
Batra, D., Sukthankar, R., & Chen, T. (2008) · British Machine Vision Conference (BMVC) · doi:10.5244/c.22.90 · Cited by 14
Self-citation
Cited by
Distributed GraphLab: a framework for machine learning and data mining in the cloud
Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., & Hellerstein, J. M. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212354 · Cited by 1,653
Visual saliency based on multiscale deep features
Li, G., & Yu, Y. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299184 · Cited by 1,163
Salient Object Detection: A Discriminative Regional Feature Integration Approach
Jiang, H., Wang, J., Yuan, Z., Wu, Y., Zheng, N., & Li, S. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.271 · Cited by 1,147
Segmentation Propagation in ImageNet
Kuettel, D., Guillaumin, M., & Ferrari, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33786-4_34 · Cited by 597
Co-Saliency Detection via a Self-Paced Multiple-Instance Learning Framework
Zhang, D., Meng, D., & Han, J. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2567393 · Cited by 508
Metadata
- Authors
- Batra, D., Kowdle, A., Parikh, D., Luo, J., & Chen, T.
- Venue
- 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 3169-3176
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1964884769
- Cited by
- 468
- References
- 24
- FWCI
- 25.84
- 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
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.