Paper
19 January 1996 Parallel genetic search algorithm for motion estimation
Savio Lai Yin Lam, Ishfaq Ahmad
Author Affiliations +
Abstract
Motion estimation is perhaps the most computationally intensive aspect of video compression. There are two major approaches to motion estimation: pel recursive and block matching. In the former approach, estimation of motion vectors is done recursively such that the motion compensated prediction error at each pel instant is minimized. In the latter approach, motion estimation is carried out on a block-by-block basis. Comparing with the pel recursive algorithms, the block matching algorithms are more realizable due to their computational simplicity. In this paper, we present a parallel algorithm using genetic search for block-based motion. The first objective of the proposed approach is to remove the need for exhaustive search by making use of genetic algorithms (GA). The second objective is to run this algorithm in parallel so that the computing time is further reduced. The algorithm is implemented using the Express library for a network of workstations and NX for the Intel Paragon.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Savio Lai Yin Lam and Ishfaq Ahmad "Parallel genetic search algorithm for motion estimation", Proc. SPIE 2617, Multimedia: Full-Service Impact on Business, Education, and the Home, (19 January 1996); https://doi.org/10.1117/12.230425
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Motion estimation

Gallium

Genetics

Genetic algorithms

Video compression

Video

Binary data

Back to Top