A new fast block matching algorithm based on block sum pyramid

Nenghai Yu, Hao Chen, Zhengkai Liu, Xuelong Li, Feng Niu

Research output: Contribution to journalConference articlepeer-review

Abstract

In this correspondence, a new block sum pyramid algorithm (NBPSA) to motion estimation is presented. Compared with BSPA, NBSPA estimate the vector of the minimum mean absolute difference (MADmin). In the mean time, instead of update the value level by level, we update the estimation of MAD row by row, up to down. Experimental results showed that, with the search result of the algorithm identical to the search result of the exhaustive search and BSPA, NBSPA reduced the computation complexity greatly.

Original languageEnglish
Pages (from-to)559-566
Number of pages8
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume4875
Issue number1
DOIs
StatePublished - 2002
EventSecond International Conference on Image and Graphics - Hefei, China
Duration: 16 Aug 200218 Aug 2002

Keywords

  • Block matching
  • Block sum pyramid
  • Minkowski's inequality
  • Motion estimation

Fingerprint

Dive into the research topics of 'A new fast block matching algorithm based on block sum pyramid'. Together they form a unique fingerprint.

Cite this