On SOT coefficient ordering of a SPIHT coder and its fast analysis method

Author

Wang, Yu-Lin ; Wang, Jin-Xin ; Young, C.P. ; Su, Alvin W Y

Author_Institution

SCREAM Lab. CSIE., Nat. Cheng Kung Univ., Tainan

fYear

2008

fDate

June 23 2008-April 26 2008

Firstpage

73

Lastpage

76

Abstract

Evaluating coding efficiency in early coding stage is important in modern RDO compression methods. Bit-plane coding algorithms such as SPIHT are widely used in many scalable coders. The locality of a spatial-oriented tree (SOT) affects the coding efficiency of a SPIHT coder. In this paper, a fast algorithm is proposed to determine the numbers of bits to be consumed at all coding levels for a SPIHT coder without performing the entire coding process. The proposed algorithm can also evaluate the localities of various SOTs so that one can decide which types of SOTs should be used. Experiments of using different coefficient ordering schemes on construct SOTs for image compression using SPIHT are presented.

Keywords

data compression; image coding; rate distortion theory; trees (mathematics); RDO compression methods; SOT coefficient ordering; SPIHT coder; bit-plane coding algorithms; coefficient ordering schemes; image compression; rate distortion optimised method; set partitioning in hierarchical tree; spatial-oriented tree; Algorithm design and analysis; Automatic voltage control; Bit rate; Costs; Discrete wavelet transforms; Encoding; Image coding; Niobium; Rate-distortion; Sorting; Bit-plane based coder; Discrete Wavelet Transform; Rate distortion optimization; SPIHT; Spatial-oriented Tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Multimedia and Expo, 2008 IEEE International Conference on

Conference_Location

Hannover

Print_ISBN

978-1-4244-2570-9

Electronic_ISBN

978-1-4244-2571-6

Type

conf

DOI

10.1109/ICME.2008.4607374

Filename

4607374