The image foresting transform: theory, algorithms, and applications
Top Cited Papers
- 14 June 2004
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 26 (1) , 19-29
- https://doi.org/10.1109/tpami.2004.1261076
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.Keywords
This publication has 38 references indexed in Scilit:
- Distance transformations in digital imagesPublished by Elsevier ,2006
- Topographic distance and watershed linesPublished by Elsevier ,2003
- Multiscale skeletons by image foresting transform and its application to neuromorphometryPattern Recognition, 2002
- Relative Fuzzy Connectedness among Multiple Objects: Theory, Algorithms, and Applications in Image SegmentationComputer Vision and Image Understanding, 2001
- A graph-theoretic approach to distance transformationsPattern Recognition Letters, 1994
- Curvature and the evolution of frontsCommunications in Mathematical Physics, 1985
- An application of heuristic search methods to edge and contour detectionCommunications of the ACM, 1976
- On the optimal detection of curves in noisy picturesCommunications of the ACM, 1971
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959