The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Flux maximizing geometric flows
Abstract
Several geometric active contour models have been proposed for segmentation in computer vision and image analysis. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constraints from image forces so that it clings to features of interest in an intensity image. Recent variations on this theme take into account properties of enclosed regions and allow for multiple curves or surfaces to be simultaneously represented. However, it is still unclear how to apply these techniques to images of narrow elongated structures, such as blood vessels, where intensity contrast may be low and reliable region statistics cannot be computed. To address this problem, we derive the gradient flows which maximize the rate of increase of flux of an appropriate vector field through a curve (in 2D) or a surface (in 3D). The key idea is to exploit the direction of the vector field along with its magnitude. The calculations lead to a simple and elegant interpretation which is essentially parameter free and has the same form in both dimensions. We illustrate its advantages with several level-set-based segmentations of 2D and 3D angiography images of blood vessels.
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
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
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
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
Multiscale vessel enhancement filtering
Frangi, A. F., Niessen, W. J., Vincken, K. L., & Viergever, M. A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056195 · Cited by 3,707
Shape modeling with front propagation: a level set approach
Malladi, R., Sethian, J. A., & Vemuri, B. C. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368173 · Cited by 3,158
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
Caselles, V., Kimmel, R., & Sapiro, G. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466871 · Cited by 1,161
The heat equation shrinking convex plane curves
Gage, M. E., & Hamilton, R. S. (1986) · Journal of Differential Geometry · doi:10.4310/jdg/1214439902 · Cited by 1,151
Gradient flows and geometric active contour models
Kichenassamy, S., Kumar, A., Olver, P., Tannenbaum, A., & Yezzi, A. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466855 · Cited by 660
Kimia, B. B., Tannenbaum, A. R., & Zucker, S. W. (1995) · International Journal of Computer Vision · doi:10.1007/bf01451741 · Cited by 543
A review of nonlinear diffusion filtering
Weickert, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63167-4_37 · Cited by 513
T-snakes: Topology adaptive snakes
McInerney, T., & Terzopoulos, D. (2000) · Medical Image Analysis · doi:10.1016/s1361-8415(00)00008-6 · Cited by 418
Multiscale detection of curvilinear structures in 2-D and 3-D image data
Koller, T. M., Gerig, G., Szekely, G., & Dettwiler, D. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466846 · Cited by 314
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
Topology adaptive deformable surfaces for medical image volume segmentation
McInemey, T., & Terzopoulos, D. (1999) · IEEE Transactions on Medical Imaging · doi:10.1109/42.811261 · Cited by 269
Area and length minimizing flows for shape segmentation
Siddiqi, K., Lauziere, Y. B., Tannenbaum, A., & Zucker, S. W. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661193 · Cited by 261
Self-citationRegularized Laplacian Zero Crossings as Optimal Edge Integrators
Kimmel, R., & Bruckstein, A. M. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023030907417 · Cited by 227
Toward 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
Fiber tract mapping from diffusion tensor MRI
Vemuri, B. C., Chen, Y., Rao, M., McGraw, T., Wang, Z., & Mareci, T. H. (2002) · doi:10.1109/vlsm.2001.938885 · Cited by 89
Bullitt, E., Aylward, S., Liu, A., Stone, J., Mukherji, S. K., Coffey, C. S., Gerig, G., & Pizer, S. M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48714-x_23 · Cited by 46
A variational approach for the segmentation of the left ventricle in MR cardiac images
Nikos Paragios, A. (2002) · doi:10.1109/vlsm.2001.938894 · Cited by 31
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
Minimization of Region-Scalable Fitting Energy for Image Segmentation
Li, C., Kao, C.-Y., Gore, J. C., & Ding, Z. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2002304 · Cited by 1,721
Retinal vessel segmentation using the 2-D Gabor wavelet and supervised classification
Soares, J. V. B., Leandro, J. J. G., Cesar, R. M., Jelinek, H. F., & Cree, M. J. (2006) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2006.879967 · Cited by 1,497
Li, C., Huang, R., Ding, Z., Gatenby, J. C., Metaxas, D. N., & Gore, J. C. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2146190 · Cited by 1,285
A review of 3D vessel lumen segmentation techniques: Models, features and extraction schemes
Lesage, D., Angelini, E. D., Bloch, I., & Funka-Lea, G. (2009) · Medical Image Analysis · doi:10.1016/j.media.2009.07.011 · Cited by 920
Metadata
- Authors
- Vasilevskiy, A., & Siddiqi, K.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-12
- Volume
- 24
- Issue
- 12
- Pages
- 1565-1578
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2128089874
- Cited by
- 383
- References
- 22
- FWCI
- 12.36
- 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.