Abstract

In this paper, we propose an adaptive motion search window location algorithm which incorporates multiresolution motion estimation information and the motion vector information predicted from neighboring encoded blocks. To reduce the computational complexity, we employ the spatial and temporal search range reduction that we proposed in H. Chung, A. Ortega (2002). Our proposed fast search is implemented and tested in the emerging H.264 encoder reference software (JM5.0c). The proposed motion estimation algorithm is implemented in the low-complexity mode of motion estimation and mode decision (T. Wiegand (2002)). We compare the proposed algorithm with the full-search method which checks the distortion values of all the candidates in the given search area. With respect to the full-search method, our proposed algorithm has two advantages. First, due to the spatial and temporal search range reduction, our algorithm is faster. Second, due to the multiresolution search, our proposed algorithm can use larger motion search range with small additional complexity. The proposed algorithm can significantly reduce the computational complexity of motion estimation with slight increase in bit rate as compared to a full-search that covers the same motion range over which our proposed fast search operates. The proposed algorithm provides particularly significant gains for video sequences that contain large motions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.