Share Email Print

Proceedings Paper

Fast fractal image compression with triangulation wavelets
Author(s): D. J. Hebert; Ezekiel Soundararajan
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We address the problem of improving the performance of wavelet based fractal image compression by applying efficient triangulation methods. We construct iterative function systems (IFS) in the tradition of Barnsley and Jacquin, using non-uniform triangular range and domain blocks instead of uniform rectangular ones. We search for matching domain blocks in the manner of Zhang and Chen, performing a fast wavelet transform on the blocks and eliminating low resolution mismatches to gain speed. We obtain further improvements by the efficiencies of binary triangulations (including the elimination of affine and symmetry calculations and reduced parameter storage), and by pruning the binary tree before construction of the IFS. Our wavelets are triangular Haar wavelets and `second generation' interpolation wavelets as suggested by Sweldens' recent work.

Paper Details

Date Published: 19 October 1998
PDF: 10 pages
Proc. SPIE 3458, Wavelet Applications in Signal and Imaging Processing VI, (19 October 1998); doi: 10.1117/12.328132
Show Author Affiliations
D. J. Hebert, none (United States)
Ezekiel Soundararajan, none (United States)

Published in SPIE Proceedings Vol. 3458:
Wavelet Applications in Signal and Imaging Processing VI
Andrew F. Laine; Michael A. Unser; Akram Aldroubi, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?