The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A multilevel banded graph cuts method for fast image segmentation
Abstract
In the short time since publication of Boykov and Jolly's seminal paper [2001], graph cuts have become well established as a leading method in 2D and 3D semi-automated image segmentation. Although this approach is computationally feasible for many tasks, the memory overhead and supralinear time complexity of leading algorithms results in an excessive computational burden for high-resolution data. In this paper, we introduce a multilevel banded heuristic for computation of graph cuts that is motivated by the well-known narrow band algorithm in level set computation. We perform a number of numerical experiments to show that this heuristic drastically reduces both the running time and the memory consumption of graph cuts while producing nearly the same segmentation result as the conventional graph cuts. Additionally, we are able to characterize the type of segmentation target for which our multilevel banded heuristic yields different results from the conventional graph cuts. The proposed method has been applied to both 2D and 3D images with promising results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
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
Cited by
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
Self-citationGraph 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
“…(Li et al., 2004) (lazy snapping), integrating high-level contextual information (Kumar et al., 2005) (obj-cuts), multi-level and banded methods (Lombaert et al., 2005; Xu et al., 2003; Juan and Boykov, 2006), binary segmentation using stereo cues (Kolmogorov et al., 2005), efficient algorithms…”
MethodResultInfluentialImproved seam carving for video retargeting
Rubinstein, M., Shamir, A., & Avidan, S. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360615 · Cited by 742
Prit, Y., Kav-Venaki, E., & Peleg, S. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459159 · Cited by 400
Moore, A. P., Prince, S. J. D., Warrell, J., Mohammed, U., & Jones, G. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587471 · Cited by 380
Metadata
- Authors
- Lombaert, H., Sun, Y., Grady, L., & Xu, C.
- Venue
- Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1
- Publisher
- IEEE
- Published
- 2005
- Pages
- 259-265 Vol. 1
- OpenAlex
- W2169499040
- Cited by
- 220
- References
- 2
- FWCI
- 9.64
- 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: A multilevel banded graph cuts method for fast image segmentation. https://app.cochat.ai/papers/10.1109/iccv.2005.13
- The paper
- Lombaert, H., Sun, Y., Grady, L., & Xu, C. (2005). A multilevel banded graph cuts method for fast image segmentation. Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1. https://doi.org/10.1109/iccv.2005.13
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.