An FFT-based technique for fast fractal image compression

Signal Processing

Volumn 63, Issue 3, 1997, Pages 263-268

  Ramkumar, M ^a   Anand, G V ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Block matching; FFT based technique; Fractal image compression

Indexed keywords

FAST FOURIER TRANSFORMS; FRACTALS; OPTIMIZATION;

BLOCK MATCHING; ISOMETRIC TRANSFORMATIONS;

IMAGE COMPRESSION;

EID: 0031374476     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0165-1684(97)00162-x     Document Type: Article

References (6)

1. A.R. Butz, Alternative algorithm for Hubert's space filling curve, IEEE Trans, on Computers 20 (April 1971) 924-926.
2. n DFT's and their connection with practical applications, IEEE Trans. Acoust. Speech Signal Process. 38 (September 1990) 1504-1511.
3. Y. Fisher, Introduction, in: Y. Fisher (Ed.), Fractal Image Compression: Theory and Application, Springer, New York, 1995, pp. 20-21.
4. A.E. Jacquin, Image coding based on a fractal theory of iterated contractive image transformations, IEEE Trans. on Image Processing 1 (January 1992) 18-30.
5. D. Saupe, R. Hamzaoui, Complexity reduction methods for fractal image compression, in: T.M. Blacklegde (Ed.), Proc. IMA Conf. in Image Processing: Mathematical Methods and Applications, Oxford University Press, 1995.
6. D. Saupe, H. Hartenstein, Lossless acceleration of fractal image compression by fast convolution, Proc. IEEE international Conference on Image Processing, Lausanne, September 1996, pp. 185-188.