New Efficient Block-based Motion Estimation Algorithms for Video Compression and Their Hardware Implementations
Author | : |
Publisher | : |
Total Pages | : |
Release | : 2002 |
ISBN-10 | : OCLC:680288353 |
ISBN-13 | : |
Rating | : 4/5 ( Downloads) |
Download or read book New Efficient Block-based Motion Estimation Algorithms for Video Compression and Their Hardware Implementations written by and published by . This book was released on 2002 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Video compression technology aims at compressing large amount of video data for efficient transmission and storage without significant loss of quality. Most video compression techniques rely on removing temporal data redundancy between frames using motion estimation and motion compensation techniques which are generally very computationally expensive. The objective of the research done in this thesis is to develop new efficient motion estimation techniques that reduce the computational complexity of motion estimation. The thesis presents a new prediction technique referred to as weighted sum block matching (WSBM) which dynamically reduces the computational complexity by limiting the search to a small subset of the search area. Simulation results have shown that adding WSBM to some well-known search algorithms reduces their computational complexity by 6-1.5 without affecting the visual quality of the reconstructed video frames. The thesis also presents two new algorithms based on the simplex optimization method. the simplex based block matching algorithm (SMPLX) and the flexible triangle search (FTS). Both techniques use a triangle that moves inside the search area and checks only positions that lie at its vertices. As a result the computational complexity of the search is reduced since it depends directly on the number of positions checked. The techniques can change the size and orientation of the search triangle during the search. The changes make the search highly flexible and efficient and reduce the number of search positions to be checked compared to those in other search algorithms. The SMPLX uses equations based on the simplex optimization method to compute the new triangle size and orientation. The FTS, on the other hand, was implemented to be more suitable for a digital search grid by using look-up tables and integer computations. The two algorithms were implemented as part of the H.263 and H.264 encoders. Both algorithms were compared to the state of the a.