This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2000 International Symposium on Multimedia Software Engineering
Nobel Successive Elimination Algorithms for the Estimation of Motion Vectors
2000 International Symposium on Multimedia Software Engineering 2000 (vol. 0 no. 0)
pp. 332
In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Nobel Successive Elimination Algorithms for the Estimation of Motion Vectors are based on the Successive Elimination Algorithm for Motion Estimation [l] and the Fast Algorithms for the Estimation of Motion Vectors [2]. Nobel Successive Elimination Algorithms effectively eliminate the search points within the search window and thus decreasing the number of matching evaluation that requires very intensive computations. The efficiency of the each proposed algorithm was verified by experimental results
Citation:
Soo-Mok Jung, Sung-Chul Shin, Hyunki Baik, Myong-S Park, "Nobel Successive Elimination Algorithms for the Estimation of Motion Vectors," Microelectronics Systems Education, IEEE International Conference on, vol. 0, no. 0, pp. 332, 2000 International Symposium on Multimedia Software Engineering 2000, doi:10.1109/MMSE.2000.897232
Usage of this product signifies your acceptance of the Terms of Use.