Greedy Algorithm F Results
The number of matching criteria evaluated by Greedy Algorithm F was independent of the sequence coded and exhibited step behaviour similar to Greedy Algorithm D. This was the result of quartering the stepsize rather than halving it.
Criteria evaluations required by Greedy Algorithm F at various maximum displacements.
MSE of sequences coded by Greedy Algorithm F as the displacement increased.
The error was at its lowest at ±3 pixels for the Garden sequence, after which it rose quickly. Although not very apparent from the graph above, the displacements of ±10 and ±8 pixels were most successful for coding the Football and Tennis sequences.
[Return to Greedy Algorithm results
© Colin E. Manning 1996