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 language||English (US)|
|Number of pages||5|
|Journal||Proceedings - International Conference on Image Processing, ICIP|
|State||Published - Jan 1 1994|
|Event||Proceedings of the 1994 1st IEEE International Conference on Image Processing. Part 3 (of 3) - Austin, TX, USA|
Duration: Nov 13 1994 → Nov 16 1994