Fast Motion Estimation Algorithm Using Limited Sub-blocks 


Vol. 31,  No. 3, pp. 258-263, Mar.  2006


PDF
  Abstract

Each pixel in a matching block does not equally contribute to block matching and the matching error is greatly affected by image complexity. On the basis of the facts, this paper proposes a fast motion estimation algorithm using some sub-blocks selected by the image complexity. The proposed algorithm divides a matching block into 16 sub-blocks, computes the image complexity in every sub-block, executes partial block matching using some sub-blocks with large complexity, and detects a motion vector. The simulation results show that the proposed algorithm brings about negligible image degradation, but can reduce a large amount of computation in comparison with conventional algorithms.

  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]

S. Kim and J. Oh, "Fast Motion Estimation Algorithm Using Limited Sub-blocks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 3, pp. 258-263, 2006. DOI: .

[ACM Style]

Seong-hee Kim and Jeong-su Oh. 2006. Fast Motion Estimation Algorithm Using Limited Sub-blocks. The Journal of Korean Institute of Communications and Information Sciences, 31, 3, (2006), 258-263. DOI: .

[KICS Style]

Seong-hee Kim and Jeong-su Oh, "Fast Motion Estimation Algorithm Using Limited Sub-blocks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 3, pp. 258-263, 3. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880