Paper
21 April 1995 Fast motion estimation algorithm with adjustable search area
Chun-Hung Lin, Ja-Ling Wu
Author Affiliations +
Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206667
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chun-Hung Lin and Ja-Ling Wu "Fast motion estimation algorithm with adjustable search area", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206667
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Motion estimation

Image quality

Radon

Tellurium

Distortion

Image processing

Relativity

Back to Top