Diamond Search Algorithm

Step 1

Step 2

Step 3

Step 4

Procedure

1. On every step, among the four adjacent points, try to find the point with the minimum SAD, which will be the center of the next step.

2. Keep doing 1, store the min SADs of the last two step SAD1 and SAD2 until the the current SAD3 is greater than both SAD1 and SAD2, stop.

Advantage

Avoid local minimum point.

Motion Vector