The image foresting transform: Theory, algorithms, and applications

被引:391
作者
Falcao, AX
Stolfi, J
Lotufo, RDA
机构
[1] Univ Estadual Campinas, Inst Comp, BR-13084851 Campinas, SP, Brazil
[2] Univ Estadual Campinas, Fac Elect & Comp Engn, BR-13083970 Campinas, SP, Brazil
关键词
Dijkstra's algorithm; shortest-path problems; image segmentation; image analysis; regional minima; watershed transform; morphological reconstruction; boundary tracking; distance transforms; and multiscale skeletonization;
D O I
10.1109/TPAMI.2004.1261076
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:19 / 29
页数:11
相关论文
共 52 条
[1]   SEEDED REGION GROWING [J].
ADAMS, R ;
BISCHOF, L .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1994, 16 (06) :641-647
[2]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[3]  
[Anonymous], INT J INNOVATION STU, DOI DOI 10.1016/J.IJIS.2022.06.001
[4]  
Bellman R., 1957, DYNAMIC PROGRAMMING
[5]  
Bellman R., 1958, Quarterly of Applied Mathematics, V16, P87, DOI [10.1090/qam/102435, DOI 10.1090/QAM/102435]
[6]  
Beucher S., 2018, Mathematical morphology in image processing, P433, DOI DOI 10.1201/9781482277234-12
[7]   DISTANCE TRANSFORMATIONS IN DIGITAL IMAGES [J].
BORGEFORS, G .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (03) :344-371
[8]  
Cormen T. H., 1990, INTRO ALGORITHMS
[9]   Fast Euclidean distance transformation by propagation using multiple neighborhoods [J].
Cuisenaire, O ;
Macq, B .
COMPUTER VISION AND IMAGE UNDERSTANDING, 1999, 76 (02) :163-172
[10]   EUCLIDEAN DISTANCE MAPPING [J].
DANIELSSON, PE .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1980, 14 (03) :227-248