New efficient methods for Gabor analysis

1993 ◽  
Author(s):  
Hans G. Feichtinger ◽  
Ole Christensen
Keyword(s):  
Gabor Analysis

Gabor Analysis on Wiener Amalgams

2007 ◽  
Vol 6 (2) ◽  
pp. 129-150
Author(s):  
Hans G. Feichtinger ◽  
Ferenc Weisz
Keyword(s):  
Gabor Analysis

scholarly journals Gabor analysis as contraction of wavelets analysis

2017 ◽  
Vol 58 (8) ◽  
pp. 081702 ◽  
Author(s):  
Eyal M. Subag ◽  
Ehud Moshe Baruch ◽  
Joseph L. Birman ◽  
Ady Mann
Keyword(s):  
Gabor Analysis ◽  
Wavelets Analysis

Group theoretical approach to Gabor analysis

1995 ◽  
Vol 34 (6) ◽  
pp. 1697 ◽  
Author(s):  
Hans G. Feichtinger
Keyword(s):  
Theoretical Approach ◽  
Gabor Analysis

scholarly journals Effective Approach to Calculate Analysis Window in Infinite Discrete Gabor Transform

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Rui Li ◽  
Yong Huang ◽  
Jia-Bao Liu
Keyword(s):  
Fourier Transform ◽  
Computational Complexity ◽  
Linear Equation ◽  
Discrete Fourier Transform ◽  
Delta Function ◽  
Gabor Transform ◽  
Gabor Analysis ◽  
Analysis Window ◽  
Orthogonality Constraint ◽  
Infinite Sequences

The long-periodic/infinite discrete Gabor transform (DGT) is more effective than the periodic/finite one in many applications. In this paper, a fast and effective approach is presented to efficiently compute the Gabor analysis window for arbitrary given synthesis window in DGT of long-periodic/infinite sequences, in which the new orthogonality constraint between analysis window and synthesis window in DGT for long-periodic/infinite sequences is derived and proved to be equivalent to the completeness condition of the long-periodic/infinite DGT. By using the property of delta function, the original orthogonality can be expressed as a certain number of linear equation sets in both the critical sampling case and the oversampling case, which can be fast and efficiently calculated by fast discrete Fourier transform (FFT). The computational complexity of the proposed approach is analyzed and compared with that of the existing canonical algorithms. The numerical results indicate that the proposed approach is efficient and fast for computing Gabor analysis window in both the critical sampling case and the oversampling case in comparison to existing algorithms.

Properties of a discretized coherent state representation and the relation to Gabor analysis

2002 ◽  
Vol 35 (36) ◽  
pp. 7787-7801 ◽  
Author(s):  
L Mauritz Andersson ◽  
Johan  berg ◽  
Hans O Karlsson ◽  
Osvaldo Goscinski
Keyword(s):  
Coherent State ◽  
State Representation ◽  
Gabor Analysis

On the possibility of molecular recognition of taste substances studied by Gábor analysis of oscillations

2005 ◽  
Vol 114 (2-3) ◽  
pp. 85-93 ◽  
Author(s):  
Elżbieta Płocharska-Jankowska ◽  
Maria Szpakowska ◽  
Stefan Mátéfi-Tempfli ◽  
Ottó B. Nagy
Keyword(s):  
Molecular Recognition ◽  
Gabor Analysis
Sign in / Sign up

Export Citation Format

Share Document