A hybrid image compression scheme combining block-based fractal coding and DCT

Signal Processing Image CommunicationPublished 1 March 1996

Yao Zhao, Baozong Yuan

DOI10.1016/0923-5965(95)00036-4

Source URL

Citations26

SJR quartileQ2

SJR score0.68

SNIP1.25

TL;DR

A novel hybrid image compression scheme based on block-based fractal coding and discrete cosine transform (DCT) is proposed in this paper, which shows that when compressing the standard image ‘Lena’ with this technique, its PSNR can reach 31.7 dB.

Abstract

A novel hybrid image compression scheme based on block-based fractal coding and discrete cosine transform (DCT) is proposed in this paper. An original image is first compressed by DCT domain fractal transform instead of spatial domain fractal transform, then the difference image between the original image and its fractal approximation is quantized and encoded by a Huffman code. The detailed steps to implement the scheme and some experimental results are presented. A comparison with other fractal-based image coding methods is also made in the paper. Experimental results show that when compressing the standard image 'Lena' with this technique, for a compression ratio of 12.4, its PSNR can reach 31.7 dB.

Keywords

Computer ScienceMathematics

Signal ProcessingImage compression: A study of the iterated transform method

200 Citations1992E. W. Jacobs, Yuval Fisher +1 more

Results from an image compression scheme based on iterated transforms are presented as a function of several encoding parameters including maximum allowed scale factor, number of domains, resolution of scale and offset values, minimum range size, and target fidelity.

International Conference on Acoustics, Speech, and Signal ProcessingA novel fractal block-coding technique for digital images

181 Citations2002A. Jacquin

An approach to digital image coding, rooted in iterated transformation theory (ITT) and referred to as ITT-based coding, is proposed, which is a fractal block-coding method which relies on the assumption that image redundancy can be efficiently exploited through block self-transformability.

Electronics LettersAffine theorem for two-dimensional Fourier transform

144 Citations1993R. N. Bracewell, Kuo-Yen Chang +2 more

A theorem is presented which determines what the Fourier transform becomes when the function domain is subjected to an affine co-ordinate transformation.

Electronics LettersFractal block coding of images

78 Citations1992D.M. Monro, Frank Dudbridge

An original method is presented for the efficient fractal approximation of rectangular grey-scale image blocks and it holds promise for applications in which low computational cost is a priority.

Electronics LettersClass of fractal transforms

28 Citations1993D.M. Monro

A hybrid of known methods is achieved, and they are evaluated in the polynomial case with a standard test image by searching the image, which is called the Bath fractal transform (BFT).

Fractal-Based Image Compression

21 Citations1989R. D. Boss, E. W. Jacobs

A short review of the theory of iterated function systems (IFS), a thorough explanation of their implementation, and an example using computer code useful in developing encoded images are presented.

IEE ReviewForm and functions: fractal-based image compression

6 Citations1992Roger Dettmer

Fractals have a natural affinity with computer graphics, generating images of limitless complexity and providing the basis for a very efficient compression algorithm.