Advanced multilevel successive elimination algorithms for motion estimation inv ideo coding

Soo Mok Jung, Sung Chul Shin, Hyunki Baik, Myong Soon Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we present advanced algorithms to reduce the computation cost of block matching algorithms for motion estimation in video coding. Advanced Multilevel Successive Elimination Algorithms are based on Multilevel Successive Elimination Algorithm for Block Matching Motion Estimation [1] and Successive Elimination Algorithm [2]. Advanced Multilevel Successive Elimination Algorithms consist of three algorithms. The second algorithm is useful not only for Multilevel Successive Elimination Algorithm but also for all kinds of block matching algorithms. The efficiency of the proposed algorithms was verified by experimental results.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages431-442
Number of pages12
Volume1983
ISBN (Print)3540414509, 9783540414506
Publication statusPublished - 2000
Event2nd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2000 - Shatin, N.T., Hong Kong
Duration: 2000 Dec 132000 Dec 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1983
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2000
CountryHong Kong
CityShatin, N.T.
Period00/12/1300/12/15

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Advanced multilevel successive elimination algorithms for motion estimation inv ideo coding'. Together they form a unique fingerprint.

Cite this