Enhanced block motion estimation based on distortion-directional search patterns
Pattern Recognition Letters
An adaptive and fast fractional pixel search algorithm in H.264
Signal Processing
Small-diamond-based search algorithm for fast block motion estimation
Image Communication
A search patterns switching algorithm for block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
Super-resolution reconstruction of video sequences based on back-projection and motion estimation
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
Prediction-based directional search for fast block-matching motion estimation
Proceedings of the 2010 Symposium on Information and Communication Technology
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
OTS and central expanding blocks scan for interframe compression
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
A user-centric system for home movie summarisation
MMM'11 Proceedings of the 17th international conference on Advances in multimedia modeling - Volume Part I
A fast lossless multi-resolution motion estimation algorithm using selective matching units
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Multimedia Tools and Applications
Motion vector extrapolation for parallel motion estimation on GPU
Multimedia Tools and Applications
Information Sciences: an International Journal
Hi-index | 0.00 |
The three-step search algorithm has been widely used in block matching motion estimation due to its simplicity and effectiveness. The sparsely distributed checking points pattern in the first step is very suitable for searching large motion. However, for stationary or quasistationary blocks it will easily lead the search to be trapped into a local minimum. In this paper we propose a modification on the three-step search algorithm which employs a small diamond pattern in the first step, and the unrestricted search step is used to search the center area. Experimental results show that the new efficient three-step search performs better than new three-step search in terms of MSE and requires less computation by up to 15% on average.