The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
The image foresting transform: theory, algorithms, and applications
Abstract
The image foresting transform (IFT) is a graph-based approach to the design of image processing operators based on connectivity. It naturally leads to correct and efficient implementations and to a better understanding of how different operators relate to each other. We give here a precise definition of the IFT, and a procedure to compute it-a generalization of Dijkstra's algorithm-with a proof of correctness. We also discuss implementation issues and illustrate the use of the IFT in a few applications.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Watersheds in digital spaces: an efficient algorithm based on immersion simulations
Vincent, L., & Soille, P. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.87344 · Cited by 5,649
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
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
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
A fast marching level set method for monotonically advancing fronts.
Sethian, J. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.4.1591 · Cited by 3,221
Adams, R., & Bischof, L. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.295913 · Cited by 3,138
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Network flows: Theory, algorithms and applications
(1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90171-6 · Cited by 2,585
Danielsson, P.-E. (1980) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(80)90054-4 · Cited by 1,998
Morphological grayscale reconstruction in image analysis: applications and efficient algorithms
Vincent, L. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.217222 · Cited by 1,923
Distance transformations in digital images
Borgefors, G. (1986) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(86)80047-0 · Cited by 1,898
Image processing, analysis and machine vision
Saarinen, K. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90202-x · Cited by 1,498
Topographic distance and watershed lines
Meyer, F. (1994) · Signal Processing · doi:10.1016/0165-1684(94)90060-4 · Cited by 1,403
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
Roerdink, J. B. T. M., & Meijster, A. (2000) · Fundamenta Informaticae · doi:10.3233/fi-2000-411207 · Cited by 1,372
Maurer, C. R., Qi, R., & Raghavan, V. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177156 · Cited by 911
Udupa, J. K., & Samarasekera, S. (1996) · Graphical Models and Image Processing · doi:10.1006/gmip.1996.0021 · Cited by 839
Mathematical Morphology in Image Processing
Dougherty, E. (2018) · CRC Press eBooks · doi:10.1201/9781482277234 · Cited by 831
The shortest path through a maze
Moore, E. (1959) · Medical Entomology and Zoology · Cited by 756
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Zhan, F. B., & Noon, C. E. (1998) · Transportation Science · doi:10.1287/trsc.32.1.65 · Cited by 570
Interactive Segmentation with Intelligent Scissors
Mortensen, E. N., & Barrett, W. A. (1998) · Graphical Models and Image Processing · doi:10.1006/gmip.1998.0480 · Cited by 546
User-Steered Image Segmentation Paradigms: Live Wire and Live Lane
Falcão, A. X., Udupa, J. K., Samarasekera, S., Sharma, S., Hirsch, B. E., & Lotufo, R. D. A. (1998) · Graphical Models and Image Processing · doi:10.1006/gmip.1998.0475 · Cited by 481
Curvature and the evolution of fronts
Sethian, J. A. (1985) · Communications in Mathematical Physics · doi:10.1007/bf01210742 · Cited by 425
Algorithm 360: shortest-path forest with topological ordering [H]
Dial, R. B. (1969) · Communications of the ACM · doi:10.1145/363269.363610 · Cited by 369
Shortest‐path algorithms: Taxonomy and annotation
Deo, N., & Pang, C. (1984) · Networks · doi:10.1002/net.3230140208 · Cited by 309
On the optimal detection of curves in noisy pictures
Montanari, U. (1971) · Communications of the ACM · doi:10.1145/362588.362594 · Cited by 295
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
Self-citationAn 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
Semiring Frameworks and Algorithms for Shortest-Distance Problems
Mohri, M. (2002) · doi:10.25596/jalc-2002-321 · Cited by 254
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
Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods
Cuisenaire, O., & Macq, B. M. M. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0783 · Cited by 148
A graph-based approach for multiscale shape analysis
Torres, R. D. S., Falcão, A. X., & Costa, L. D. F. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2003.10.007 · Cited by 147
An efficient uniform cost algorithm applied to distance transforms
Verwer, B. J. H., Verbeek, P. W., & Dekker, S. T. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.19041 · Cited by 136
Neighborhoods for distance transformations using ordered propagation
Ragnemalm, I. (1992) · CVGIP Image Understanding · doi:10.1016/1049-9660(92)90050-d · Cited by 77
Cited by
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Li, K., Wu, X., Chen, D. Z., & Sonka, M. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.19 · Cited by 664
Minimum Barrier Salient Object Detection at 80 FPS
Zhang, J., Sclaroff, S., Lin, Z., Shen, X., Price, B., & Mech, R. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.165 · Cited by 435
BBA: A Binary Bat Algorithm for Feature Selection
Nakamura, R. Y. M., Pereira, L. A. M., Costa, K. A., Rodrigues, D., Papa, J. P., & Yang, X.-S. (2012) · 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images · doi:10.1109/sibgrapi.2012.47 · Cited by 407
Supervised pattern classification based on optimum‐path forest
Papa, J. P., Falcão, A. X., & Suzuki, C. T. N. (2009) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.20188 · Cited by 365
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle
Cousty, J., Bertrand, G., Najman, L., & Couprie, M. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.173 · Cited by 352
Metadata
- Authors
- Falcao, A. X., Stolfi, J., & de Alencar Lotufo, R.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2004-01
- Volume
- 26
- Issue
- 1
- Pages
- 19-29
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2115284428
- Cited by
- 614
- References
- 38
- FWCI
- 16.30
- 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.