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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
