Low complexity GMM-based block quantisation of images using the discrete cosine transform

No Thumbnail Available
File version
Author(s)
Paliwal, KK
So, S
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2005
Size
File type(s)
Location
License
Abstract

While block transform image coding has not been very popular lately in the presence of current state-of-the-art wavelet-based coders, the Gaussian mixture model (GMM)-based block quantiser, without the use of entropy coding, is still very competitive in the class of fixed rate transform coders. In this paper, a GMM-based block quantiser of low computational complexity is presented which is based on the discrete cosine transform (DCT). It is observed that the assumption of Gaussian mixture components in a GMM having Gauss-Markov properties is a reasonable one with the DCT approaching the optimality of the Karhunen-Lo/`eve transform (KLT) as a decorrelator. Performance gains of 6 to 7 dB are reported over the traditional single Gaussian block quantiser at 1 bit per pixel. The DCT possesses two advantages over the KLT: being fixed and source independent, which means it only needs to be applied once; and the availability of fast and efficient implementations. These advantages, together with bitrate scalability, result in a block quantiser that is considerably faster and less complex while the novelty of using a GMM to model the source probability density function is still preserved.

Journal Title

Signal Processing: Image Communication

Conference Title
Book Title
Edition
Volume

20

Issue
Thesis Type
Degree Program
School
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2005 Elsevier : Reproduced in accordance with the copyright policy of the publisher : This journal is available online - use hypertext links.

Item Access Status
Note
Access the data
Related item(s)
Subject

Communications engineering

Computer vision and multimedia computation

Persistent link to this record
Citation
Collections