Block-matching algorithm
From Wikipedia, the free encyclopedia
A Block Matching Algorithm (BMA) is a way of locating matching blocks in a sequence of digital video frames for the purposes of motion estimation.
Block matching concept
The purpose of a block matching algorithm is to find a matching block from a frame 
in some other frame 
, which may appear before or after . This can be used to discover temporal redundancy in the video sequence, increasing the effectiveness of interframe video compression and television standards conversion.
Block matching algorithms make use of an evaluation metric to determine whether a given block in frame matches the search block in frame .
Block-matching algorithms
- Cross Search Algorithm (CSA)
- Full Search Algorithm (FSA)
- Spiral Search
- Three Step Search
- Two Dimensional Logarithmic Search (TDL)
- Binary Search (BS)
- Four Step Search (FSS)
- Orthogonal Search Algorithm (OSA)
- Hierarchical Search Algorithm (HSA)
- Diamond Search (DS)
Evaluation Metrics
Several evaluation metrics can be used.
- Mean squared error (MSE)
- Sum of absolute differences (SAD)
- Mean absolute difference (MAD)
- Sum of squared errors (SSE)
- Sum of absolute transformed differences (SATD)
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.