The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Open accessAbstract
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications. We have developed an optimal surface detection method capable of simultaneously detecting multiple interacting surfaces, in which the optimality is controlled by the cost functions designed for individual surfaces and by several geometric constraints defining the surface smoothness and interrelations. The method solves the surface segmentation problem by transforming it into computing a minimum s-t cut in a derived arc-weighted directed graph. The proposed algorithm has a low-order polynomial time complexity and is computationally efficient. It has been extensively validated on more than 300 computer-synthetic volumetric images, 72 CT-scanned data sets of different-sized plexiglas tubes, and tens of medical images spanning various imaging modalities. In all cases, the approach yielded highly accurate results. Our approach can be readily extended to higher-dimensional 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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Chan, T. F., & Vese, L. A. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.902291 · Cited by 10,304
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
Efficient Graph-Based Image Segmentation
Felzenszwalb, P. F., & Huttenlocher, D. P. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000022288.19776.77 · Cited by 6,176
Cootes, T. F., Edwards, G. J., & Taylor, C. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927467 · Cited by 5,409
Optimal approximations by piecewise smooth functions and associated variational problems
Mumford, D., & Shah, J. (1989) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160420503 · Cited by 5,208
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
Image Processing, Analysis and Machine Vision
Sonka, M., Hlavac, V., & Boyle, R. (1993) · Springer eBooks · doi:10.1007/978-1-4899-3216-7 · Cited by 3,717
Self-citationInteractive 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
Sethian, J. A. (1999) · Cited by 3,622
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
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (1956) · Canadian Journal of Mathematics · doi:10.4153/cjm-1956-045-5 · Cited by 2,410
A new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_15 · Cited by 1,829
Image processing, analysis and machine vision
Dijkstra, T. (1994) · Neurocomputing · doi:10.1016/0925-2312(94)90073-6 · Cited by 1,805
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Wu, Z., & Leahy, R. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.244673 · Cited by 1,137
Li, Y., Sun, J., Tang, C.-K., & Shum, H.-Y. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015719 · Cited by 1,097
Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images*
Geman, S., & Geman, D. (1993) · Journal of Applied Statistics · doi:10.1080/02664769300000058 · Cited by 983
B-spline signal processing. I. Theory
Unser, M., Aldroubi, A., & Eden, M. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.193220 · Cited by 940
Automated 3-D Extraction of Inner and Outer Surfaces of Cerebral Cortex from MRI
MacDonald, D., Kabani, N., Avis, D., & Evans, A. C. (2000) · NeuroImage · doi:10.1006/nimg.1999.0534 · Cited by 850
Udupa, J. K., & Samarasekera, S. (1996) · Graphical Models and Image Processing · doi:10.1006/gmip.1996.0021 · Cited by 839
Geometric Level Set Methods in Imaging, Vision, and Graphics
Osher, S., & Paragios, N. (2003) · Springer eBooks · doi:10.1007/b97541 · Cited by 799
B-spline signal processing. II. Efficiency design and applications
Unser, M., Aldroubi, A., & Eden, M. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.193221 · Cited by 641
B-SPLINE SIGNAL PROCESSING: PART I-THEORY
Unser, M. A., Aldroubi, A., & Eden, M. (1993) · Cited by 626
The image foresting transform: theory, algorithms, and applications
Falcao, A. X., Stolfi, J., & de Alencar Lotufo, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1261076 · Cited by 614
Computing geodesics and minimal surfaces via graph cuts
Boykov, & Kolmogorov (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238310 · Cited by 555
Topology preserving level set method for geometric deformable models
Han, X., Xu, C., & Prince, J. L. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1201824 · Cited by 492
Beyond the flow decomposition barrier
Goldberg, A. V., & Rao, S. B. (1998) · Journal of the ACM · doi:10.1145/290179.290181 · Cited by 466
B-SPLINE SIGNAL PROCESSING: PART II-EFFICIENT DESIGN AND APPLICATIONS
Unser, M. A., Aldroubi, A., & Eden, M. (1993) · Cited by 463
3-D active appearance models: segmentation of cardiac MR and ultrasound images
Mitchell, S. C., Bosch, J. G., Lelieveldt, B. P. F., van der Geest, R. J., Reiber, J. H. C., & Sonka, M. (2002) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2002.804425 · Cited by 392
Self-citationOn Implementing the Push—Relabel Method for the Maximum Flow Problem
Cherkassky, B. V., & Goldberg, A. V. (1997) · Algorithmica · doi:10.1007/pl00009180 · Cited by 370
Goldenberg, R., Kimmel, R., Rivlin, E., & Rudzsky, M. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.951533 · Cited by 334
Mitchell, S. C., Lelieveldt, B. P. F., van der Geest, R. J., Bosch, H. G., Reiver, J. H. C., & Sonka, M. (2001) · IEEE Transactions on Medical Imaging · doi:10.1109/42.925294 · Cited by 332
Self-citationSegmentation and measurement of the cortex from 3-D MR images using coupled-surfaces propagation
Zeng, X., Staib, L. H., Schultz, R. T., & Duncan, J. S. (1999) · IEEE Transactions on Medical Imaging · doi:10.1109/42.811276 · Cited by 320
The use of active shape models for locating structures in medical images
Cootes, T. F., Hill, A., Taylor, C. J., & Haslam, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0013779 · Cited by 297
On the optimal detection of curves in noisy pictures
Montanari, U. (1971) · Communications of the ACM · doi:10.1145/362588.362594 · Cited by 295
Image segmentation with ratio cut
Wang, S., & Siskind, J. M. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1201819 · Cited by 293
An ultra-fast user-steered image segmentation paradigm: live wire on the fly
Falcao, A. X., Udupa, J. K., & Miyazawa, F. K. (2000) · IEEE Transactions on Medical Imaging · doi:10.1109/42.832960 · Cited by 275
An application of heuristic search methods to edge and contour detection
Martelli, A. (1976) · Communications of the ACM · doi:10.1145/359997.360004 · Cited by 258
Interactive Organ Segmentation Using Graph Cuts
Boykov, Y., & Jolly, M.-P. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40899-4_28 · Cited by 240
Segmentation of intravascular ultrasound images: a knowledge-based approach
Sonka, M., Zhang, X., Siebes, M., Bissing, M. S., Dejong, S. C., Collins, S. M., & McKay, C. R. (1995) · IEEE Transactions on Medical Imaging · doi:10.1109/42.476113 · Cited by 235
Self-citationMaximal Closure of a Graph and Applications to Combinatorial Problems
Picard, J.-C. (1976) · Management Science · doi:10.1287/mnsc.22.11.1268 · Cited by 234
Globally optimal regions and boundaries as minimum ratio weight cycles
Jermyn, I. H., & Ishikawa, H. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.954599 · Cited by 168
Edge detection using heuristic search methods
Martelli, A. (1972) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(72)80013-3 · Cited by 166
Segmentation by grouping junctions
Ishikawa, H., & Geiger, D. (2002) · Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231) · doi:10.1109/cvpr.1998.698598 · Cited by 163
Tissue characterization in intravascular ultrasound images
Zhang, X., McKay, C. R., & Sonka, M. (1998) · IEEE Transactions on Medical Imaging · doi:10.1109/42.746622 · Cited by 154
Self-citationA Sequential 3D Thinning Algorithm and Its Medical Applications
Palágyi, K., Balogh, E., Kuba, A., Halmai, C., Erdőhelyi, B., Sorantin, E., & Hausegger, K. A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45729-1_42 · Cited by 152
"Ratio regions": a technique for image segmentation
Cox, I. J., Rao, S. B., & Zhong, Y. (1996) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1996.546886 · Cited by 152
Iterative relative fuzzy connectedness for multiple objects with multiple seeds
Ciesielski, K. C., Udupa, J. K., Saha, P. K., & Zhuge, Y. (2007) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2006.10.005 · Cited by 99
Coskun, A. U., Yeghiazarians, Y., Kinlay, S., Clark, M. E., Ilegbusi, O. J., Wahle, A., Milan Sonka, A., Popma, J. J., Kuntz, R. E., Feldman, C. L., et al. (2003) · Catheterization and Cardiovascular Interventions · doi:10.1002/ccd.10594 · Cited by 80
Thedens, D. R., Skorton, D. J., & Fleagle, S. R. (1995) · IEEE Transactions on Medical Imaging · doi:10.1109/42.370401 · Cited by 75
Local-cost computation for efficient segmentation of 3D objects with live wire
Schenk, A., Prause, G. P. M., & Peitgen, H. (2001) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.431015 · Cited by 41
Segmentation of wall and plaque in in vitro vascular MR images
Yang, F., Holzapfel, G. A., Schulze-Bauer, C. A. J., Stollberger, R., Thedens, D. R., Bolinger, L., Stolpen, A. H., & Milan Sonka, A. (2003) · International journal of cardiac imaging · doi:10.1023/a:1025829232098 · Cited by 38
A segmentation algorithm for contrast-enhanced images
Kim, & Ramin Zabih, A. (2003) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2003.1238389 · Cited by 18
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
Retinal Imaging and Image Analysis
Abramoff, M. D., Garvin, M. K., & Sonka, M. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2084567 · Cited by 1,439
Self-citationRetinal layer segmentation of macular OCT images using boundary classification
Lang, A., Carass, A., Hauser, M., Sotirchos, E. S., Calabresi, P. A., Ying, H. S., & Prince, J. L. (2013) · Biomedical Optics Express · doi:10.1364/boe.4.001133 · Cited by 310
Computer-Aided Diagnosis Systems for Lung Cancer: Challenges and Methodologies
El-Baz, A., Beache, G. M., Gimel'farb, G., Suzuki, K., Okada, K., Elnakib, A., Soliman, A., & Abdollahi, B. (2013) · International Journal of Biomedical Imaging · doi:10.1155/2013/942353 · Cited by 277
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
Metadata
- Authors
- Li, K., Wu, X., Chen, D. Z., & Sonka, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2006-01
- Volume
- 28
- Issue
- 1
- Pages
- 119-134
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2164774194
- Cited by
- 664
- References
- 56
- FWCI
- 23.52
- Type
- journal article
- Language
- en
- Open access
- green
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.
