Block-matching algorithm
From Wikipedia, the free encyclopedia
A Block-matching algorithm is a way of locating matching blocks in a sequence of Digital video frames for the purposes of Motion compensation.
The purpose of a block-matching algorithm is to find a matching block from a frame i in some other frame j, which may appear before or after i. This can then be used to reduce the overall temporal redundancy of the video sequence.
Block-matching algorithms make use of Block-matching criteria to determine whether a given block in frame j matches the search block in frame i
[edit] Block-matching algorithms
- Cross Search
- Full Search
- Spiral Search