A note on the Gabor-QR decomposition

Research output: Contribution to journalConference articlepeer-review


In this paper, we propose a novel Gabor transformation scheme that is based on the QR decomposition. This Gabor-QR scheme computes the exact Gabor coefficients by solving a system of linear equations Ax=b. The computation is more efficient than iterative schemes and less complicated than other matrix-based methods. In addition, the proposed Gabor-QR scheme allows the use of incomplete basis sets, which is uncommon in most matrix-based Gabor transformations. Experimental results from image encoding are presented to highlight the major contributions of the proposed method. Due to its computational efficiency, the Gabor-QR decomposition scheme has a strong potential as an efficient method for image sequence encoding.

Original languageEnglish (US)
Article number413428
Pages (from-to)815-819
Number of pages5
JournalProceedings - International Conference on Image Processing, ICIP
StatePublished - 1994
EventThe 1994 1st IEEE International Conference on Image Processing - Austin, TX, USA
Duration: Nov 13 1994Nov 16 1994

Bibliographical note

Publisher Copyright:
© 1994 IEEE.


Dive into the research topics of 'A note on the Gabor-QR decomposition'. Together they form a unique fingerprint.

Cite this