Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Fractal image compression
Vector quantization and signal compression
Vector quantization and signal compression
Vector quantization for volume rendering
VVS '92 Proceedings of the 1992 workshop on Volume visualization
Fast volume rendering using a shear-warp factorization of the viewing transformation
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A review of the fractal image compression literature
ACM SIGGRAPH Computer Graphics
A multiresolution framework for volume rendering
VVS '94 Proceedings of the 1994 symposium on Volume visualization
A Lipschitz method for accelerated volume rendering
VVS '94 Proceedings of the 1994 symposium on Volume visualization
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
JPEG Still Image Data Compression Standard
JPEG Still Image Data Compression Standard
Volume Rendering of DCT-Based Compressed 3D Scalar Data
IEEE Transactions on Visualization and Computer Graphics
IFS Fractal Interpolation for 2D and 3D Visualization
VIS '95 Proceedings of the 6th conference on Visualization '95
Compression Domain Rendering of Time-Resolved Volume Data
VIS '95 Proceedings of the 6th conference on Visualization '95
Three-dimensional fractal video coding
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Accelerating fractal image compression by multi-dimensional nearest neighbor search
DCC '95 Proceedings of the Conference on Data Compression
Towards a comprehensive volume visualization system
VIS '92 Proceedings of the 3rd conference on Visualization '92
Approximation and rendering of volume data using wavelet transforms
VIS '92 Proceedings of the 3rd conference on Visualization '92
Fast volume rendering of compressed data
VIS '93 Proceedings of the 4th conference on Visualization '93
Wavelet-based multiresolutional representation of computational field simulation datasets
VIS '97 Proceedings of the 8th conference on Visualization '97
Interactive rendering of large volume data sets
Proceedings of the conference on Visualization '02
Structure-Significant Representation of Structured Datasets
IEEE Transactions on Visualization and Computer Graphics
Lossless Compression of Surfaces Described as Points
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Time-varying, multivariate volume data reduction
Proceedings of the 2005 ACM symposium on Applied computing
Transform Coding for Hardware-accelerated Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
Image and Vision Computing
Machine Graphics & Vision International Journal
Real time fractal image coder based on characteristic vector matching
Image and Vision Computing
High quality rendering of compressed volume data formats
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
| Hi-index | 0.00 |
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.