arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.4484cs.CV
收藏

基于和声搜索优化的块匹配运动估计算法

Block matching algorithm based on Harmony Search optimization for motion estimation

Universidad de Guadalajara, CUCEI(瓜达拉哈拉大学)

Erik Cuevas

摘要:

运动估计是发展视频编码应用的主要问题之一。在所有的运动估计方法中,块匹配(BM)算法是最流行的方法,由于其有效性和简单的软件和硬件实现。BM方法假设当前帧的定义区域内的像素的移动可以被建模为包含在先前帧中的像素的平移。在该过程中,通过最小化在来自前一帧的确定的搜索窗口上为当前帧产生的某个匹配度量来获得运动矢量。不幸的是,这种匹配测量的评估在计算上是昂贵的,并且代表BM过程中最消耗的操作。因此,BM运动估计可以被看作是一个优化问题,其目标是在搜索空间内找到最佳匹配块。最简单的可用BM方法是全搜索算法(FSA),其通过对搜索空间的所有元素的穷举计算来找到最准确的运动矢量。最近,已经提出了几种快速BM算法,以通过仅计算运动矢量的固定子集来减少搜索位置,尽管降低了其精度。另一方面,和声搜索(HS)算法是一种基于群体的优化方法,其灵感来自音乐即兴创作过程,其中音乐家搜索和声并继续打磨音高以获得更好的和声。本文提出了一种新的BM算法,结合HS和适应度近似模型。该方法使用属于搜索窗口的运动矢量作为潜在的解决方案。适应度函数评估每个运动矢量候选的匹配质量。

英文摘要:

Motion estimation is one of the major problems in developing video coding applications. Among all motion estimation approaches, Block-matching (BM) algorithms are the most popular methods due to their effectiveness and simplicity for both software and hardware implementations. A BM approach assumes that the movement of pixels within a defined region of the current frame can be modeled as a translation of pixels contained in the previous frame. In this procedure, the motion vector is obtained by minimizing a certain matching metric that is produced for the current frame over a determined search window from the previous frame. Unfortunately, the evaluation of such matching measurement is computationally expensive and represents the most consuming operation in the BM process. Therefore, BM motion estimation can be viewed as an optimization problem whose goal is to find the best-matching block within a search space. The simplest available BM method is the Full Search Algorithm (FSA) which finds the most accurate motion vector through an exhaustive computation of all the elements of the search space. Recently, several fast BM algorithms have been proposed to reduce the search positions by calculating only a fixed subset of motion vectors despite lowering its accuracy. On the other hand, the Harmony Search (HS) algorithm is a population-based optimization method that is inspired by the music improvisation process in which a musician searches for harmony and continues to polish the pitches to obtain a better harmony. In this paper, a new BM algorithm that combines HS with a fitness approximation model is proposed. The approach uses motion vectors belonging to the search window as potential solutions. A fitness function evaluates the matching quality of each motion vector candidate.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑