中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/29082
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78852/78852 (100%)
Visitors : 35338420      Online Users : 942
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29082


    Title: Multi-direction search algorithm for block motion estimation in H.264/AVC
    Authors: Lin,CC;Lin,Y;Hsieh,HJ
    Contributors: 通訊工程研究所
    Keywords: PATTERNS
    Date: 2009
    Issue Date: 2010-06-29 20:12:51 (UTC+8)
    Publisher: 中央大學
    Abstract: 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.
    Relation: IET IMAGE PROCESSING
    Appears in Collections:[Graduate Institute of Communication Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML733View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 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 ©   - 隱私權政策聲明