|Title of host publication||IEEE International Symposium on Circuits and Systems (ISCAS), Geneva|
|Publisher or commissioning body||Institute of Electrical and Electronics Engineers (IEEE)|
|Publication date||May 2000|
|Pages||733 - 736|
|Number of pages||4|
|Conference||International Symposium on Circuits and Systems|
|Period||1/05/00 → …|
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
Rose publication type: Conference contribution
Sponsorship: The authors wish to acknowledge the support of Emirates Telecommunications Corporation (ETISALAT), United Arab Emirate
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to email@example.com.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
International Symposium on Circuits and Systems
|Duration||1 May 2000 → …|