Near optimal algorithm for image compression using Gabor expansion

Jean Louis Gouronc, Jennie Si

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The Gabor expansion is studied for the purpose of image compression. First, the mathematical conditions required to obtain complete sets of Gabor functions in L2(R) are presented. The concept of Gabor expansion is further interpreted in terms of the compression of real digital images: the problems of both complete and partial Gabor expansions of images are stated and an optimization algorithm which provides the coefficients of these expansions is proposed. This iterative algorithm based on the conjugate gradient algorithm converges in a finite number of iterations and in the mean time it is not computationally too costly (O(n2) calculations per iteration). For complete expansions, a new and tight bound on the number of iterations required to achieve exact reconstructions is given. For partial expansions, the study shows that very good reconstructed images can be obtained with bit rates as low as 0.6 bit per pixel.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages251-254
Number of pages4
ISBN (Print)0780312813
StatePublished - 1993
Event1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, USA
Duration: May 3 1993May 6 1993

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume1
ISSN (Print)0271-4310

Other

Other1993 IEEE International Symposium on Circuits and Systems
CityChicago, IL, USA
Period5/3/935/6/93

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Near optimal algorithm for image compression using Gabor expansion'. Together they form a unique fingerprint.

Cite this