Share Email Print
cover

Proceedings Paper

Fractal-based image compression: a fast algorithm using wavelet transform
Author(s): Yonghong Tang; William G. Wee
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Deterministic fractals have been successfully applied to gray-level image compression. In this approach, an image is represented by a set of affine transforms, each of which maps one subimage to another subimage. The affine transforms are found by exhaustive searching over all the collection of subimages and is very time-consuming. The objectives of this paper are to demonstrate the applicability of wavelet transform (WT) in the searching process and to show a time saving in using WT as compared to exhaustive searching. The wavelet transform provides a multiscale description of an image based on local `detail signals' at each resolution scale. We propose a fast algorithm that takes the advantage of the structural information of the subimages by searching through the wavelet coefficient space instead of the gray-level space. The wavelet transform is computed only once, and can be done very rapidly by using short FIR filters. We have experimentally shown here that the approach is applicable, and there is a time saving of 77% over the exhaustive searching method.

Paper Details

Date Published: 16 September 1994
PDF: 9 pages
Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185923
Show Author Affiliations
Yonghong Tang, Univ. of Cincinnati (United States)
William G. Wee, Univ. of Cincinnati (United States)


Published in SPIE Proceedings Vol. 2308:
Visual Communications and Image Processing '94
Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top