A Vario-power ME architecture using content-based subsample algorithm
IEEE Transactions on Consumer Electronics
IEEE Transactions on Circuits and Systems for Video Technology
On the data reuse and memory bandwidth analysis for full-search block-matching VLSI architecture
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Motion estimation has been widely employed in popular video standards like H.26x, MPEG - 1,-2 and - 4 to exploit the temporal redundancies inherent within image frames. Block matching is the most popular method for motion estimation. The disadvantages of full search block matching algorithm (FSBMA) are the computational complexity and the huge memory bandwidth requirement. This paper presents a simple technique by which above mentioned disadvantages can be overcome. At first, the frame is divided into 16×16 blocks. From each 16×16 blocks, one 8×8 sub-block is chosen with an assumption that motion may be uniform within a block. Next a subsample algorithm is applied to these sub-blocks. With Matlab6.5 simulation it is proved that the subjective quality of reconstructed frame is exactly same as the original. Also, MSE and SNR calculation shows that the Mean square error and SNR involved in this method is almost same as that involved in FSBMA. The computational complexity is almost one fourth that of FSBMA.