首页> 外文会议>Conference on visual communications and image processing >Novel computationally scalable algorithm for motion estimation
【24h】

Novel computationally scalable algorithm for motion estimation

机译:用于运动估计的新型计算可扩展算法

获取原文

摘要

Because motion estimation represents a major computational load in typical vide encoding systems, there has been extensive research into fast motion estimation techniques. Given the nature of the process, two major classes of complexity reduction techniques have been proposed. These seek to speed up search times by (i) reducing the cost of each matching operation or (ii) reducing the number of points considered in the search region. In fast matching (FM) techniques, a typical approach is to compute the cost function based on a subset of pixels in a block. In fast search (FS) approaches, the complexity reduction comes from restricting the number of points in the search region, based on fixed rules or on initialization based on motion vectors already computed for other blocks or the previous frame. In this paper we use as a baseline algorithm the initialize- refine technique which belongs to the FS class. We concentrate on the case of real time software video encoding, which allows the flexibility of using variable complexity algorithms. Thus, we modify our baseline algorithm using a Lagrange multiplier approach similar to that of which allows us to explicitly take into account the trade-offs between search complexity and residual frame energy. Furthermore, we combine this algorithm with a novel fast matching method for SAD estimation which allows us to estimate the SAD based on successive subsets of pixels in a particular block. This method naturally possesses computational scalability because we can stop the framework and gives us one more degree of freedom to control the complexity/residual energy trade-off. We show that the combined algorithm achieves reductions of around 25 percent in computation time with respect to the original algorithm without SAD estimation. These results are further improved by designing a test structure that is optimized for typical sequences and where test for an early termination of the matching process are only included if they are though to be worthwhile in terms of the overall complexity.
机译:由于运动估计代表了典型的编码韦迪系统的主要计算负荷,出现了大量的研究,快速运动估计技术。由于过程的性质,复杂性降低技术两大类已经被提出。这些寻求通过(i)以加快搜​​索时间减少每个匹配操作或(ii)降低在搜索区域中考虑的点的数量的成本。在快速匹配(FM)技术中,典型的方法是计算基于所述像素块中的一个子集的成本函数。在快速搜索(FS)接近,所述复杂性降低来自限制基于固定的规则或基于已经计算的其他块或先前帧的运动矢量初始化点的在搜索区域的数量,。在本文中,我们使用作为基线算法属于FS类initialize-精炼技术。我们专注于软件实时视频编码,它允许使用可变复杂算法的灵活性的情况下。因此,我们修改我们使用拉格朗日乘数法相似,其使我们能够明确地考虑到搜索的复杂性和剩余帧能量之间的权衡基线算法。此外,我们具有用于SAD估计的新颖快速匹配方法,其允许我们基于在一个特定的块中的像素的连续子集来估计SAD结合此算法。这种方法自然具有计算的可扩展性,因为我们可以停止框架,使我们的自由多了一个程度,以控制复杂性/剩余能量权衡。我们表明,合并算法实现了计算时间的25%左右降低相对于原来的算法不SAD估计。这些结果通过设计为典型的序列,并且其中测试用于匹配过程的早期终止如果它们虽然是值得的整体复杂性的术语仅包含最优化的测试结构进一步改善。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号