A new fast block matching algorithm based on block sum pyramid

被引:0
作者
Yu, NH [1 ]
Chen, H [1 ]
Liu, ZK [1 ]
Li, XL [1 ]
Niu, F [1 ]
机构
[1] Univ Sci & Technol China, Dept EE&IS, Hefei 230026, Peoples R China
来源
SECOND INTERNATION CONFERENCE ON IMAGE AND GRAPHICS, PTS 1 AND 2 | 2002年 / 4875卷
关键词
block matching; motion estimation; Minkowski's inequality; block sum pyramid;
D O I
10.1117/12.477197
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this correspondence, a new block sum pyramid algorithm (NBPSA) to motion estimation is presented. Compared with BSPA, NBSPA estimate the vector of the minimum mean absolute difference (MAD(min)). In the mean time, instead of update the value level by level, we update the estimation of MAD row by row, up to down. Experimental results showed that, with the search result of the algorithm identical-to the search result of the exhaustive search and BSPA, NBSPA reduced the computation complexity-greatly.
引用
收藏
页码:559 / 566
页数:8
相关论文
共 8 条