By Topic

Stripe-based SPIHT lossy compression of volumetric medical images for low memory usage and uniform reconstruction quality

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Youngseop Kim ; Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA ; W. A. Pearlman

This paper presents a low memory implementation of efficient lossy volumetric medical image compression using the set partitioning in hierarchical trees (SPIHT) algorithm. The coding units in this three-dimensional wavelet transform and compression method are short sequences of horizontal stripes cut from the sequence of slices in the volumetric image. As the compression degree increases, the boundaries between adjacent coding units became increasingly visible. Unlike video, where image frames are viewed under dynamic conditions, the volume image is examined under static conditions and must not exhibit such boundary artifacts. In order to eliminate them, we utilize overlapping both at the intra-slice and inter-slice boundaries between adjacent and successive stripe sequences. Our low memory implementation smooths out considerably the variation in mean squared error among different slices and suffers only an insignificant loss in performance from that of a full memory implementation

Published in:

Image Processing, 2000. Proceedings. 2000 International Conference on  (Volume:3 )

Date of Conference: