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.
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
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
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
Power Watershed: A Unifying Graph-Based Optimization Framework
Couprie, C., Grady, L., Najman, L., & Talbot, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.200 · Cited by 305
Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting
Bai, X., & Sapiro, G. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0191-z · Cited by 304
3D Skeletons: A State‐of‐the‐Art Report
Tagliasacchi, A., Delame, T., Spagnuolo, M., Amenta, N., & Telea, A. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12865 · Cited by 264
Medical Image Segmentation: Methods and Software
Withey, D. J., & Koles, Z. J. (2007) · 2007 Joint Meeting of the 6th International Symposium on Noninvasive Functional Source Imaging of the Brain and Heart and the International Conference on Functional Biomedical Imaging · doi:10.1109/nfsi-icfbi.2007.4387709 · Cited by 113
Oropharyngeal dysphagia identification using wavelets and optimum path forest
Spadotto, A. A., Pereira, J. C., Guido, R. C., Papa, J. P., Falcao, A. X., Gatto, A. R., Cola, P. C., & Schelp, A. O. (2008) · 2008 3rd International Symposium on Communications, Control and Signal Processing · doi:10.1109/isccsp.2008.4537320 · Cited by 12
Diniz, W. F. S., Fremont, V., Fantoni, I., & Nóbrega, E. G. O. (2017) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2017.06.013 · Cited by 11
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.