Publication detail

Analysis of Block Matching Algorithms with Fast Computational and Winner-update Strategies

NAHHAS, I. DRAHANSKÝ, M.

Original Title

Analysis of Block Matching Algorithms with Fast Computational and Winner-update Strategies

Type

journal article - other

Language

English

Original Abstract

Block matching for motion estimation has been widely used in video compression for efficient transmission and storage of video data by reducing the temporal redundancy existing in video sequences. The motion estimation is a process which determines the motion between two frames of a video signal. This paper is primarily a review of the block matching algorithms using fast computational and winner-update strategies. Here are described and analyzed 7 different types of block matching algorithms, namely Full Search (FS), Fast Computational of Full Search (FCFS), Three Step Search (TSS), New Three Step Search (NTSS), Three Step Search with Winner Update Strategy (WinUpTSS), Four Step Search (FSS) and Diamond Search (DS) algorithms.

Keywords

block matching, motion estimation, FS, FCFS, TSS, NTSS, 4SS, DS.

Authors

NAHHAS, I.; DRAHANSKÝ, M.

RIV year

2013

Released

30. 6. 2013

ISBN

2005-4254

Periodical

International Journal of Signal Processing, Image Processing and Pattern Recognition

Year of study

6

Number

3

State

Republic of Korea

Pages from

129

Pages to

137

Pages count

9

URL

http://www.sersc.org/journals/IJSIP/vol6_no3/11.pdf

BibTex

@article{BUT103460,
  author="Ibrahim {Nahhas} and Martin {Drahanský}",
  title="Analysis of Block Matching Algorithms with Fast Computational and Winner-update Strategies",
  journal="International Journal of  Signal Processing, Image Processing and Pattern Recognition",
  year="2013",
  volume="6",
  number="3",
  pages="129--137",
  issn="2005-4254",
  url="http://www.sersc.org/journals/IJSIP/vol6_no3/11.pdf"
}