Share Email Print

Proceedings Paper

Fast motion estimation algorithm with adjustable search area
Author(s): Chun-Hung Lin; Ja-Ling Wu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Full search block-matching algorithm (FBMA) was shown to be able to produce the best motion compensated images among various motion estimation algorithms. However, huge computational load inhibits its applicability in real applications. A lot of different methods, with lower complexity, have been proposed to speed up the process of motion compensation, but the resultant image quality cannot be as good as FBMA does. A new motion estimated algorithm, with less computational complexity and similar image quality while comparing to FBMA, will be presented in this paper. By considering the relation between neighboring blocks, the search area in the algorithm is adjustable. Due to the adaptation of the search area, the computation complexity can be largely reduced and the actual motion vectors can still be found. On the Sun SPARC-II workstation, the speed of the proposed algorithm can be 61 times faster than that of FBMA, maximally.

Paper Details

Date Published: 21 April 1995
PDF: 9 pages
Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206667
Show Author Affiliations
Chun-Hung Lin, National Taiwan Univ. (Taiwan)
Ja-Ling Wu, National Taiwan Univ. (Taiwan)

Published in SPIE Proceedings Vol. 2501:
Visual Communications and Image Processing '95
Lance T. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?