English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49433/84396 (59%)
造訪人次 : 7465014      線上人數 : 88
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/90456

    題名: Fast block matching using prediction and rejection criteria
    作者: Liaw, Yi-Ching;Lai, Jim Z.C;Hong, Zuu-Chang
    貢獻者: 淡江大學機械與機電工程學系
    關鍵詞: Motion estimation;Block matching;Sum pyramid;Prediction
    日期: 2009-06
    上傳時間: 2013-06-26 11:32:52 (UTC+8)
    出版者: Amsterdam: Elsevier BV
    摘要: In this paper, we present a fast block matching algorithm by making use of the correlation between layers of the sum pyramid for a block. To speed our method, an algorithm is also developed to predict the initial motion vector for a template block. Using the elimination criteria and predicted motion vector, our method can further reduce the computational complexity significantly. Compared with the full search block matching algorithm, our approach can reduce the computing time by a factor of 9.9–28.2 with the peak signal-to-noise ratio (PSNR) degradation of 0.00–0.03 dB. Compared to WinUpMI, which is the fastest block matching algorithm preserving global optimality as far as we know, our method can reduce the computing time by 4.9–52.5% with the PSNR degradation of 0.00–0.03 dB. Our method can reduce the computing time of predictive search area approach for fast block motion estimation (PSAFBME) by 50–96% with about the same PSNR.
    關聯: Signal Processing 89(6), pp.1115–1120
    DOI: 10.1016/j.sigpro.2008.12.012
    顯示於類別:[機械與機電工程學系暨研究所] 期刊論文


    檔案 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋