Detail publikace

A New Algorithm for Fast Block-Matching Motion Estimation Based on Four-Neighborhood Blocks

Originální název

A New Algorithm for Fast Block-Matching Motion Estimation Based on Four-Neighborhood Blocks

Anglický název

A New Algorithm for Fast Block-Matching Motion Estimation Based on Four-Neighborhood Blocks

Jazyk

en

Originální abstrakt

Block matching for motion estimation has been widely used in video compression for efficient transmission and storage of video data. The motion estimation is a process which determines the motion between two frames of a video signal. This paper presents a new algorithm for fast block matching algorithm based on Four-neighborhood search (FNS), this algorithm can significantly speed up the computation of the block matching by reducing the number of checked points. Theoretically has been shown that 88% to 92% of operations can be saved while maintaining the quality of video.

Anglický abstrakt

Block matching for motion estimation has been widely used in video compression for efficient transmission and storage of video data. The motion estimation is a process which determines the motion between two frames of a video signal. This paper presents a new algorithm for fast block matching algorithm based on Four-neighborhood search (FNS), this algorithm can significantly speed up the computation of the block matching by reducing the number of checked points. Theoretically has been shown that 88% to 92% of operations can be saved while maintaining the quality of video.

BibTex


@inproceedings{BUT103461,
  author="Ibrahim {Nahhas}",
  title="A New Algorithm for Fast Block-Matching Motion Estimation Based on Four-Neighborhood Blocks",
  annote="Block matching for motion estimation has been widely used in video compression
for efficient transmission and storage of video data. The motion estimation is
a process which determines the motion between two frames of a video signal. This
paper presents a new algorithm for fast block matching algorithm based on
Four-neighborhood search (FNS), this algorithm can significantly speed up the
computation of the block matching by reducing the number of checked points.
Theoretically has been shown that 88% to 92% of operations can be saved while
maintaining the quality of video.",
  address="Faculty of Electrical Engineering and Computing, University of Zagreb",
  booktitle="Processing of EEICT 2013",
  chapter="103461",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Faculty of Electrical Engineering and Computing, University of Zagreb",
  year="2013",
  month="april",
  pages="1--6",
  publisher="Faculty of Electrical Engineering and Computing, University of Zagreb",
  type="conference paper"
}