Detail publikace

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

NAHHAS, I. DRAHANSKÝ, M.

Originální název

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

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

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

Autoři

NAHHAS, I.; DRAHANSKÝ, M.

Rok RIV

2013

Vydáno

30. 6. 2013

ISSN

2005-4254

Periodikum

International Journal of Signal Processing, Image Processing and Pattern Recognition

Ročník

6

Číslo

3

Stát

Korejská republika

Strany od

129

Strany do

137

Strany počet

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