A new diamond search algorithm for fast block matching motion estimation

A new diamond search algorithm for fast block matching motion estimation
复制标题

DOI：
10.1109/icics.1997.647106
复制
发表时间：
1997-09
期刊：
Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat.
影响因子：
--
通讯作者：
Sha Zhu;K. Ma
Sha Zhu;K. Ma
中科院分区：
其他
文献类型：
--
作者：
Sha Zhu;K. Ma

文献摘要

被引文献

相似文献

在分析现有快速块匹配算法的基础上，通过对实际图像序列运动矢量分布的研究，提出了一种新的快速块匹配运动估计菱形搜索算法。仿真结果表明，所提出的DS算法大大优于著名的三步搜索（TSS）算法。与新的三步搜索（NTSS）算法相比，DS算法达到了类似的性能，但需要大约20%-25%的计算量。与近年来提出的四步搜索（4SS）和基于块的梯度下降搜索（BBGDS）等快速算法相比，DS算法也显示了其优越性。
Based on the analysis of certain existing fast block matching algorithms (BMAs) and study of motion vector distributions of real-world image sequences, a new diamond search (DS) algorithm for fast block matching motion estimation is proposed in this paper. Simulation results demonstrate that the proposed DS algorithm greatly outperforms the well-known three-step search (TSS) algorithm. Compared with the new three-step search (NTSS) algorithm, the DS algorithm achieves similar performance but requires approximate 20%-25% less computation. Compared with some recently proposed fast BMAs, such as the four-step search (4SS) and the block-based gradient descent search (BBGDS), our DS algorithm also shows its superiority.