首页> 外文会议>Communication Systems and Network Technologies (CSNT), 2012 International Conference on >Review towards the Fast Block Matching Algorithms for Video Motion Estimation
【24h】

Review towards the Fast Block Matching Algorithms for Video Motion Estimation

机译:视频运动估计快速块匹配算法综述

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

A video sequence consists of a series of frames. In order to compress the video for efficient storage and transmission, the temporal redundancy among adjacent frames must be exploited. A frame is selected as reference frame and subsequent frames are predicted from the reference frame using a technique known as motion estimation. Real videos contain a mixture of motions with slow and fast contents. Among block matching motion estimation algorithms, the full search algorithm is known for its superiority in the performance over other matching techniques. However, this method is computationally very extensive. Several fast block matching algorithms (FBMAs) have been proposed in the literature with the aim to reduce computational costs while maintaining desired quality performance, but all these methods are considered to be sub optimal. No fixed fast block matching algorithm can efficiently remove temporal redundancy of video sequences with wide motion contents.
机译:视频序列由一系列帧组成。为了压缩视频以进行有效的存储和传输,必须利用相邻帧之间的时间冗余。选择帧作为参考帧,并使用称为运动估计的技术从参考帧中预测后续帧。真实视频包含具有慢速和快速内容的混合运动。在块匹配运动估计算法中,全搜索算法因其性能优于其他匹配技术而闻名。但是,该方法在计算上非常广泛。文献中已经提出了几种快速块匹配算法(FBMA),目的是减少计算成本,同时保持所需的质量性能,但是所有这些方法都被认为是次优的。没有固定的快速块匹配算法可以有效地去除具有宽运动内容的视频序列的时间冗余。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号