Improved Sub-block Matching Algorithm 


Vol. 35,  No. 7, pp. 628-633, Jul.  2010


PDF
  Abstract

This paper proposes a block matching algorithm to improve the sub-block matching algorithm that uses partial sub-blocks being a great contribution to the block matching. Unlike the conventional algorithm using the one sub-block group the proposed algorithm uses two sub-block groups. The matching using the small group selects a candidate block to be a good possibility of a similar block with a small computation cost and the additional matching using the large group in the selected block decreases a wrong matching. Simulation results show that the proposed algorithm always has good image quality at the same computation cost as compared to the conventional algorithm and it has an outstanding performance at the matching using a few sub-blocks.

  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]

J. Oh, "Improved Sub-block Matching Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 628-633, 2010. DOI: .

[ACM Style]

Jeong-su Oh. 2010. Improved Sub-block Matching Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 35, 7, (2010), 628-633. DOI: .

[KICS Style]

Jeong-su Oh, "Improved Sub-block Matching Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 7, pp. 628-633, 7. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880