thesis

Fast block matching motion estimation algorithms for video compression

Abstract

As the telecommunication technology grows in the modern era from internet to video conferencing, Video compression has become an avoidable feature in information broadcast and also in the entertainment media. In this thesis we compared a different block matching motion estimation algorithms to find the motion estimation with a rapid growth of multimedia information; when transmitting a large amount of data video coding standards have become crucial. Motion estimation ascertain to be the key to splendid performance in video coding by recover the temporal redundancy effectively between adjacent frames, so it has been widely used to popular video compression coding standards such as MPEG-2, MPEG-4 and recent video coding standards H.264 of video data for storage and transmission. So Based on the study of motion vector distribution from several commonly used test image sequences, a three step diamond search [TSDS]algorithm for fast block matching motion estimation is proposed in this paper .The performance of this algorithm is compared with other existing algorithms of basic full search [FS], three step search [TSS] and diamond search [DS] by means of error metrics and no of search points in this the simulation results shows that the proposed three step diamond search algorithm achieves close performance with that of diamond search [DS] and uses less no of search points than the three step search[TSS]. When compared with original diamond search [DS] algorithm, this algorithm requires less computation time and gives an improved performance

    Similar works