Low complexity finite-state scalar quantization of image subbands

1996 
Subband image coding is one of the most efficient image compression techniques known to date. Its advantages over standard techniques based on transform coding are particularly important at very low bit rates. The ability offered by a multiresolution decomposition approach to separately quantize the information contained in different frequency bands of an image, according to a criterion that accounts for the different sensitivity of the human visual system to each band, is crucial to the success of the technique. At low bit rates, the bands with lower energy content (usually the higher frequency bands) are very coarsely quantized, which accounts for most of the coding gain. Image quality is preserved by finely quantizing the higher energy content bands, commonly associated with the low frequency areas of the spectrum. We propose a fast and efficient method of achieving this goal. Our method is based on the combination of entropy coding with three types of scalar quantization: (i) scalar quantization, (ii) finite-state scalar quantization (FSSQ) and (iii) predictive FSSQ (PFSSQ). Scalar quantization is applied to bands with very low inter-pixel correlation, whereas FSSQ is used for bands with medium to high inter-pixel correlation. The common case that the lowest frequency band of an image exhibits linear inter-pixel correlation is exploited through PFHSQ, which uses a contextual model of the quantized prediction error to more accurately encode it. Uniform quantizers have been used throughout. The results of our experiments show that this system is specially well suited to very low bit rate image coding.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []