English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13689209      Online Users : 30
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  Complexity-adaptive search algorithm for block motion estimation


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/14294


    Title: Complexity-adaptive search algorithm for block motion estimation
    Authors: Pol Lin Tai
    Chii Tung Liu
    Jia Shung Wang
    教師: 王家祥
    Date: 2001
    Publisher: Institute of Electrical and Electronics Engineers Computer Society
    Relation: "Image Processing, 2001. Proceedings. 2001 International Conference on
    Volume 2, 7-10 Oct. 2001 Page(s):969 - 972 vol.2
    "
    Keywords: adaptive signal processing
    buffer storage
    computational complexity
    motion estimation
    optimisation
    search problems
    Non-controlled Indexing
    Abstract: We propose a complexity-adaptive fast block matching algorithm design strategy that allows the user to terminate the algorithm at any target computational complexity. Two complexity-adaptive techniques, frame level complexity allocation and block level complexity allocation, are developed to approach the global complexity-distortion optimization A buffer control strategy is proposed to dynamically adjust the target complexity of one frame. The predictive complexity-distortion benefit list (PCDB list) technique is employed to allocate the target complexity into each block. By these techniques, we modify the full-search block matching, three-step search, new three-step search, and four-step search to the complexity-adaptive algorithms. Experimental results show that the complexity-adaptive algorithms could achieve better performance than traditional fixed algorithms from the viewpoint of complexity-distoftion optimization
    Relation Link: http://webservices.ieee.org/pindex_basic.html
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/14294
    Appears in Collections:[資訊工程學系] 會議論文
    [資訊系統與應用研究所] 會議論文
    [電腦與通訊科技研發中心] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030211030028.pdf393KbAdobe PDF691View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback