Block-matching algorithm: Difference between revisions

Revision as of 21:35, 14 June 2019

Revision as of 01:23, 15 June 2019

Line 160:

## Set the new step size as S = S/2 (that is S = 1)

## Repeat the search procedure to find ___location with least weight

## Select ___location with the least weight as motion vector ___location of motion vector with least weight 34.0444094,-1177977943

This algorithm finds the global minimum very accurately as the search pattern is neither too big nor too small. Diamond Search algorithm has a peak signal-to-noise ratio close to that of Exhaustive Search with significantly less computational expense.