A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search

Hsien His Hsieh; Yong Kang Lai

doi:10.1109/ISCAS.2001.921052

A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search

Hsien His Hsieh, Yong Kang Lai

National Dong Hwa University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

In this paper, a novel fast algorithm for block motion estimation is proposed. The reduction of computation complexity is obtained from the use of pixel sub-sampling on block matching instead of limiting the number of searching locations. Further, in order to get the better quality, this algorithm uses a technique of multiple local winners. From the experimental result, the proposed algorithm produces better performance than some other fast block-matching algorithms like three-step search (TSS), four-step search (FSS), new three-step search (NTSS), new diamond search (DS), hybrid search (HBS) and four-step genetic algorithm (4GA). That is, the performance of proposed algorithm not only reduces the computational time but also improves the accuracy of motion vectors.

Original language	English
Title of host publication	ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Pages	241-244
Number of pages	4
DOIs	https://doi.org/10.1109/ISCAS.2001.921052
State	Published - 2001
Externally published	Yes
Event	2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 - Sydney, NSW, Australia Duration: 06 05 2001 → 09 05 2001

Publication series

Name	ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Volume	2

Conference

Conference	2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001
Country/Territory	Australia
City	Sydney, NSW
Period	06/05/01 → 09/05/01

Access to Document

10.1109/ISCAS.2001.921052

Cite this

Hsieh, H. H., & Lai, Y. K. (2001). A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search. In ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings (pp. 241-244). Article 921052 (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings; Vol. 2). https://doi.org/10.1109/ISCAS.2001.921052

@inproceedings{02514fe2b7fb494caf28347536e4093e,

title = "A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search",

abstract = "In this paper, a novel fast algorithm for block motion estimation is proposed. The reduction of computation complexity is obtained from the use of pixel sub-sampling on block matching instead of limiting the number of searching locations. Further, in order to get the better quality, this algorithm uses a technique of multiple local winners. From the experimental result, the proposed algorithm produces better performance than some other fast block-matching algorithms like three-step search (TSS), four-step search (FSS), new three-step search (NTSS), new diamond search (DS), hybrid search (HBS) and four-step genetic algorithm (4GA). That is, the performance of proposed algorithm not only reduces the computational time but also improves the accuracy of motion vectors.",

author = "Hsieh, {Hsien His} and Lai, {Yong Kang}",

year = "2001",

doi = "10.1109/ISCAS.2001.921052",

language = "英语",

isbn = "0780366859",

series = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",

pages = "241--244",

booktitle = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",

note = "2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 ; Conference date: 06-05-2001 Through 09-05-2001",

}

Hsieh, HH & Lai, YK 2001, A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search. in ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings., 921052, ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings, vol. 2, pp. 241-244, 2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001, Sydney, NSW, Australia, 06/05/01. https://doi.org/10.1109/ISCAS.2001.921052

A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search. / Hsieh, Hsien His; Lai, Yong Kang.
ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings. 2001. p. 241-244 921052 (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search

AU - Hsieh, Hsien His

AU - Lai, Yong Kang

PY - 2001

Y1 - 2001

N2 - In this paper, a novel fast algorithm for block motion estimation is proposed. The reduction of computation complexity is obtained from the use of pixel sub-sampling on block matching instead of limiting the number of searching locations. Further, in order to get the better quality, this algorithm uses a technique of multiple local winners. From the experimental result, the proposed algorithm produces better performance than some other fast block-matching algorithms like three-step search (TSS), four-step search (FSS), new three-step search (NTSS), new diamond search (DS), hybrid search (HBS) and four-step genetic algorithm (4GA). That is, the performance of proposed algorithm not only reduces the computational time but also improves the accuracy of motion vectors.

AB - In this paper, a novel fast algorithm for block motion estimation is proposed. The reduction of computation complexity is obtained from the use of pixel sub-sampling on block matching instead of limiting the number of searching locations. Further, in order to get the better quality, this algorithm uses a technique of multiple local winners. From the experimental result, the proposed algorithm produces better performance than some other fast block-matching algorithms like three-step search (TSS), four-step search (FSS), new three-step search (NTSS), new diamond search (DS), hybrid search (HBS) and four-step genetic algorithm (4GA). That is, the performance of proposed algorithm not only reduces the computational time but also improves the accuracy of motion vectors.

UR - http://www.scopus.com/inward/record.url?scp=0034996815&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2001.921052

DO - 10.1109/ISCAS.2001.921052

M3 - 会议稿件

AN - SCOPUS:0034996815

SN - 0780366859

SN - 9780780366855

T3 - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

SP - 241

EP - 244

BT - ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

T2 - 2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001

Y2 - 6 May 2001 through 9 May 2001

ER -

Hsieh HH, Lai YK. A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search. In ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings. 2001. p. 241-244. 921052. (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings). doi: 10.1109/ISCAS.2001.921052

A novel fast motion estimation algorithm using fixed subsampling pattern and multiple local winners search

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this