Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution Scalability
End users of large volume image datasets are often interested only in certain features that can be identified as quickly as possible. For hyperspectral data, these features could reside only in certain ranges of spectral bands and certain spatial areas of the target. The same holds true for volume m...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2008-05-01
|
Series: | EURASIP Journal on Image and Video Processing |
Online Access: | http://dx.doi.org/10.1155/2008/248905 |
id |
doaj-adcb6fde514745a0a4895a885eded3cd |
---|---|
record_format |
Article |
spelling |
doaj-adcb6fde514745a0a4895a885eded3cd2020-11-25T00:19:06ZengSpringerOpenEURASIP Journal on Image and Video Processing1687-51761687-52812008-05-01200810.1155/2008/248905Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution ScalabilityWilliam A. PearlmanEmmanuel ChristopheEnd users of large volume image datasets are often interested only in certain features that can be identified as quickly as possible. For hyperspectral data, these features could reside only in certain ranges of spectral bands and certain spatial areas of the target. The same holds true for volume medical images for a certain volume region of the subject's anatomy. High spatial resolution may be the ultimate requirement, but in many cases a lower resolution would suffice, especially when rapid acquisition and browsing are essential. This paper presents a major extension of the 3D-SPIHT (set partitioning in hierarchical trees) image compression algorithm that enables random access decoding of any specified region of the image volume at a given spatial resolution and given bit rate from a single codestream. Final spatial and spectral (or axial) resolutions are chosen independently. Because the image wavelet transform is encoded in tree blocks and the bit rates of these tree blocks are minimized through a rate-distortion optimization procedure, the various resolutions and qualities of the images can be extracted while reading a minimum amount of bits from the coded data. The attributes and efficiency of this 3D-SPIHT extension are demonstrated for several medical and hyperspectral images in comparison to the JPEG2000 Multicomponent algorithm.http://dx.doi.org/10.1155/2008/248905 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
William A. Pearlman Emmanuel Christophe |
spellingShingle |
William A. Pearlman Emmanuel Christophe Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution Scalability EURASIP Journal on Image and Video Processing |
author_facet |
William A. Pearlman Emmanuel Christophe |
author_sort |
William A. Pearlman |
title |
Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution Scalability |
title_short |
Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution Scalability |
title_full |
Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution Scalability |
title_fullStr |
Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution Scalability |
title_full_unstemmed |
Three-Dimensional SPIHT Coding of Volume Images with Random Access and Resolution Scalability |
title_sort |
three-dimensional spiht coding of volume images with random access and resolution scalability |
publisher |
SpringerOpen |
series |
EURASIP Journal on Image and Video Processing |
issn |
1687-5176 1687-5281 |
publishDate |
2008-05-01 |
description |
End users of large volume image datasets are often interested only in certain features that can be identified as quickly as possible. For hyperspectral data, these features could reside only in certain ranges of spectral bands and certain spatial areas of the target. The same holds true for volume medical images for a certain volume region of the subject's anatomy. High spatial resolution may be the ultimate requirement, but in many cases a lower resolution would suffice, especially when rapid acquisition and browsing are essential. This paper presents a major extension of the 3D-SPIHT (set partitioning in hierarchical trees) image compression algorithm that enables random access decoding of any specified region of the image volume at a given spatial resolution and given bit rate from a single codestream. Final spatial and spectral (or axial) resolutions are chosen independently. Because the image wavelet transform is encoded in tree blocks and the bit rates of these tree blocks are minimized through a rate-distortion optimization procedure, the various resolutions and qualities of the images can be extracted while reading a minimum amount of bits from the coded data. The attributes and efficiency of this 3D-SPIHT extension are demonstrated for several medical and hyperspectral images in comparison to the JPEG2000 Multicomponent algorithm. |
url |
http://dx.doi.org/10.1155/2008/248905 |
work_keys_str_mv |
AT williamapearlman threedimensionalspihtcodingofvolumeimageswithrandomaccessandresolutionscalability AT emmanuelchristophe threedimensionalspihtcodingofvolumeimageswithrandomaccessandresolutionscalability |
_version_ |
1725373358925676544 |