Share Email Print
cover

Proceedings Paper

Scalable three-dimensional SBHP algorithm with region of interest access and low complexity
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 24 August 2006
PDF: 11 pages
Proc. SPIE 6312, Applications of Digital Image Processing XXIX, 631209 (24 August 2006); doi: 10.1117/12.684410
Show Author Affiliations
Ying Liu, Rensselaer Polytechnic Institute (United States)
William A. Pearlman, Rensselaer Polytechnic Institute (United States)


Published in SPIE Proceedings Vol. 6312:
Applications of Digital Image Processing XXIX
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top