A fast partial distortion elimination algorithm using selective matching scan
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Fast full search motion estimation algorithm using early detection of impossible candidate vectors
IEEE Transactions on Signal Processing
IEEE Transactions on Consumer Electronics
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
A new diamond search algorithm for fast block-matching motion estimation
IEEE Transactions on Image Processing
A multilevel successive elimination algorithm for block matching motion estimation
IEEE Transactions on Image Processing
Successive elimination algorithm for motion estimation
IEEE Transactions on Image Processing
Normalized partial distortion search algorithm for block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
Hexagon-based search pattern for fast block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
Fast full-search motion estimation based on multilevel successive elimination algorithm
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
Full search motion estimation in real-time video coding requires large amount of computations. Reducing computational cost for full search motion estimation is critical research issue for enabling fast real-time video coding such as MPEG-4 advanced video coding. In this paper, we propose a fast partial distortion algorithm using probability improvement of sub-block uniform distribution. Our algorithm uses normalized dithering matching scan to get uniform distribution of partial distortion, and based on normalized dithering order matching scan and calibration of threshold error using LOG value for each sub-block continuously for efficient elimination of unlike candidate blocks fast while keeping the same prediction quality compared with the full search algorithm. Our algorithm reduces about 65% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any prediction quality.