Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity

ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where non bit-plane coding is used for speed improvement. The two-stage differential coding method of the dynamic range of coefficients magnitudes is devised. The dynamic range of coefficients magnitudes in a spatial orientation tree is hierarchically represented. The hierarchical dynamic range coding naturally enables resolution scalable representation of wavelet transformed coefficients. A zerotree representation is also implicitly exploited by our dynamic range coding scheme. Experiments show that the our suggested coding model lessens the computational burden of bit-plane based image coding, three times in encoding and six times in decoding. 1 

• Type: Conference
• Year: 2005
• Where: DCC
• Authors: Yushin Cho, Amir Said, William A. Pearlman
• Keywords: Computer Graphics, DCC 2005, Non Bit-plane Coding, Range Coding Scheme, Suggested Coding Model