کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
528852 | 869614 | 2011 | 14 صفحه PDF | دانلود رایگان |

The key to designing a real-time video coding system is efficient motion estimation, which reduces temporal redundancies. The motion estimation of the H.264/AVC coding standard can use multiple references and multiple block sizes to improve rate-distortion performance. The computational complexity of H.264 is linearly dependent on the number of allowed reference frames and block sizes using a full exhaustive search. Many fast block-matching algorithms reduce the computational complexity of motion estimation by carefully designing search patterns with different shapes or sizes, which have a significant impact on the search speed and distortion performance. However, the search speed and the distortion performance often conflict with each other in these methods, and their high computational complexity incurs a large amount of memory access. This paper presents a novel block-matching scheme with image indexing, which sets a proper priority list of search points, to encode a H.264 video sequence. This study also proposes a computation-aware motion estimation method for the H.264/AVC. Experimental results show that the proposed method achieves good performance and offers a new way to design a cost-effective real-time video coding system.
► This paper presents a fast block matching for video coding based on image block indexing.
► The on-the-fly frame indexing is used without a priori learning procedure.
► The framework to compute frame indexing is carefully designed to eliminate the overhead in preparing the frame indexes.
► Coding accuracy is improved as compared with the state-of-the-art methods.
Journal: Journal of Visual Communication and Image Representation - Volume 22, Issue 6, August 2011, Pages 451–464