The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Shape modeling with front propagation: a level set approach
Abstract
Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods and overcomes some of their limitations. The authors' techniques can be applied to model arbitrarily complex shapes, which include shapes with significant protrusions, and to situations where no a priori assumption about the object's topology is made. A single instance of the authors' model, when presented with an image having more than one object of interest, has the ability to split freely to represent each object. This method is based on the ideas developed by Osher and Sethian (1988) to model propagating solid/liquid interfaces with curvature-dependent speeds. The interface (front) is a closed, nonintersecting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a "Hamilton-Jacobi" type equation written for a function in which the interface is a particular level set. A speed term synthesized from the image is used to stop the interface in the vicinity of object boundaries. The resulting equation of motion is solved by employing entropy-satisfying upwind finite difference schemes. The authors present a variety of ways of computing the evolving front, including narrow bands, reinitializations, and different stopping criteria. The efficacy of the scheme is demonstrated with numerical experiments on some synthesized images and some low contrast medical images.>
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
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Self-citationOn active contour models and balloons
Cohen, L. D. (1991) · CVGIP: Image Understanding · doi:10.1016/1049-9660(91)90028-n · Cited by 2,153
Blake, A., & Zisserman, A. (1987) · The MIT Press eBooks · doi:10.7551/mitpress/7132.001.0001 · Cited by 2,105
A geometric model for active contours in image processing
Caselles, V., Catt�, F., Coll, T., & Dibos, F. (1993) · Numerische Mathematik · doi:10.1007/bf01385685 · Cited by 1,743
A Fast Level Set Method for Propagating Interfaces
Adalsteinsson, D., & Sethian, J. A. (1995) · Journal of Computational Physics · doi:10.1006/jcph.1995.1098 · Cited by 1,326
Self-citationMotion of level sets by mean curvature. I
Evans, L. C., & Spruck, J. (1991) · Journal of Differential Geometry · doi:10.4310/jdg/1214446559 · Cited by 1,158
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
Constraints on deformable models:Recovering 3D shape and nonrigid motion
Terzopoulos, D., Witkin, A., & Kass, M. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90080-x · Cited by 774
Regularization of Inverse Visual Problems Involving Discontinuities
Terzopoulos, D. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767807 · Cited by 767
Motion of Multiple Junctions: A Level Set Approach
Merriman, B., Bence, J. K., & Osher, S. (1994) · Journal of Computational Physics · doi:10.1006/jcph.1994.1105 · Cited by 523
Closed-form solutions for physically based shape modeling and recognition
Pentland, A., & Sclaroff, S. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.85660 · Cited by 466
The computation of visible-surface representations
Terzopoulos, D. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.3908 · Cited by 450
Curvature and the evolution of fronts
Sethian, J. A. (1985) · Communications in Mathematical Physics · doi:10.1007/bf01210742 · Cited by 425
Self-citationSurface modeling with oriented particle systems
Szeliski, R., & Tonnesen, D. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134037 · Cited by 295
Numerical algorithms for propagating interfaces: Hamilton-Jacobi equations and conservation laws
Sethian, J. A. (1990) · Journal of Differential Geometry · doi:10.4310/jdg/1214444092 · Cited by 274
Self-citationOn three-dimensional surface reconstruction methods
Bolle, R. M., & Vemuri, B. C. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.67626 · Cited by 266
Self-citationToward a computational theory of shape: An overview
Kimia, B. B., Tannenbaum, A., & Zucker, S. W. (1990) · Lecture notes in computer science · doi:10.1007/bfb0014889 · Cited by 147
One-dimensional regularization with discontinuities
Lee, D., & Pavlidis, T. E. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.9105 · Cited by 71
Steerable filters for early vision, image analysis, and wavelet decomposition
Freeman, W. T., & Adelson, E. H. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1990.139562 · Cited by 54
Cited by
Chan, T. F., & Vese, L. A. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.902291 · Cited by 10,304
Caselles, V., Kimmel, R., & Sapiro, G. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007979827043 · Cited by 5,244
Medical image analysis: progress over two decades and the challenges ahead
Duncan, J. S., & Ayache, N. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824822 · Cited by 4,140
Snakes, shapes, and gradient vector flow
Xu, C., & Prince, J. L. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661186 · Cited by 4,001
Current Methods in Medical Image Segmentation
Pham, D. L., Xu, C., & Prince, J. L. (2000) · Annual Review of Biomedical Engineering · doi:10.1146/annurev.bioeng.2.1.315 · Cited by 2,341
Metadata
- Authors
- Malladi, R., Sethian, J. A., & Vemuri, B. C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995
- Volume
- 17
- Issue
- 2
- Pages
- 158-175
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2149184914
- Cited by
- 3,158
- References
- 20
- FWCI
- 45.20
- 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.