Fast full-search block matching

被引：63
|
作者：
Brünig, M [1 ]
Niehsen, W [1 ]
机构：
[1] Rhein Westfal TH Aachen, Inst Commun Engn, D-52056 Aachen, Germany
来源：
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY | 2001年 / 11卷 / 02期
关键词：
block matching; exhaustive search; fast full-search; motion estimation;
D O I：
10.1109/76.905989
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
A fast full-search block-matching algorithm is developed, The matching criterion is the sum of absolute differences or the mean-square error, The algorithm evaluates lower bounds for the matching criteria for subdivided blocks in order to reduce the number of search positions. It also uses the lower bounds for a fast calculation of the matching criterion for the remaining search positions. The computational complexity of the algorithm is evaluated and compared to the three-step search strategy. The search result of the algorithm is identical to the search result of the exhaustive search.
引用
收藏
页码：241 / 247
页数：7
相关论文
共 50 条
12345