Block-matching algorithm: Difference between revisions

Revision as of 11:35, 5 November 2021

Revision as of 11:36, 5 November 2021

Line 125:

# Start with search ___location at center

# Set step size S = 2, (irrespective of search parameter p)

# Search 4 locations +/- S pixels search 8 locations +/- S pixels around ___location (0,0)locations 1=34.0460965,-117.7955275;

2=34.0464443,-117.7990496; 3=34.0446975,-117.7999699; 4=34.0438915,-117.7952174

# Pick among the 9 locations searched, the one with minimum cost function

# If the minimum weight is found at center for search window:

Line 136 ⟶ 135:

## Fix the step size as S = 2

## Repeat the search procedure from steps 3 to 4. Depending on ___location of new origin, search through 5 locations or 3 locations

## Select the ___location with the least weight 34.043634,-117.7897651

## If the least weight ___location is at the center of new window go to step 5, else go to step 6