Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. Global elimination algorithm and architecture design for fast block matching motion estimation
 
  • Details

Global elimination algorithm and architecture design for fast block matching motion estimation

Journal
IEEE Transactions on Circuits and Systems for Video Technology
Journal Volume
14
Journal Issue
6
Pages
898-907
Date Issued
2004
Author(s)
Huang, Yu-Wen
SHAO-YI CHIEN  
Hsieh, Bing-Yu
LIANG-GEE CHEN  
DOI
10.1109/TCSVT.2004.828321
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-2942685407&doi=10.1109%2fTCSVT.2004.828321&partnerID=40&md5=9d81ac4524caa43fcea66a7f00630d3d
http://scholars.lib.ntu.edu.tw/handle/123456789/309284
http://ntur.lib.ntu.edu.tw/bitstream/246246/141440/1/25.pdf
Abstract
This paper presents a new block matching motion estimation algorithm and its VLSI architecture design. The proposed global elimination algorithm (GEA) was derived from successive elimination algorithm (SEA), which can skip unnecessary sum of absolute difference (SAD) calculation by comparing minimum SAD with subsampled SAD (SSAD). Our basic idea is to separate the decision of early termination and SAD calculation for each candidate block to make data flow more regular and suitable for hardware. In short, we first compare the rough characteristics of all candidate blocks with the current block (SSAD). In turn, we select several best roughly matched candidate blocks to re-compare them with the current block by using detailed characteristics (SAD). Other features of GEA include fixed processing cycles, no initial guess, and high video quality (almost the same as full search). Unlike other fast algorithms, the mapping of GEA to hardware is very simple. We proposed an architecture that is composed of a systolic part to efficiently compute SSAD, an adder tree to support both SSAD and SAD calculations, and a comparator tree to avoid expensive sorting circuits. Simulation results show that our design is much more area efficient than many full-search architectures while maintaining high video quality and processing capability.
Subjects
Block matching; Global elimination algorithm (GEA); Motion estimation (ME); Successive elimination algorithm (SEA)
SDGs

[SDGs]SDG14

Other Subjects
Block matching; Global elimination algorithm (GEA); Motion estimation (ME); Successive elimination algorithm (SEA); Algorithms; Computational methods; Computer simulation; Image coding; Image quality; Signal to noise ratio; Standards; Systolic arrays; VLSI circuits; Motion estimation
Type
journal article
File(s)
Loading...
Thumbnail Image
Name

25.pdf

Size

541.51 KB

Format

Adobe PDF

Checksum

(MD5):4a7e96f56a684a522bf2e0eb073beb3e

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science