标题: | H.264/MPEG-4 AVC 移动估测的快速演算法与架构设计 Fast Algorithms and Architecture Designs for H.264/MPEG-4 AVC Motion Estimation |
作者: | 王裕仁 Yu-Jen Wang 张添烜 Tian-Sheuan Chang 电子研究所 |
关键字: | H.264;位移估测;分数位移估测;动态搜寻范围;位移估测架构;H.264;motion estimation;fast sub-pel motion estimation;dynamic search range;architecture of motion estimation |
公开日期: | 2005 |
摘要: | 随着高解析数位电视时代的来临,为了兼顾大且精致的画面,高压缩率规格(H.264)是我们现行的解决方案。它不仅可有效节省储存媒体所需的空间,同时也可在现行的通讯环境下允许传输更高解析的画面。伴随着种种好处而来的就是极之庞大的运算量,而大量的快速演算法也因此应运而生。如何兼顾画质和运算速度成了当前最重要的课题,而这也是本篇论文的主旨。 根据已出版的文献,位移估测是整个压缩过程中最为费时的。更进一步去了解这个部份,我们可以把他大致上分为整数位移估测和分数位移估测。在原始演算法的条件下,由于搜寻范围较大整数位移估测占去了绝大部分的时间。因此我们非常直觉的认为,若能大幅减少搜寻范围又能使画质维持差不多水准将可以有效节省压缩时程,我们提出的快速演算法能够针对不同解析画面达到88% (352 x 288)和75%(720 x 480)的节省。分数位移估测在原始演算法的架构下,由于搜寻点数远少于整数位移估测所以在整个压缩的过程中并没有决定性的影响。但随着整数位移估测快速演算法的发展,分数位移估测搜寻点数所占的比例慢慢升高,分数位移估测快速演算法也愈来愈有存在的必要性。在单一样式错误表面的假设下,我们利用特定点的错误数值去预测整个搜寻视窗的错误表面。除此之外,我们也引进了提前终止的技术。此分数快速位移估测部分可以减少超过50%的运算量。在整数和分数位移估测同时使用快速演算法的情形下,以1280 x 720为测试解析度,我们可以加速总压缩时间达20倍之钜。另外一种常见的解决方式是利用硬体平行化同时处理多笔资料以达到加速的目的。在分数位移估测方面,拜快速演算法之赐,我们的架构可以减少将近40%面积和加速14%。 With modern day advances in computer processing and multimedia applications, improvements in the area of image processing and video compression are analogous. Video compression allows the reduction of high-resolution video into a more compact memory space to thereby reduce storage and video processing resources during playback. According to the literature published before, we can find that the motion estimation process is the most time consumed part. To further realize this process, we can mainly divide it into two parts: integer motion estimation and fractional motion estimation. Integer motion estimation cost most part of time under the original algorithm unchanged. The main reason is that the search window is too large. So we have a very simple idea that we want to decrease the search window. We can reduce 88% (input sequence as CIF size) and 75% (input sequence as D1 size) search points respectively. Fractional motion estimation will not affect obviously under the original condition. But when the fast algorithm is applied for integer motion estimation, the portion of encoding time due to fractional motion estimation is getting larger. Based on the assumption of uni-modal error surface, we want to use the results of half pixel step to predict the slope of error surface. We also apply early termination technique. We can get 50% search points reduction in this part. By applying both fast algorithms, we get 20 times speed up with the input sequence size as 1280 x 720. Making use of hardware parallelism to speed up is also a common method in H.264 research field. By the benefit of applying fast fractional motion estimation algorithm, we decrease 40% area and speed up by 14% in our fast fractional motion estimation architecture. |
URI: | http://140.113.39.130/cdrfb3/record/nctu/#GT009311624 http://hdl.handle.net/11536/78094 |
显示于类别: | Thesis |
文件中的档案:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.