A new fast block matching algorithm for video files with much inter-frame difference
ISTASC'06 Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
A video coding technique using octagonal motion search and BTC-PF method for fast reconstruction
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Expert Systems with Applications: An International Journal
A fast partial distortion elimination algorithm using selective matching scan
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A fast full search algorithm for motion estimation using priority of matching scan
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part I
Fast motion estimation scheme for real time multimedia streaming with h.264
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
A fast full search algorithm for variable block-based motion estimation of h.264
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
A fast PDE algorithm using adaptive matching scan order for real-time video coding
ICIAR'10 Proceedings of the 7th international conference on Image Analysis and Recognition - Volume Part I
Level-set-based motion estimation algorithm for multiple reference frame motion estimation
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
An improved fast full-search algorithm for motion estimation is proposed. The computational process of the sum of absolute difference and the multilevel successive elimination algorithm (MSEA) are theoretically analysed. Based on these analyzes, a new detection criterion and an estimation of the starting level are proposed in order to reduce the computations required for judging invalid candidate blocks. The simulation results show that the proposed algorithm achieves a computational timesaving of about 40% compared with the MSEA.