Near optimal algorithm for image compression using Gabor expansion

Jean Louis Gouronc, Jennie Si

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

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
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages251-254
Number of pages4
Volume1
ISBN (Print)0780312813
StatePublished - 1993
Event1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, USA
Duration: May 3 1993May 6 1993

Other

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

Fingerprint

Image compression
Pixels

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Gouronc, J. L., & Si, J. (1993). Near optimal algorithm for image compression using Gabor expansion. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 1, pp. 251-254). Piscataway, NJ, United States: Publ by IEEE.

Near optimal algorithm for image compression using Gabor expansion. / Gouronc, Jean Louis; Si, Jennie.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1 Piscataway, NJ, United States : Publ by IEEE, 1993. p. 251-254.

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

Gouronc, JL & Si, J 1993, Near optimal algorithm for image compression using Gabor expansion. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 1, Publ by IEEE, Piscataway, NJ, United States, pp. 251-254, 1993 IEEE International Symposium on Circuits and Systems, Chicago, IL, USA, 5/3/93.
Gouronc JL, Si J. Near optimal algorithm for image compression using Gabor expansion. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1. Piscataway, NJ, United States: Publ by IEEE. 1993. p. 251-254
Gouronc, Jean Louis ; Si, Jennie. / Near optimal algorithm for image compression using Gabor expansion. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 1 Piscataway, NJ, United States : Publ by IEEE, 1993. pp. 251-254
@inproceedings{5e35194d780748d8b5464d84faa2772a,
title = "Near optimal algorithm for image compression using Gabor expansion",
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.",
author = "Gouronc, {Jean Louis} and Jennie Si",
year = "1993",
language = "English (US)",
isbn = "0780312813",
volume = "1",
pages = "251--254",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Near optimal algorithm for image compression using Gabor expansion

AU - Gouronc, Jean Louis

AU - Si, Jennie

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027284586&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027284586&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027284586

SN - 0780312813

VL - 1

SP - 251

EP - 254

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -