Design and analysis of fast search motion estimation architecture for video compression

Abstract

In the 21st century, video communication plays an important role in various multimedia communications, from internet streaming to HDTV broadcasting. A video usually consumes a great deal of storage space. Hence, video compression is needed. Motion estimation plays a vital role in video compression. This paper discusses the design and analysis of motion estimation using the unsymmetrical multihexagon search (UMHexagonS) fast search algorithm. The architecture consists of pixel buffers, processing elements, adder tree, comparator unit and control unit. The result shows that the architecture is able to perform the complete motion estimation effectively with a minimum clock cycle of 32612.

An Adaptive Motion Estimation Scheme for Video Coding

“…Huayi et al [ 22 ] combined the single instruction multiple data with software algorithm. Jambek et al [ 23 ] set up the architecture that consists of pixel buffers, processing elements, adder tree, comparator unit, and control unit based on UMHexagonS algorithm. Besides, New-UMHexagonS (NUMHexagonS) algorithm involves the preliminary discussions on macroblock correlation [ 24 ].…”

A Fast Motion Estimation Algorithm Based on Motion Vector Distribution Prediction

“…Although UMHexagonS algorithm overcomes the above shortcomings, it still has calculation redundancy. In recent year, some proposed algorithms [8][9][10] based on UMHexagonS have been improved. Besides, a named New-UMHexagonS (NUMHexagonS) algorithm involves with the preliminary discussions on macro-block correlation and achieves a good effect on optimizing UMHexagonS algorithm.…”