The DOI matches its Crossref record.
Efficient Graph-Based Image Segmentation
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
No references could be resolved yet.
Research works printed but not linked: 19
- Arya, S. and Mount, D.M. 1993. Approximate nearest neighbor searching. In Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 271–280.
- Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti Spaccamela, A., and Protasi, M. (to appear). Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer-Verlag: Berlin.
- Comaniciu, D. and Meer, P. 1997. Robust analysis of feature spaces: Color image segmentation. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 750–755. · DOI
- Comaniciu, D. and Meer, P. 1999. Mean shift analysis and applications. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1197–1203. · DOI · Paper page
- Cooper, M.C. 1998. The tractability of segmentation and scene analysis. International Journal of Computer Vision, 30(1):27–42. · DOI
- Cormen, T.H., Leiserson, C.E., and Rivest, R.L. 1990. Introduction to Algorithms. The MIT Press: McGraw-Hill Book Company.
- Felzenszwalb, P. and Huttenlocher, D. 1998. Image segmentation using local variation. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 98–104. · DOI
- Gdalyahu, Y., Weinshall, D., and Werman, M. 1999. Stochastic clustering by typical cuts. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2596–2601.
- Jain, A.K. and Dubes, R.C. 1988. Algorithms for Clustering Data. Prentice Hall.
- Jermyn, I. and Ishikawa, H. 2001. Globally optimal regions and boundaries as minimum ratio weight cycles. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:1075–1088. · DOI
- Pavlidas, T. 1977. Structural Pattern Recognition. Springer-Verlag. · DOI · Paper page
- Perona, P. and Freeman, W. 1998. A factorization approach to grouping. In Proceedings of the European Conference on Computer Vision, pp. 655–670. · DOI · Paper page
- Ratan, A.L., Maron, O., Grimson, W.E.L., and Lozano-Perez, T. 1999. A framework for learning query concepts in image classification. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 423–431. · DOI
- Shi, J. and Malik, J. 1997. Normalized cuts and image segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 731–737.
- Urquhart, R. 1982. Graph theoretical clustering based on limited neighborhood sets. Pattern Recognition, 15(3):173–187. · DOI
- Weiss, Y. 1999. Segmentation using eigenvectors:Aunifying view. In Proceedings of the International Conference on Computer Vision, 2:975–982.
- Wertheimer, M. 1938. Laws of organization in perceptual forms (partial translation). In A Sourcebook of Gestalt Psychology.W.B. Ellis (Ed.). Harcourt, Brace and Company, pp. 71–88. · DOI · Paper page
- Wu, Z. and Leahy, R. 1993. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11:1101–1113. · DOI · Paper page
- Zahn, C.T. 1971. Graph-theoretic methods for detecting and describing gestalt clusters. IEEE Transactions on Computing, 20:68–86. · DOI · Paper page
Cited by
Kirillov, A., Mintun, E., Ravi, N., Mao, H., Rolland, C., Gustafson, L., Xiao, T., Whitehead, S., Berg, A. C., Lo, W.-Y., et al. (2023) · 2023 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.00371 · Cited by 11,953
Selective Search for Object Recognition
Uijlings, J. R. R., van de Sande, K. E. A., Gevers, T., & Smeulders, A. W. M. (2013) · International Journal of Computer Vision · doi:10.1007/s11263-013-0620-5 · Cited by 5,980
ScanNet: Richly-Annotated 3D Reconstructions of Indoor Scenes
Dai, A., Chang, A. X., Savva, M., Halber, M., Funkhouser, T., & Niessner, M. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.261 · Cited by 4,368
Edge Boxes: Locating Object Proposals from Edges
Zitnick, C. L., & Dollár, P. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10602-1_26 · Cited by 2,656
Learning Hierarchical Features for Scene Labeling
Farabet, C., Couprie, C., Najman, L., & LeCun, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.231 · Cited by 2,620
Metadata
- Authors
- Felzenszwalb, P. F., & Huttenlocher, D. P.
- Venue
- International Journal of Computer Vision
- Published
- 2004-09
- Volume
- 59
- Issue
- 2
- Pages
- 167-181
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W1999478155
- Cited by
- 6,176
- References
- 0
- FWCI
- 48.57
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
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: Efficient Graph-Based Image Segmentation. https://app.cochat.ai/papers/10.1023/b:visi.0000022288.19776.77
- The paper
- Felzenszwalb, P. F., & Huttenlocher, D. P. (2004). Efficient Graph-Based Image Segmentation. International Journal of Computer Vision. https://doi.org/10.1023/b%3Avisi.0000022288.19776.77
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.
