A note on the Gabor-QR decomposition

Author

Lau, Patrick ; Papanikolopoulos, Nikolaos P. ; Boley, Daniel L.

Author_Institution

Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA

Volume

1

fYear

1994

fDate

13-16 Nov 1994

Firstpage

815

Abstract

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

Keywords

computational complexity; image coding; image sequences; transforms; Gabor transformation scheme; Gabor-QR decomposition; computational efficiency; image encoding; image sequence encoding; incomplete basis sets; linear equations; matrix-based methods; Computational efficiency; Computer science; Difference equations; Frequency; Humans; Image coding; Image sequences; Iterative methods; Matrix decomposition; Pixel;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1994. Proceedings. ICIP-94., IEEE International Conference

Conference_Location

Austin, TX

Print_ISBN

0-8186-6952-7

Type

conf

DOI

10.1109/ICIP.1994.413428

Filename

413428