Motion estimation algorithms for video compression: Evaluation environment and student projects

Evgeny Kaminsky, Ofer Hadar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

This paper suggests a computer simulation environment for analysis of fast motion estimation (ME) algorithms. We present an architecture for algorithm evaluation, ME algorithms, results, of computer simulations, and illustrate the analysis with tables, FSNR plots, and performance plots. The paper also describes multi-criteria evaluation of algorithms. Two evaluation strategies are suggested: (i) a strategy with constraints and (ii) a strategy with "near" Pareto-efficient points. Four basic test video sequences were used. Our algorithm evaluation environment was effectively used as a basis for student projects.

Original languageEnglish
Title of host publicationProceedings, ITRE 2003 - International Conference on Information Technology
Subtitle of host publicationResearch and Education
Pages573-577
Number of pages5
DOIs
StatePublished - 1 Dec 2003
Event2003 International Conference on Information Technology: Research and Education, ITRE 2003 - Newark, NJ, United States
Duration: 11 Aug 200313 Aug 2003

Publication series

NameProceedings, ITRE 2003 - International Conference on Information Technology: Research and Education

Conference

Conference2003 International Conference on Information Technology: Research and Education, ITRE 2003
Country/TerritoryUnited States
CityNewark, NJ
Period11/08/0313/08/03

Keywords

  • Algorithm evaluation
  • Algorithm evaluation environment
  • Block Matching Algorithms (BMA)
  • Computer simulation
  • Fast motion estimation (ME)
  • Multi-criteria analysis
  • Student projects

ASJC Scopus subject areas

  • Information Systems
  • Education

Fingerprint

Dive into the research topics of 'Motion estimation algorithms for video compression: Evaluation environment and student projects'. Together they form a unique fingerprint.

Cite this