Genetic Motion Search Algorithm for Video Compression

This paper presents a new approach to block-based motion estimation, called genetic motion search (GMS) algorithm for video compression. It makes use of a natural processing concept called genetic algorithm (GA). In contrast to the existing fast algorithms, which rely on the assumption that the matching error decreases monotonically as the searched point moves closer to the global optimum, GMS algorithm is not fundamentally limited by this restriction. Experimental results demonstrate that GMS is more robust than other algorithms in locating the global optimum and is computationally simpler compared to the full search algorithm. GMS algorithm is also suitable for VLSI implementation because of its regularity and high parallelism in architecture.