Fractal volume compression

Wayne O. Cochran, John C. Hart, Patrick J. Flynn

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)313-322
Number of pages10
JournalIEEE Transactions on Visualization and Computer Graphics
Volume2
Issue number4
DOIs
StatePublished - Dec 1 1996
Externally publishedYes

Fingerprint

Fractals
Image compression
Discrete cosine transforms
Vector quantization
Principal component analysis
Experiments

Keywords

  • Data compression
  • Fractal, iterated function system
  • Volume visualization

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design

Cite this

Fractal volume compression. / Cochran, Wayne O.; Hart, John C.; Flynn, Patrick J.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 2, No. 4, 01.12.1996, p. 313-322.

Research output: Contribution to journalArticle

Cochran, Wayne O. ; Hart, John C. ; Flynn, Patrick J. / Fractal volume compression. In: IEEE Transactions on Visualization and Computer Graphics. 1996 ; Vol. 2, No. 4. pp. 313-322.
@article{2275ba0342e04079be111f081d07df69,
title = "Fractal volume compression",
abstract = "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.",
keywords = "Data compression, Fractal, iterated function system, Volume visualization",
author = "Cochran, {Wayne O.} and Hart, {John C.} and Flynn, {Patrick J.}",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/2945.556500",
language = "English (US)",
volume = "2",
pages = "313--322",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - Fractal volume compression

AU - Cochran, Wayne O.

AU - Hart, John C.

AU - Flynn, Patrick J.

PY - 1996/12/1

Y1 - 1996/12/1

N2 - 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.

AB - 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.

KW - Data compression

KW - Fractal, iterated function system

KW - Volume visualization

UR - http://www.scopus.com/inward/record.url?scp=0030383707&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030383707&partnerID=8YFLogxK

U2 - 10.1109/2945.556500

DO - 10.1109/2945.556500

M3 - Article

AN - SCOPUS:0030383707

VL - 2

SP - 313

EP - 322

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 4

ER -