Simplex minimisation for multiple-reference motion estimation

MES Al-Mualla; CN Canagarajah; DR Bull

doi:10.1109/ISCAS.2000.858856

Simplex minimisation for multiple-reference motion estimation

MES Al-Mualla, CN Canagarajah, DR Bull

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

4 Citations (Scopus)

349 Downloads (Pure)

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

Translated title of the contribution	Simplex Minimisation for Multiple-Reference Motion Estimation
Original language	English
Title of host publication	IEEE International Symposium on Circuits and Systems (ISCAS), Geneva
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	733 - 736
Number of pages	4
Volume	4
ISBN (Print)	0780354826
DOIs	https://doi.org/10.1109/ISCAS.2000.858856
Publication status	Published - May 2000
Event	International Symposium on Circuits and Systems - Geneva, Switzerland Duration: 1 May 2000 → …

Conference

Conference	International Symposium on Circuits and Systems
Country/Territory	Switzerland
City	Geneva
Period	1/05/00 → …

Bibliographical note

Rose publication type: Conference contribution

Sponsorship: The authors wish to acknowledge the support of Emirates Telecommunications Corporation (ETISALAT), United Arab Emirate

Terms of use: Copyright © 2000 IEEE. Reprinted from IEEE International Symposium on Circuits and Systems, 2000 (ISCAS 2000).

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 protected].

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Access to Document

10.1109/ISCAS.2000.858856

Almulla IEEE ISCAS 2000Accepted author manuscript, 456 KB

http://hdl.handle.net/1983/1503

Handle.net

Persistent link

Cite this

@inproceedings{6433a5b85b964c2db9eccab059540342,

title = "Simplex minimisation for multiple-reference motion estimation",

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",

author = "MES Al-Mualla and CN Canagarajah and DR Bull",

note = "Rose publication type: Conference contribution Sponsorship: The authors wish to acknowledge the support of Emirates Telecommunications Corporation (ETISALAT), United Arab Emirate Terms of use: Copyright {\textcopyright} 2000 IEEE. Reprinted from IEEE International Symposium on Circuits and Systems, 2000 (ISCAS 2000). 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 protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. ; International Symposium on Circuits and Systems ; Conference date: 01-05-2000",

year = "2000",

month = may,

doi = "10.1109/ISCAS.2000.858856",

language = "English",

isbn = "0780354826",

volume = "4",

pages = "733 -- 736",

booktitle = "IEEE International Symposium on Circuits and Systems (ISCAS), Geneva",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

}

Al-Mualla, MES, Canagarajah, CN & Bull, DR 2000, Simplex minimisation for multiple-reference motion estimation. in IEEE International Symposium on Circuits and Systems (ISCAS), Geneva. vol. 4, Institute of Electrical and Electronics Engineers (IEEE), pp. 733 - 736, International Symposium on Circuits and Systems, Geneva, Switzerland, 1/05/00. https://doi.org/10.1109/ISCAS.2000.858856

Simplex minimisation for multiple-reference motion estimation. / Al-Mualla, MES; Canagarajah, CN; Bull, DR.
IEEE International Symposium on Circuits and Systems (ISCAS), Geneva. Vol. 4 Institute of Electrical and Electronics Engineers (IEEE), 2000. p. 733 - 736.

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - Simplex minimisation for multiple-reference motion estimation

AU - Al-Mualla, MES

AU - Canagarajah, CN

AU - Bull, DR

N1 - Rose publication type: Conference contribution Sponsorship: The authors wish to acknowledge the support of Emirates Telecommunications Corporation (ETISALAT), United Arab Emirate Terms of use: Copyright © 2000 IEEE. Reprinted from IEEE International Symposium on Circuits and Systems, 2000 (ISCAS 2000). 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 protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2000/5

Y1 - 2000/5

N2 - 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

AB - 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

U2 - 10.1109/ISCAS.2000.858856

DO - 10.1109/ISCAS.2000.858856

M3 - Conference Contribution (Conference Proceeding)

SN - 0780354826

VL - 4

SP - 733

EP - 736

BT - IEEE International Symposium on Circuits and Systems (ISCAS), Geneva

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - International Symposium on Circuits and Systems

Y2 - 1 May 2000

ER -

Simplex minimisation for multiple-reference motion estimation

Abstract

Conference

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this