Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
A fast exhaustive search algorithm for rate-constrained motion estimation
IEEE Transactions on Image Processing
Fast algorithms for the estimation of motion vectors
IEEE Transactions on Image Processing
Successive elimination algorithm for motion estimation
IEEE Transactions on Image Processing
A novel four-step search algorithm for fast block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
A simple and efficient search algorithm for block-matching motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
New fast and efficient two-step search algorithm for block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
Normalized partial distortion search algorithm for block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
A globally adaptive pixel-decimation algorithm for block-motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
IEEE Transactions on Circuits and Systems for Video Technology
Probabilistic partial-distance fast matching algorithms for motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
Fast full-search block matching
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
Block motion estimation is a cpu intensive task for video encoding. Many fast algorithms have been developed to solve this problem, trying to improve both block searching and block matching. Some of them reduce the image quality compared to the full search method in order to improve performance. The algorithm presented in this paper, called Sobol Partial Distortion (SPD) algorithm, is a full search (lossless), fast matching, block motion estimation algorithm, applying partial distortion elimination. It uses a new matching strategy to quickly compute distortion and reduce block matching computation. Image-dependent computation is not required, since the matching strategy does not depend on the frame sequence. The proposed algorithm performs well in terms of computational speedup in comparison with other existing full search algorithms.