检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]天津理工大学计算机与通信工程学院,通信器件教育部工程研究中心,天津
出 处:《光电子》2011年第2期16-20,共5页Optoelectronics
基 金:2010年天津市科技创新专项资金项目(10FDZDGX00400)。
摘 要:运动估计是视频编码的关键技术,H.264编码器中的运动估计采用UMHexagonS算法,具有良好的综合性能,但其运算量仍比较大,难以满足实时编码的要求。本文基于MVFAST算法图像运动复杂度,提出了一种UMHexagonS的改进算法。依据ROS(支撑域),通过在水平垂直的四个方向上分别设置搜索范围,建立了非搜索中心对称的动态窗口,用更小的搜索范围覆盖了最佳匹配点,进一步减小了搜索点数;进一步根据图像运动复杂度,优化了起始搜索模板的选择策略,直接减少了中等和低等运动复杂度视频序列的计算量。实验表明,与UMHexagonS算法相比,改进后的算法在获得几乎同等重建图像质量和码率的同时,运动估计时间平均节省了24.53%;与对照文献相比算法节省了6.24%,有效的提高了编码器的实时性。Structural Motion estimation is the key technology of Video coding, The UMHexagonS algorithm of H.264 encoder has a good overall performance, while its computation is still relatively large to meet the requirement of real-time encoding. In this paper, based on the complexity of image motion in MVFAST algorithm, an improved UMHexagonS algorithm is proposed. Based on ROS (region of support), by setting search range separately in the four directions of horizontal and vertical, a dynamic search window was established to covering the best match point using a smaller search window;Further according to the image motion complexity, the selection strategy of initial search template was optimized , which directly reduce the computation of low and middle complexity of motion video sequence. Experiments show that, compared to UMHexagonS algorithm, our optimized algorithm can save about 24.53% ME time but almost has no change in the reconstructed picture quality and bitrate;and ME time is 6.24% lesser than compared algorithm as well as enhance the real-time performance of the encoder.
关 键 词:H.264 UMHEXAGONS 运动估计 运动复杂度 MVFAST
分 类 号:TN91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15