Abstract
<p indent=0mm>Motion estimation is a basic problem in the fields of video image compression and video image restoration. The traditional block matching methods have good search quality, but the search speed is not fast enough. Aiming at the shortcomings of the search speed in the traditional block matching methods, we proposed a fast one-dimensional block matching motion estimation algorithm. Firstly, the motion vector is orthogonally decomposed, and the two-dimensional matching block is reduced by a special weight coefficient matrix to obtain two sets of one-dimensional feature matrices. Then the one-dimensional three step search method is selected as the search strategy. The sum of absolute differences criterion is used as the matching criterion. The two sets of one-dimensional feature matrices are used to search for the two components of the matching motion vector. Finally the two components are formed into a complete motion vector. The results of multiple sets of comparative experiments show that the search speed of motion estimation is significantly improved while the algorithm is guaranteed to quantitatively evaluate the PSNR. The higher the video definition and the larger the pixel size of the matching block, the better the algorithm can improve the search speed of motion estimation.
Published Version (
Free)
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