摘要
文章在讨论可变形块(DBMA)的运动估计和基于节点位移的可变形块运动模型的基础上,提出了基于节点交叉搜索的可变形块匹配算法(CS-DBMA)。以四节点模型为例,详细研究了该算法的搜索过程和流程,并利用两个序列进行测试,测试结果表明,在预测效果减少很小的情况下,CS-DBMA算法的运算量大大的减少。
This paper first discusses the motion estimation of deformable block (DBMA) and deformable block model based on the displacement nodes, then proposes a cross-node search based on DBMA .Four-node model as an example, the paper further studies the search process and technical process. And the test by two sequences is done, the test results show that the CS-DBMAalgorithm greatly reduces the computational complexity while results have a small reduction.
出处
《通信技术》
2008年第6期155-157,共3页
Communications Technology
关键词
运动估计
节点位移
可变形块匹配算法
motion estimation
nodal displacement
deformable block matching algorithm