Abstract
In this paper, we present an efficient algorithm to reduce the computation cost of block matching algorithms for motion estimation in video coding. Based on a new insight in block matching algorithms, we extend the successive elimination algorithm to the multi-level case. By using the sum norms of the blocks and the subblocks with reduced sizes, tighter and tighter decision boundaries for eliminating the search positions can be obtained in a multi-level manner. The efficiency of the proposed algorithm combined with full search algorithm and several fast search algorithms is verified by simulation results.
Full Text
Published Version
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