Abstract
To reduce the amount of computation of the full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without degradation of predicted images as in conventional FS. The computational reduction without any degradation in the predicted image comes from fast removal of impossible motion vectors. We obtain faster removal of inappropriate motion vectors using efficient matching units from the localization of complex area in image data. In this paper, we show three properties in block matching of motion estimation. Experimentally, we reduce unnecessary computations by about 30% with our algorithm compared with the conventional fast matching scan algorithm.
Sign-in/Register to access full text options 
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
