首页> 外文会议>International Symposium on Intelligent Multimedia, Video and Speech Processing >Fast search algorithm for edge-oriented block matching algorithm
【24h】

Fast search algorithm for edge-oriented block matching algorithm

机译:边缘面向块匹配算法的快速搜索算法

获取原文

摘要

The edge-oriented block matching algorithm (EOMBA) provides a better motion-compensated prediction along moving edges in comparison with the traditional intensity based block motion estimation methods. However, the accuracy of the motion vectors of blocks containing the boundary between the moving objects and the still area is critical in the EOBMA. Consequently, the full search algorithm (FSA) with a large search window is used to ensure its accuracy. In order to reduce the computational complexity of the motion estimation of these blocks, a fast search algorithm for the FOBMA is proposed in this paper. The proposed algorithm employs the edge feature to locate initial search points such that the computational burden of the motion estimation of these boundary blocks must be reduced. Results on applying the proposed algorithm to the EOBMA show that the proposed search strategy is able to strengthen the EOBMA.
机译:与传统的基于强度的块运动估计方法相比,定向边缘的块匹配算法(Eomma)提供了沿移动边缘的更好的运动补偿预测。然而,包含移动物体与静止区域之间的边界的块的运动向量的精度在Eobma中是至关重要的。因此,使用具有大搜索窗口的完整搜索算法(FSA)来确保其准确性。为了降低这些块的运动估计的计算复杂性,本文提出了一种快速搜索的FoBMA算法。所提出的算法采用边缘特征来定位初始搜索点,使得必须减少这些边界块的运动估计的计算负担。结果将建议的算法应用于Eobma,表明所提出的搜索策略能够加强eobma。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号