The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
OBJ CUT
Abstract
In this paper, we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for combining top down and bottom up cues. The work draws together two powerful formulations: pictorial structures (PS) and Markov random fields (MRFs) both of which have efficient algorithms for their solution. The resulting combination, which we call the object category specific MRF, suggests a solution to the problem that has long dogged MRFs namely that they provide a poor prior for specific shapes. In contrast, our model provides a prior that is global across the image plane using the PS. We develop an efficient method, OBJ CUT, to obtain segmentations using this model. Novel aspects of this method include an efficient algorithm for sampling the PS model, and the observation that the expected log likelihood of the model can be increased by a single graph cut. Results are presented on two object categories, cows and horses. We compare our methods to the state of the art in object category specific image segmentation and demonstrate significant improvements.
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
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
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
Object class recognition by unsupervised scale-invariant learning
Fergus, R., Perona, P., & Zisserman, A. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211479 · Cited by 2,023
Self-citationProbabilistic reasoning in intelligent systems: Networks of plausible inference
Andersen, S. K. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90084-w · Cited by 562
Interactive Image Segmentation Using an Adaptive GMMRF Model
Blake, A., Rother, C., Brown, M., Perez, P., & Torr, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24670-1_33 · Cited by 527
Self-citationLearning a Sparse Representation for Object Detection
Agarwal, S., & Roth, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47979-1_8 · Cited by 507
Pedestrian Detection from a Moving Vehicle
Gavrila, D. M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45053-x_3 · Cited by 436
Texture classification: are filter banks necessary?
Varma, M., & Zisserman, A. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211534 · Cited by 421
Self-citationEdge detection with embedded confidence
Meer, P., & Georgescu, B. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.977560 · Cited by 377
Class-Specific, Top-Down Segmentation
Borenstein, E., & Ullman, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47967-8_8 · Cited by 364
Efficient matching of pictorial structures
Felzenszwalb, P. F., & Huttenlocher, D. P. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.854739 · Cited by 310
Shape context and chamfer matching in cluttered scenes
Thayananthan, A., Stenger, B., Torr, P. H. S., & Cipolla, R. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211346 · Cited by 308
Self-citationSimultaneous Object Recognition and Segmentation by Image Exploration
Ferrari, V., Tuytelaars, T., & Van Gool, L. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24670-1_4 · Cited by 223
Recognizing surfaces using three-dimensional textons
Leung, T., & Malik, J. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790379 · Cited by 202
Interleaved Object Categorization and Segmentation
Leibe, B., & Schiele, B. (2003) · Procedings of the British Machine Vision Conference 2003 · doi:10.5244/c.17.78 · Cited by 172
Extending Pictorial Structures for Object Recognition
Kumar, M. P. P., Torr, P. H. S., & Zisserman, A. (2004) · British Machine Vision Conference (BMVC) · doi:10.5244/c.18.81 · Cited by 70
Self-citationFast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis
Felzenszwalb, P. F., Huttenlocher, D. P., & Kleinberg, J. M. (2003) · Cited by 56
Learning Layered Pictorial Structures from Video.
Kumar, M. P. P., Torr, P. H. S., & Zisserman, A. (2004) · Cited by 30
Self-citationInterleaved object categorization and segmentation
Leibe, B. (2004) · doi:10.3929/ethz-a-004949680 · Cited by 30
Indexing High Dimensional Rectangles for Fast Multimedia Identification
Goldstein, J., Platt, J. C., & Burges, C. J. C. (2003) · Cited by 12
Cited by
Graph Cuts and Efficient N-D Image Segmentation
Boykov, Y., & Funka-Lea, G. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7934-5 · Cited by 1,910
Robust Higher Order Potentials for Enforcing Label Consistency
Kohli, P., Ladický, L., & Torr, P. H. S. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0202-0 · Cited by 853
Self-citationScene Text Recognition using Higher Order Language Priors
Mishra, A., Alahari, K., & Jawahar, C. (2012) · Procedings of the British Machine Vision Conference 2012 · doi:10.5244/c.26.127 · Cited by 831
What, where and who? Classifying events by scene and object recognition
Li, L.-J., & Fei-Fei, L. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408872 · Cited by 781
Li, L.-J., Socher, R., & Fei-Fei, L. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206718 · Cited by 484
Metadata
- Authors
- Kumar, M. P., Torr, P. H. S., & Zisserman, A.
- Venue
- 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
- Publisher
- IEEE
- Published
- 2005-07-27
- Volume
- 1
- Pages
- 18-25
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2296770417
- Cited by
- 326
- References
- 21
- FWCI
- 27.09
- 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.