Translator Disclaimer
24 August 2006 Scalable three-dimensional SBHP algorithm with region of interest access and low complexity
Author Affiliations +
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (SBHP) algorithm is modified and extended to three dimensions, and applied to every code block independently. The resultant algorithm, 3D-SBHP, efficiently encodes 3D image data by the exploitation of the dependencies in all dimensions, while enabling progressive SNR and resolution decompression and Region-of-Interest (ROI) access from the same bit stream. The code-block selection method by which random access decoding can be achieved is outlined.The resolution scalable and random access performances are empirically investigated. The results show 3D-SBHP is a good candidate to compress 3D image data sets for multimedia applications.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ying Liu and William A. Pearlman "Scalable three-dimensional SBHP algorithm with region of interest access and low complexity", Proc. SPIE 6312, Applications of Digital Image Processing XXIX, 631209 (24 August 2006);


JPEG2000 Part 10: volumetric imaging
Proceedings of SPIE (November 19 2003)
Lossless compression for three-dimensional images
Proceedings of SPIE (January 18 2004)
Lossy coding techniques for high-resolution images
Proceedings of SPIE (February 05 2004)
New compression paradigms in JPEG 2000
Proceedings of SPIE (December 28 2000)

Back to Top