<s>
In	O
the	O
practice	O
of	O
digital	B-Algorithm
image	I-Algorithm
processing	I-Algorithm
Alexandre	O
X	O
.	O
Falcao	O
,	O
Jorge	O
Stolfi	O
,	O
and	O
Roberto	O
de	O
Alencar	O
Lotufo	O
have	O
created	O
and	O
proven	O
that	O
the	O
Image	B-Algorithm
Foresting	I-Algorithm
Transform	I-Algorithm
(	O
IFT	O
)	O
can	O
be	O
used	O
as	O
a	O
time	O
saver	O
in	O
processing	O
2-D	O
,	O
3-D	O
images	O
,	O
and	O
moving	O
images	O
.	O
</s>
<s>
In	O
1959	O
Dijkstra	O
used	O
a	O
balanced	B-Application
heap	I-Application
data	I-Application
structure	I-Application
to	O
improve	O
upon	O
an	O
algorithm	O
presented	O
by	O
Moore	O
in	O
1957	O
and	O
Bellman	O
in	O
1958	O
that	O
computed	O
the	O
cost	O
of	O
the	O
paths	O
in	O
a	O
general	O
graph	O
.	O
</s>
<s>
The	O
Bucket	B-Algorithm
sorting	I-Algorithm
technique	O
is	O
how	O
Dial	O
improved	O
on	O
the	O
algorithm	O
a	O
decade	O
later	O
.	O
</s>
<s>
The	O
transform	O
is	O
a	O
tweaked	O
version	O
of	O
Dijkstra	O
’s	O
shortest-path	O
algorithm	O
that	O
is	O
optimized	O
for	O
using	O
more	O
than	O
one	O
input	O
and	O
the	O
maximization	O
of	O
digital	B-Algorithm
image	I-Algorithm
processing	I-Algorithm
operators	O
.	O
</s>
<s>
Most	O
of	O
the	O
operators	O
that	O
are	O
used	O
for	O
digital	B-Algorithm
image	I-Algorithm
processing	I-Algorithm
can	O
use	O
these	O
three	O
pieces	O
of	O
information	O
to	O
be	O
optimized	O
.	O
</s>
<s>
Depending	O
on	O
which	O
digital	B-Algorithm
image	I-Algorithm
processing	I-Algorithm
operator	O
that	O
has	O
been	O
decided	O
upon	O
the	O
algorithm	O
can	O
be	O
further	O
tweaked	O
for	O
optimization	O
depending	O
upon	O
what	O
that	O
operator	O
uses	O
.	O
</s>
