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

Author

Hsieh, Hsien-Hsi ; Lai, Yeong-Kang

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Dong-Hua Univ., Taiwan, China

Volume

2

fYear

2001

fDate

6-9 May 2001

Firstpage

241

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

Keywords

image matching; image sampling; motion estimation; block matching algorithm; computational complexity; motion estimation; multiple local winners search; pixel sub-sampling pattern; Computational complexity; Computer science; Degradation; Frequency selective surfaces; Genetic algorithms; Motion analysis; Motion estimation; Testing; Video compression; Video sequences;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on

Conference_Location

Sydney, NSW

Print_ISBN

0-7803-6685-9

Type

conf

DOI

10.1109/ISCAS.2001.921052

Filename

921052