Greedy Algorithm E Results
All three sequences were coded using Greedy Algorithm E. The number of matching criteria evaluations required by the algorithm is graphed against the maximum displacement in the illustration immediately below. The number of evaluations appeared to be dependent more on the displacement than the sequences coded and exhibited some step like behaviour.
Number of criteria evaluations carried out by Greedy Algorithm E as the maximum displacement was varied.
This algorithm had great difficulty coding the Garden sequence and the error increased steadily with the displacement. For the Tennis sequence the MSE was at a minimum at ±5 pixels. As the displacement increased so did the MSE, except for drops at ±9 pixels and ±20 pixels. The MSE was at its lowest at ±6 pixels for the Football sequence.
MSE of image sequences coded using Greedy Algorithm E with a variety of displacements.
[Return to Greedy Algorithm results
[Greedy Algorithm F results
© Colin E. Manning 1996