DocumentCode :
352257
Title :
Simplex minimisation for multiple-reference motion estimation
Author :
Mualla, Mohammed E Al ; Canagarajah, Nishan ; Bull, David R.
Author_Institution :
Image Commun. Group, Bristol Univ., UK
Volume :
4
fYear :
2000
fDate :
2000
Firstpage :
733
Abstract :
This paper investigates the properties of the multiple-reference block motion field. Guided by the results of this investigation, the paper proposes three fast multiple-reference block matching motion estimation algorithms. The proposed algorithms are extensions of the single-reference simplex minimisation search (SMS) algorithm. The algorithms provide different degrees of compromise between prediction quality and computational complexity. Simulation results using a multi-frame memory of 50 frames indicate that the proposed multiple-reference SMS algorithms have a computational complexity comparable to that of single-reference full-search while still maintaining the prediction gain of multiple-reference motion estimation
Keywords :
computational complexity; minimisation; motion estimation; computational complexity; multiple-reference block matching motion estimation algorithm; prediction quality; simplex minimisation search; Application software; Computational complexity; Computational modeling; Distortion measurement; Image communication; Minimization methods; Motion estimation; Predictive models; Video codecs; Video coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on
Conference_Location :
Geneva
Print_ISBN :
0-7803-5482-6
Type :
conf
DOI :
10.1109/ISCAS.2000.858856
Filename :
858856
Link To Document :
بازگشت