An Improved Multilevel Successive Elimination Algorithm for Fast Full-Search Block Matching 


Vol. 27,  No. 9, pp. 900-907, Sep.  2002


PDF
  Abstract

It is well known that a lot of computations are used for the motion estimation process in video coding. Recently, the MSEA was proposed to reduce the computation cost required for block matching in the motion estimation while keeping their accuracy. The MSEA evaluates lower bounds for the matching criteria for subdivided blocks in order to reduce the number of search positions. In this paper, we show that the lower bounds are calculated efficiently by using a lower bound that is already calculated for the first level. Based on this result, we propose a new fast full search motion estimation algorithm, in which the computation cost required for calculation of the lower bounds is reduced. The simulation results show that the proposed algorithm achieves computational saving as compared with the MSEA.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. Ahn and Y. Moon, "An Improved Multilevel Successive Elimination Algorithm for Fast Full-Search Block Matching," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 9, pp. 900-907, 2002. DOI: .

[ACM Style]

Tae-gyoung Ahn and Yong-ho Moon. 2002. An Improved Multilevel Successive Elimination Algorithm for Fast Full-Search Block Matching. The Journal of Korean Institute of Communications and Information Sciences, 27, 9, (2002), 900-907. DOI: .

[KICS Style]

Tae-gyoung Ahn and Yong-ho Moon, "An Improved Multilevel Successive Elimination Algorithm for Fast Full-Search Block Matching," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 9, pp. 900-907, 9. 2002.