Description: This algorithm was introduced by Koga et al in 1981. It became very popular because of its simplicity and also robust and near optimal performance. It searches for the best motion vectors in a coarse to fine search pattern. The algorithm may be described as:
Step 1: An initial step size is picked. Eight blocks at a distance of step size from the centre (around the centre block) are picked for comparison.
Step 2: The step size is halved. The centre is moved to the point with the minimum distortion.
To Search:
File list (Check if you may need any files):
Debug\3step.exe
.....\3step.ilk
.....\3step.obj
.....\3step.pch
.....\3step.pdb
.....\vc60.idb
.....\vc60.pdb
3step.cpp
3step.dsp
3step.dsw
3step.ncb
3step.opt
3step.plg
Download