![]() |
CiteULike | ![]() |
tyler's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
The image foresting transform: theory, algorithms, and applicationsPattern Analysis and Machine Intelligence, IEEE Transactions on In Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 26, No. 1. (2004), pp. 19-29.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe 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.
BibTeX record
RIS record