An effective improvement on 3D SPIHT

Author

Zhong Cuixiang ; Huaung Minghe

Author_Institution

Software Coll., Jiangxi Normal Univ., Nanchang, China

fYear

2012

fDate

9-11 Nov. 2012

Firstpage

1

Lastpage

4

Abstract

As an extension of 2D SPIHT, 3D SPIHT inherits the properties of 2D SPIHT, and is suited very well large for volume data compression such as video, medical images, and multispectral images. But it still contains a great deal of redundant search, having not fully improved coding speed. In order to solve this problem, the authors of this paper successfully proposed a fast search algorithm, which can be applied to improve the 3D SPIHT coding algorithm, greatly reducing redundant search and improving coding speed. Experiments also show that the improved 3D SPIHT is really faster than the original 3D SPIHT for image and video compression.

Keywords

data compression; encoding; trees (mathematics); video coding; SPIHT; coding algorithm; coding speed; fast search algorithm; image compression; medical images compression; multispectral images compression; set partitioning in hierarchical tree; video compression; volume data compression; Biomedical imaging; Data compression; Discrete wavelet transforms; Encoding; Image coding; Sorting; 3D SPIHT; algorithm; coding speed; data compression; fast search; improvement;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Analysis and Signal Processing (IASP), 2012 International Conference on

Conference_Location

Hangzhou

Print_ISBN

978-1-4673-2547-9

Type

conf

DOI

10.1109/IASP.2012.6425024

Filename

6425024