Issue No. 04 - December (1996 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.556500
<p><b>Abstract</b>—This research explores the principles, implementation, and optimization of a competitive volume compression system based on fractal image compression. The extension of fractal image compression to volumetric data is trivial in theory. However, the simple addition of a dimension to existing fractal image compression algorithms results in infeasible compression times and noncompetitive volume compression results. This paper extends several fractal image compression enhancements to perform properly and efficiently on volumetric data, and introduces a new 3D edge classification scheme based on principal component analysis. Numerous experiments over the many parameters of fractal volume compression suggest aggressive settings of its system parameters. At this peak efficiency, fractal volume compression surpasses vector quantization and approaches within 1 dB PSNR of the discrete cosine transform. When compared to the DCT, fractal volume compression represents surfaces in volumes exceptionally well at high compression rates, and the artifacts of its compression error appear as noise instead of deceptive smoothing or distracting ringing.</p>
Data compression, fractal, iterated function system, volume visualization.
"Fractal Volume Compression", IEEE Transactions on Visualization & Computer Graphics, vol. 2, no. , pp. 313-322, December 1996, doi:10.1109/2945.556500