A faster pixel-decimation method for block motion estimation in H.264/AVC

Abstract

This work explores the highly advantageous cost/benefit relation presented by low discrepancy sequences as a pixel-decimation technique to improve the block estimation performance in the H.264/AVC. The proposed method is able to efficiently estimate motion vectors for block matching algorithms present in the H.264 by using latticed decimation sampled according to the Van Der Corput-Halton sequences. This paper further explores motion estimation within the H.264, validating it with real-casevideo-encoding scenarios. The results have shown that this technique incorporated to the H.264 is generally more efficient than other decimation techniques used in similar conditions.

An efficient field programmable gate array based hardware architecture for efficient motion estimation with parallel implemented genetic algorithm

“…5 Usually, it includes the process of searching the best match of the block in the frame within the selected region by considering the current and previous frames and the difference between the best matched block is said to be motion vectors. [6][7][8] The compression of the video sequence is a lossy process, in which the frame encoded by utilizing the existing frame or by coding itself are said to be inter and intra frames respectively. 9 In reality, there will be a minute loss of bits in a lossless video compression while transmission and this error will gets continued even for the forthcoming frames also.…”