Block-matching algorithm: Difference between revisions

Content deleted Content added
Four Step Search: There are no figures. As I understand the step is superfluous, because the search ___location remains in the same place
m I removed apostrophe from the definition of S and p. They were used just in the definition and not in the other use of the symbols. I changed S=S/2=1 with S = S/2 (that is S=1) since, in my opinion, the first formulation was misleading
Line 44:
 
# Start with search ___location at center
# Set step size ‘S’S = 4 and search parameter ‘p’p = 7
# Search 8 locations +/- S pixels around ___location (0,0) and the ___location (0,0)
# Pick among the 9 locations searched, the one with minimum cost function
Line 125:
 
# Start with search ___location at center
# Set step size ‘S’S = 2, (irrespective of search parameter ‘p’p)
# Search 8 locations +/- S pixels around ___location (0,0) as shown in figure
# Pick among the 9 locations searched, the one with minimum cost function
# If the minimum weight is found at center for search window:
## Set the new step size as S = S/2 (that is S = 1)
## Repeat the search procedure from steps 3 to 4
## Select ___location with the least weight as motion vector
Line 150:
* LDSP:
## Start with search ___location at center
## Set step size ‘S’S = 2
## Search 8 locations pixels (X,Y) such that (|X|+|Y|=S) around ___location (0,0) using a diamond search point pattern
## Pick among the 9 locations searched, the one with minimum cost function
Line 158:
* SDSP:
## Set the new search origin
## 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