Classification Based Speed-Up Methods for Fractal Image Compression on Multicomputers

Authors:
Jutta Hämmerle;Andreas Uhl
Affiliations:
-;-
Venue:
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Year:
1999

Citing 6
Cited 0

Fractal image compression: theory and application

Fractal image compression: theory and application
Fractal Image Compression Algorithms on a MIMD Architecture

HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
A parallel fractal image compression algorithm for hypercube multiprocessors

SSST '95 Proceedings of the 27th Southeastern Symposium on System Theory (SSST'95)
Accelerating fractal image compression by multi-dimensional nearest neighbor search

DCC '95 Proceedings of the Conference on Data Compression
Self-quantized wavelet subtrees: a wavelet-based theory for fractal image compression

DCC '95 Proceedings of the Conference on Data Compression
Fast fractal image block coding based on local variances

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since fractal image compression is computationally very expensive, speedup techniques are required in addition to parallel processing in order to compress large images in reasonable time. In this paper we introduce a new parallelization approach for fractal image compression algorithms which employ block classification as speedup method suited for multicomputers.