A note on the Gabor-QR decomposition

P. Lau; N. P. Papanikolopoulos; D. L. Boley

doi:10.1109/ICIP.1994.413428

A note on the Gabor-QR decomposition

Computer Science and Engineering

Research output: Contribution to journal › Conference article › peer-review

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.

Original language	English (US)
Article number	413428
Pages (from-to)	815-819
Number of pages	5
Journal	Proceedings - International Conference on Image Processing, ICIP
Volume	1
DOIs	https://doi.org/10.1109/ICIP.1994.413428
State	Published - 1994
Event	The 1994 1st IEEE International Conference on Image Processing - Austin, TX, USA Duration: Nov 13 1994 → Nov 16 1994

Bibliographical note

Publisher Copyright:
© 1994 IEEE.

Publisher link

10.1109/ICIP.1994.413428

Find It

Find It at U of M Libraries

Cite this

@article{972f33b6ad004b13958091db3f938b8c,

title = "A note on the Gabor-QR decomposition",

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.",

author = "P. Lau and Papanikolopoulos, \{N. P.\} and Boley, \{D. L.\}",

note = "Publisher Copyright: {\textcopyright} 1994 IEEE.; The 1994 1st IEEE International Conference on Image Processing ; Conference date: 13-11-1994 Through 16-11-1994",

year = "1994",

doi = "10.1109/ICIP.1994.413428",

language = "English (US)",

volume = "1",

pages = "815--819",

journal = "Proceedings - International Conference on Image Processing, ICIP",

issn = "1522-4880",

publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - A note on the Gabor-QR decomposition

AU - Lau, P.

AU - Papanikolopoulos, N. P.

AU - Boley, D. L.

PY - 1994

Y1 - 1994

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

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

UR - https://www.scopus.com/pages/publications/84996614750

UR - https://www.scopus.com/pages/publications/84996614750#tab=citedBy

U2 - 10.1109/ICIP.1994.413428

DO - 10.1109/ICIP.1994.413428

M3 - Conference article

AN - SCOPUS:84996614750

SN - 1522-4880

VL - 1

SP - 815

EP - 819

JO - Proceedings - International Conference on Image Processing, ICIP

JF - Proceedings - International Conference on Image Processing, ICIP

M1 - 413428

T2 - The 1994 1st IEEE International Conference on Image Processing

Y2 - 13 November 1994 through 16 November 1994

ER -

A note on the Gabor-QR decomposition

Abstract

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this