Content deleted Content added
Petri Krohn (talk | contribs) Undid revision 1012584688 by 66.75.123.245 (talk) - Undoing old vandalism. Step 1/4 (Must first revert this correction.) |
Petri Krohn (talk | contribs) Undid revision 901895706 by 2605:E000:B0A1:7B00:B1BD:5881:8041:7F3C (talk) - Undoing old vandalism. Step 2/4 |
||
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
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.
| |||