H.264/AVC offers many coding tools for achieving high compression gains of up to 50% more than other standards. These tools dramatically increase the computational complexity of the block based motion estimation (BB-ME) which consumes up to 80% of the entire encoder's computations. In this paper, computationally efficient accurate skipping models are proposed to speed up any BB-ME algorithm. First, an accurate initial search center (ISC) is decided using a smart prediction technique. Thereafter, a dynamic early stop search termination (DESST) is used to decide if the block at the ISC position can be considered as a best match candidate block or not. If the DESST algorithm fails, a less complex style of the motion estimation algorithm which incorporates dynamic padding window size technique will be used. Further reductions in computations are achieved by combining the following two techniques. First, a dynamic partial internal stop search technique which utilizes an accurate adaptive threshold model is exploited to skip the internal sum of absolute difference operations between the current and the candidate blocks. Second, a dynamic external stop search technique greatly reduces the unnecessary operations by skipping all the irrelevant blocks in the search area. The proposed techniques can be incorporated in any block matching motion estimation algorithm. Computational complexity reduction is reflected in the amount of savings in the motion estimation encoding time. The novelty of the proposed techniques comes from their superior saving in computations with an acceptable degradation in both peak signal-to-noise ratio (PSNR) and bit-rate compared to the state of the art and the recent motion estimation techniques. Simulation results using H.264/AVC reference software (JM 12.4) show up to 98% saving in motion estimation time using the proposed techniques compared to the conventional full search algorithm with a negligible degradation in the PSNR by approximately 0.05-
dB and a small increase in the required bits per frame by only 2%. Experimental results also prove the effectiveness of the proposed techniques if they are incorporated with any fast BB-ME technique such as fast extended diamond enhanced predictive zonal search and predictive motion vector field adaptive search technique.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :In-Memory Stream Indexing of Massive and Fast Incoming Multimedia Content - 2018ABSTRACT:In this text, a media storm indexing mechanism is presented, where media storms are outlined as quick incoming batches. We
PROJECT TITLE :Fast Low-Rank Bayesian Matrix Completion With Hierarchical Gaussian Prior Models - 2018ABSTRACT:The problem of low-rank matrix completion is taken into account in this Project. To use the underlying low-rank structure
PROJECT TITLE :A Fast Converging Channel Estimation Algorithm for Wireless Sensor Networks - 2018ABSTRACT:A group-membership affine projection algorithm is proposed which will estimate a complicated-valued channel matrix using
PROJECT TITLE :Fast Cell Discovery in mm-Wave 5G Networks with Context Information - 2018ABSTRACT:The exploitation of mm-wave bands is one amongst the key-enabler for 5G mobile radio networks. However, the introduction of mm-wave
PROJECT TITLE :Fast and Reliable Restoration Method of Virtual Resources on OpenStack - 2018ABSTRACT:We propose a quick and reliable restoration technique of virtual resources on OpenStack when physical servers or virtual machines

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry