Fast motion estimation for video coding
Wei-Song Qi · 2005
Without compression, the transmission and storage of video signals are unpractical and unreliable. In consideration of simplicity and regularity, motion-compensated transform coding scheme is widely adopted by all international video coding standards such as H.261/263/264 and MPEG-1/2/4 to exploit the temporal redundancy between successive video frames. Due to the lower complexity in hardware implementation, block matching method is usually used for practical motion estimation. A large number of fast block matching algorithms (BMAs) have been proposed to reduce the intensive computations of motion estimation. Fast BMAs generally achieve a high speedup gain either by reducing the number of candidates (Fast Search) or by lowering the matching computations at each checking point (Fast Matching). Along each direction, many wellknown algorithms have been developed applying various techniques. In this project, it's our interest and task to develop some more efficient and faster BMAs while maintaining high prediction accuracy.