Comparison of block-matching algorithms for VLSI implementation

Sheu Chih Cheng*, Hsueh-Ming Hang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

This paper presents an evaluation of several block-matching motion estimation algorithms from a system-level VLSI design viewpoint. Because a straightforward block-matching algorithm (BMA) demands a very large amount of computing power, many fast algorithms have been developed. However, these fast algorithms are often designed to merely reduce arithmetic operations without considering their overall performance in VLSI implementation. In this paper, three criteria are used to compare various block-matching algorithms: (1) silicon area, (2) input/output requirement, and (3) image quality. Several well-known motion estimation algorithms are analyzed under the above criteria. The advantages/disadvantages of these algorithms are discussed. Although our analysis is limited by the preciseness of our silicon area estimation model, it should provide valuable information in selecting a BMA for VLSI implementation.

Original languageEnglish
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
Pages994-1005
Number of pages12
Edition2/-
DOIs
StatePublished - 1 Dec 1996
EventVisual Communications and Image Processing'96. Part 2 (of 3) - Orlando, FL, USA
Duration: 17 Mar 199620 Mar 1996

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Number2/-
Volume2727
ISSN (Print)0277-786X

Conference

ConferenceVisual Communications and Image Processing'96. Part 2 (of 3)
CityOrlando, FL, USA
Period17/03/9620/03/96

Fingerprint Dive into the research topics of 'Comparison of block-matching algorithms for VLSI implementation'. Together they form a unique fingerprint.

Cite this