中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/29082
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 78937/78937 (100%)
造访人次 : 39154699      在线人数 : 652
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29082


    题名: Multi-direction search algorithm for block motion estimation in H.264/AVC
    作者: Lin,CC;Lin,Y;Hsieh,HJ
    贡献者: 通訊工程研究所
    关键词: PATTERNS
    日期: 2009
    上传时间: 2010-06-29 20:12:51 (UTC+8)
    出版者: 中央大學
    摘要: Many efficient search algorithms such as three-step search, new three-step search, four-step search, block-based gradient descent search, diamond search and hexagon-based search are developed for block motion estimation ( ME) to search for the optimal objective function. The block ME technique involves an optimisation problem. Although these algorithms can converge to a minimal point rapidly, they suffer from becoming trapped in local minimum if the objective function has multiple minima. To solve this problem, the hybrid multi-hexagon-grid search (UMHexagonS) algorithm has been proposed in H.264/AVC, in which an unsymmetrical-cross search and an uneven UMHexagonS are employed over a wide search range to find a nearly global minimum. The experiment shows that the hybrid UMHexagonS algorithm is computation expensive and is occasionally trapped in local minimum. The authors propose a novel and fast search algorithm, called multi-direction search (MDS) algorithm, which uses an MDS first to find all possible locally optimal points and then uses the extended hexagon search to re. ne these points for the final optimal motion vector. The experimental results indicate that a significant improvement in computation reduction (similar to 30 and 50% reduction in average search points, corresponding to 19 and 37% reduction in total encoding time, for MDS and fast MDS, respectively) can be achieved while maintaining better coding performance, compared with the hybrid UMHexagonS algorithm.
    關聯: IET IMAGE PROCESSING
    显示于类别:[通訊工程研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML763检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明