English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 57615/91160 (63%)
造访人次 : 13550241      在线人数 : 341
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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
    显示于类别:[機械與機電工程學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数
    1-s2.0-S0165168408004118-main.pdf969KbAdobe PDF0检视/开启



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