Publication Details

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

NAHHAS, I.; DRAHANSKÝ, M. Analysis of Block Matching Algorithms with Fast Computational and Winner-update Strategies. International Journal of Signal Processing, Image Processing and Pattern Recognition, 2013, vol. 6, no. 3, p. 129-137. ISSN: 2005-4254.
Czech title
Analýza algoritmů porovnávání bloků s rychlými výpočetními a vítězně-aktualizačními strategiemi
Type
journal article
Language
English
Authors
Nahhas Ibrahim, Ing.
Drahanský Martin, prof. Ing., Ph.D.
URL
Keywords

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

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.

Published
2013
Pages
129–137
Journal
International Journal of Signal Processing, Image Processing and Pattern Recognition, vol. 6, no. 3, ISSN 2005-4254
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"
}
Back to top