The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Interactive Segmentation with Intelligent Scissors
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Marr, D., & Hildreth, E. (1980) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1980.0020 · Cited by 6,510
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 1×
“formulated as a shortest or minimum cost path graph search. He applies Nilsson’s [ 27 ] A* heuris-”
MethodStoer, J. (1999) · Springer-Lehrbuch · doi:10.1007/978-3-662-09021-3 · Cited by 2,059
A Fast algorithm for active contours and curvature estimation
Williams, D. J., & Shah, M. (1992) · CVGIP: Image Understanding · doi:10.1016/1049-9660(92)90003-l · Cited by 1,101
Using dynamic programming for solving variational problems in vision
Amini, A. A., Weymouth, T. E., & Jain, R. C. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57681 · Cited by 1,008
Principles of Artificial Intelligence
(1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767059 · Cited by 847
Intelligent scissors for image composition
Mortensen, E. N., & Barrett, W. A. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218442 · Cited by 778
Self-citationDynamic programming for detecting, tracking, and matching deformable contours
Geiger, D., Gupta, A., Costa, L. A., & Vlontzos, J. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368194 · Cited by 429
Interactive live-wire boundary extraction
Barrett, W. A., & Mortensen, E. N. (1997) · Medical Image Analysis · doi:10.1016/s1361-8415(97)85005-0 · Cited by 334
Self-citationOn the optimal detection of curves in noisy pictures
Montanari, U. (1971) · Communications of the ACM · doi:10.1145/362588.362594 · Cited by 295
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
Adaptive boundary detection using 'live-wire' two-dimensional dynamic programming
Mortensen, E. N., Morse, B., Barrett, W. A., & Udupa, J. K. (2003) · Computers in cardiology · doi:10.1109/cic.1992.269378 · Cited by 120
Self-citationAdaptive determination of filter scales for edge detection
Jeong, H., & Kim, C. I. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.134062 · Cited by 96
Gleicher, M. L. (1995) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/218380.218441 · Cited by 94
Boundary detection via dynamic programming
Udupa, J. K., Samarasekera, S., & Barrett, W. A. (1992) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.131065 · Cited by 50
Self-citationA decision function method for boundary detection
Chien, Y. P., & Fu, K. S. (1974) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(74)80003-1 · Cited by 34
Three-dimensional boundary following
Cappelletti, J., & Rosenfeld, A. (1989) · Computer Vision Graphics and Image Processing · doi:10.1016/0734-189x(89)90105-9 · Cited by 23
Cited by
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
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
Radiomics: the process and the challenges
Kumar, V., Gu, Y., Basu, S., Berglund, A., Eschrich, S. A., Schabath, M. B., Forster, K., Aerts, H. J. W. L., Dekker, A., Fenstermacher, D., et al. (2012) · Magnetic Resonance Imaging · doi:10.1016/j.mri.2012.06.010 · Cited by 2,258
“Many popular segmentation algorithms have been applied in medical imaging studies within the last 20 years; the most popular ones include region-growing methods [31,32], level set methods [33–38], graph cut methods [39–44], active contours (snake) algorithms [45–49] and semiautomatic segmentations such as livewires [5…”
MethodGraph 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
“In fact, our graph cut approach can be seen as a generalization of path-based segmentation techniques in (Geiger et al., 1995; Mortensen and Barrett, 1998; Falcão et al., 1998).”
BackgroundMethodInfluentialDesign and validation of a tool for neurite tracing and analysis in fluorescence microscopy images
Meijering, E., Jacob, M., Sarria, J. ‐. F., Steiner, P., Hirling, H., & Unser, M. (2004) · Cytometry Part A · doi:10.1002/cyto.a.20022 · Cited by 1,608
Metadata
- Authors
- Mortensen, E. N., & Barrett, W. A.
- Venue
- Graphical Models and Image Processing
- Publisher
- Elsevier BV
- Published
- 1998-09
- Volume
- 60
- Issue
- 5
- Pages
- 349-384
- ISSN
- 1077-3169 (ISSN-L)
- OpenAlex
- W1987983010
- Cited by
- 546
- References
- 19
- FWCI
- 15.49
- Type
- journal article
- 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.