Abstract
To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast kick-off of impossible motion vectors. The fast kick-off of improper motion vectors comes from sequential rejection with derived formula and subblock norms. The sequential rejection of impossible candidates is based on multiple decision boundaries. Our proposed algorithm reduces more the computations than the recent fast full search (FS) motion estimation algorithms.
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
