DocumentCode
2532172
Title
Bit reduction based matching criterion for motion compensation in video coding
Author
Jain, Anchal
Author_Institution
Dept. of Comput. Sci. & Eng., Krishna Inst. of Eng. & Technol., Ghaziabad, India
fYear
2009
fDate
14-16 March 2009
Firstpage
36
Lastpage
39
Abstract
Video data compression uses interframe coding to remove temporal redundancy and motion compensation plays a vital role in it. Generally, the block matching techniques are used for motion compensation and the matching criterions used are mean absolute difference (MAD) and mean square error (MSE). MSE has more computation than MAD and therefore, MAD is the most preferred block matching criterion for its low computation and simplicity. It has been found that MAD does not satisfies the low bit rate requirement for coding purposes as it considers the average value of the residue frame. In this paper, an efficient block matching criterion for motion compensation is being proposed and compared with MAD and MSE. Experimental results show that the proposed criterion gives better results in terms of peak signal to noise ratio (PSNR) and average bits/pixel value.
Keywords
data compression; mean square error methods; motion compensation; video coding; bit reduction; block matching; interframe coding; matching criterion; mean absolute difference; mean square error; motion compensation; temporal redundancy; video coding; video data compression; Computational complexity; Data engineering; Discrete cosine transforms; Hardware; Minimax techniques; Motion compensation; Motion estimation; PSNR; Redundancy; Video coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia, Signal Processing and Communication Technologies, 2009. IMPACT '09. International
Conference_Location
Aligarh
Print_ISBN
978-1-4244-3602-6
Electronic_ISBN
978-1-4244-3604-0
Type
conf
DOI
10.1109/MSPCT.2009.5164168
Filename
5164168
Link To Document