A. Docef, Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
F. Kossentini, Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
W.C. Chung, Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
M.J.T. Smith, Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
This paper describes a very computationally efficient design algorithm for color image coding at low bit rates. The proposed algorithm is based on uniform tree-structured subband decomposition, multistage scalar quantization of the image subbands, and high order entropy coding. The main advantage of the algorithm is that no multiplications are required in both analysis/synthesis and encoding/decoding. This can lead to a simple hardware implementation of the subband coder, while maintaining a high level of performance.
Index Terms:
image coding; computational complexity; encoding; decoding; multiplication-free subband coding; color images; computationally efficient design algorithm; low bit rates; uniform tree-structured subband decomposition; multistage scalar quantization; image subbands; high order entropy coding; encoding; decoding
Citation:
A. Docef, F. Kossentini, W.C. Chung, M.J.T. Smith, "Multiplication-free subband coding of color images," dcc, pp.352, Data Compression Conference (DCC '95), 1995