**3.3 Raster search**

This step consists of choosing the distance which corresponds to the greatest matched point from the previous search. Three cases according to this distance denoted as "BestDistance" are summarized as follows:

In this step, the selected point obtained from the previous steps corresponds to the start point of the star refinement. In each iteration, the distance is divided by two, and when the distance will be equal to one, two adjacent point searches are

*Fast Motion Estimation's Configuration Using Diamond Pattern and ECU, CFM,…*

*DOI: http://dx.doi.org/10.5772/intechopen.86792*

**Figure 7.**

**17**

*The used TZSearch algorithm.*


In the configuration file, "iRaster" represents a changeable variable not to be overdone.

• BestDistance > iRaster is agreed correctly; a raster scan is achieved using the iRaster value as the length step. If difference obtained from the starting station to the MV from the first level is besides large, this step is preceded. This step is computed on the entire search window.

**Figure 6** shows an example of a full search algorithm with iRaster which is equal to 4.
