Study on the Similarity Functions for Image Compression


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 8, pp. 2133-2142, Aug. 1997
10.3745/KIPSTE.1997.4.8.2133,   PDF Download:

Abstract

Compared with previous compression methods, fractal image compression drastically increases compression rate by using block-based encoding. Although decompression can be done in real time even with softwares, the most serious problem in utilizing the fractal method is the time required for the encoding. In this paper, we propose and verify i) an algorithm that reduces the encoding time by reducing the number of similarity searching on the basis of dimensional informations, and ii) an algorithm that enhances the quality of the restored image on the basis of brightness and contrast information. Finally, a method that enables fast compression with little quality degradation is proposed.


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]
J. W. Seok and K. J. Oh, "Study on the Similarity Functions for Image Compression," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 8, pp. 2133-2142, 1997. DOI: 10.3745/KIPSTE.1997.4.8.2133.

[ACM Style]
Joo Woo Seok and Kang Jong Oh. 1997. Study on the Similarity Functions for Image Compression. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 8, (1997), 2133-2142. DOI: 10.3745/KIPSTE.1997.4.8.2133.