A NTSS of 3 Levels Block Matching Algorithm using Multi-Resolution


The KIPS Transactions:PartB , Vol. 11, No. 6, pp. 633-644, Oct. 2004
10.3745/KIPSTB.2004.11.6.633,   PDF Download:

Abstract

In this paper, we notice that the original NTSS algorithm can be proposed as the NTSS-3 Level algorithm by the multi-resolution technique. The fast block matching algorithm affects the speed by the patten combination and this paper proposes the block matching algorithm in different levels by multi-resolution technique, quite different from the original NTSS patten. The block matching algorithm requires the multi-candidate to reduce the occurrence of low-image quality by the local minima problem. The simulation result compared to FS shows search speed 16 times quicker, and the PSNR 0.11~0.12[dB] gets improved image quality compared to the original fast block matching algorithm NTSS, and the speed is improved up to 0.1 times for improved image by the search point portion.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
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]
H. S. Joo, "A NTSS of 3 Levels Block Matching Algorithm using Multi-Resolution," The KIPS Transactions:PartB , vol. 11, no. 6, pp. 633-644, 2004. DOI: 10.3745/KIPSTB.2004.11.6.633.

[ACM Style]
Heon Sik Joo. 2004. A NTSS of 3 Levels Block Matching Algorithm using Multi-Resolution. The KIPS Transactions:PartB , 11, 6, (2004), 633-644. DOI: 10.3745/KIPSTB.2004.11.6.633.