Fully Automatic Liver Segmentation through Graph-Cut Technique
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The accurate knowledge of the liver structure including blood vessels topography, liver surface and lesion localizations is usually required in treatments like liver ablations and radiotherapy. In this paper, we propose an approach for automatic segmentation of liver complex geometries. It consists of applying a graph-cut method initialized by an adaptive threshold. The algorithm has been tested on 10 datasets (CT and MR). A parametric comparison with the results obtained by previous algorithms based on active contour is also carried out and discussed. Main limitations of active contour approaches result to be overcome and segmentation is improved. Feasibility to routinely use graph-cut approach for automatic liver segmentation is also demonstrated.
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
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
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 · cited 1×
“cut was found in literature [17] presenting good results in”
Background
Cited by
The Liver Tumor Segmentation Benchmark (LiTS)
Bilic, P., Christ, P., Li, H. B., Vorontsov, E., Ben-Cohen, A., Kaissis, G., Szeskin, A., Jacobs, C., Mamani, G. E. H., Chartrand, G., et al. (2023) · Medical Image Analysis · doi:10.1016/j.media.2022.102680 · Cited by 1,412
The Liver Tumor Segmentation Benchmark (LiTS)
Bilic, P., Christ, P., Li, H. B., Vorontsov, E., Ben-Cohen, A., Kaissis, G., Szeskin, A., Jacobs, C., Mamani, G. E. H., Chartrand, G., et al. (2019) · arXiv · doi:10.48550/arxiv.1901.04056 · Cited by 1,412
Automatic 3D liver location and segmentation via convolutional neural network and graph cut
Lu, F., Wu, F., Hu, P., Peng, Z., & Kong, D. (2017) · International Journal of Computer Assisted Radiology and Surgery · doi:10.1007/s11548-016-1467-3 · Cited by 284
Automatic Liver Segmentation Based on Shape Constraints and Deformable Graph Cut in CT Images
Li, G., Chen, X., Shi, F., Zhu, W., Tian, J., & Xiang, D. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2481326 · Cited by 185
“Massoptier and Casciaro [23] applied a graph-cut method initialized by an adaptive threshold to perform fully automatic liver segmentation in CT images.”
Method
Metadata
- Authors
- Massoptier, L., & Casciaro, S.
- Venue
- 2007 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society
- Publisher
- IEEE
- Published
- 2007-08
- Volume
- 2007
- Pages
- 5243-5246
- ISSN
- 1557-170X (ISSN-L)
- OpenAlex
- W2132210108
- Cited by
- 84
- References
- 2
- FWCI
- 2.19
- 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.