Content deleted Content added
adding links to references using Google Scholar |
adding links to references using Google Scholar |
||
Line 2:
__FORCETOC__
In the practice of [[digital image processing]] Alexandre X. Falcao, Jorge Stolfi, and Roberto de Alencar Lotufo have created and proven that the '''Image Foresting Transform''' (IFT) can be used as a time saver in processing 2-D, 3-D images, and moving images.<ref name="Falcao">Falcao, A.X. Stolfi, J. de Alencar Lotufo, R. : "[https://www.researchgate.net/profile/Roberto_Lotufo/publication/8331682_The_image_foresting_transform_theory_algorithms_and_applications/links/0912f50b724229bf0d000000.pdf The image foresting transform: theory, algorithms, and applications]", In IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 26, NO. 1, JANUARY 2004</ref>
==History <ref name="Falcao"/>==
In 1959 Dijkstra used a [[Heap (data structure)|balanced heap data structure]]<ref name="Falcao"/><ref name="Dij">E.W. Dijkstra, “[http://www.cs.yale.edu/homes/lans/readings/routing/dijkstra-routing-1959.pdf A Note on Two Problems in Connexion with Graphs],” Numerische Mathematik, vol. 1, pp. 269-271, 1959</ref> to improve upon an algorithm presented by Moore in 1957<ref name="Falcao"/><ref name="Moo">E.F. Moore, “The Shortest Path through a Maze,” Proc. Int’l Symp. Theory of Switching, pp. 285-292, Apr. 1959</ref> and Bellman in 1958<ref name="Falcao"/><ref name="Bell">R. Bellman,
==Definition <ref name="Falcao"/>==
|