2004
DOI: 10.1109/tpami.2004.1261076
|View full text |Cite
|
Sign up to set email alerts
|

The image foresting transform: theory, algorithms, and applications

Abstract: 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 application… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
374
0
40

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 529 publications
(492 citation statements)
references
References 45 publications
(104 reference statements)
0
374
0
40
Order By: Relevance
“…Axial images were uploaded for sliceby-slice segmentation performed using inhouse software developed at our institution. The software uses a graphbased technique to identify the endosteal boundary of the radius (29). The area inside the endosteal perimeter (i.e., cortical bone excluded) served as the region of interest for each slice.…”
Section: Mrimentioning
confidence: 99%
“…Axial images were uploaded for sliceby-slice segmentation performed using inhouse software developed at our institution. The software uses a graphbased technique to identify the endosteal boundary of the radius (29). The area inside the endosteal perimeter (i.e., cortical bone excluded) served as the region of interest for each slice.…”
Section: Mrimentioning
confidence: 99%
“…The training forest becomes a classifier which can assign to any new sample the label of its most strongly connected root. Essentially, this methodology extends a previous approach, called Image Foresting Transform [8], for the design of image processing operators from the image domain to the feature space.…”
Section: Pattern Recognition By Optimum-path Forestmentioning
confidence: 93%
“…The prototypes are marked as the connected samples from different classes in a minimum spanning tree (MST) computed over the training set; as the arc-weights encode the distance between samples, the MST algorithm enforces the edges with lowest weights to be part of it, thus connecting samples with minimum distance. Therefore, after computing the prototypes, we can start the competition process using some smooth path-cost function, that is a function that obeys some properties [6]. The path-cost function adopted by the OPF version used in this work is the same as used by Papa et al [29,28], which computes the maximum arc-weight along a path between two samples.…”
Section: Optimum-path Forestmentioning
confidence: 99%