Fast PDE Algorithm Using Block Matching Error Prediction 


Vol. 32,  No. 4, pp. 396-400, Apr.  2007


PDF
  Abstract

This paper proposes the fast partial difference elimination (PDE) algorithm. When the conventional PDE cannot skip the rest of matching procedure in a candidate block using a partial matching error, the proposed algorithm estimates to skip it again using the block matching error predicted from the computed partial matching error. The proposed algorithm can eliminate impossible candidate blocks earlier than the conventional PDE since the predicted block matching error is always bigger than the partial matching error. The simulation results show that the proposed algorithm can significantly reduce the computations while keeping image quality as good as the conventional PDE.

  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. Sin and J. Oh, "Fast PDE Algorithm Using Block Matching Error Prediction," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 4, pp. 396-400, 2007. DOI: .

[ACM Style]

Se-ill Sin and Jeong-Su Oh. 2007. Fast PDE Algorithm Using Block Matching Error Prediction. The Journal of Korean Institute of Communications and Information Sciences, 32, 4, (2007), 396-400. DOI: .

[KICS Style]

Se-ill Sin and Jeong-Su Oh, "Fast PDE Algorithm Using Block Matching Error Prediction," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 4, pp. 396-400, 4. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880