Fast Fractal Image Compression Using DCT Coefficients and Its Applications into Video Steganography


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 1, pp. 11-22, Jan. 1997
10.3745/KIPSTE.1997.4.1.11,   PDF Download:

Abstract

The fractal image compression partitions an original image into blocks of equal size and then searches a domain block having self-similarity. This method of compression achieves high compression ratio because it is unnecessary to transmit the additional codebook to receiver and it provides good quality of reconstructed images. In spite of these advantages, this method has a drawback in which encoding time increase due to a complicated linear transformation for determining a similar-domain block. In this paper, a fast fractal image compression method is proposed by decreasing the number of transformation using AC(alternating current) coefficients of block. The proposed method also has a good quality as compared with the well-known fractal codings. Furthermore, an application of the fractal coding is proposed to apply the video steganography that can conceal an important secret data.


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]
L. H. Joo and P. J. Hwan, "Fast Fractal Image Compression Using DCT Coefficients and Its Applications into Video Steganography," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 1, pp. 11-22, 1997. DOI: 10.3745/KIPSTE.1997.4.1.11.

[ACM Style]
Lee Hye Joo and Park Ji Hwan. 1997. Fast Fractal Image Compression Using DCT Coefficients and Its Applications into Video Steganography. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 1, (1997), 11-22. DOI: 10.3745/KIPSTE.1997.4.1.11.