【24h】

OTS and central expanding blocks scan for interframe compression

机译:OTS和中央扩展块扫描以进行帧间压缩

获取原文

摘要

This paper describes a novel block matching algorithm based on the modified once-at-a-time search (OTS) for motion estimation in any video encoder like (H.261/MPEG1, MPEG2, H.264/MPEG4). Normally, it consumes more than %80 of video encoding time due to searching of a candidate block in search window of the reference frame. To minimize the search time on block matching, an efficient block matching algorithm for fast motion estimation is proposed. It is based on the predictive MOTS block search strategy (horizontal and vertical) from the center of the frame in addition to the diagonal scan search. Experiments are conducted on various uncompressed video sequences (Tennis and Miss_American). The experimental results show that the algorithm provides a faster search with minimum distortion when compared to the MOTS and other optimal fast block matching motion estimation algorithms.
机译:本文介绍了一种基于改进的一次搜索(OTS)的新颖块匹配算法,用于在任何视频编码器(如H.261 / MPEG1,MPEG2,H.264 / MPEG4)中进行运动估计。通常,由于在参考帧的搜索窗口中搜索候选块,因此它会消耗%80的视频编码时间。为了最小化块匹配的搜索时间,提出了一种用于快速运动估计的有效块匹配算法。除了对角线扫描搜索外,它还基于从帧中心开始的预测MOTS块搜索策略(水平和垂直)。对各种未压缩的视频序列(网球和美国小姐)进行了实验。实验结果表明,与MOTS和其他最佳快速块匹配运动估计算法相比,该算法可提供更快的搜索速度,且失真最小。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号