Block-matching algorithm: Difference between revisions

Content deleted Content added
Line 66:
## Select this point as the new center
# If the best matching point is at the center, set S = S/2
## Repeat steps 2 to 3
# If S = 1, all 8 locations around the center at a [[distance]] S are searched
# Set the motion vector as the point with least cost function