Gabor transform

Uses your system voice; voice and rate in settings.

Snapshot

≈ 7 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

The Gabor transform, named after Dennis Gabor, is a special case of the short-time Fourier transform. It is used to determine the sinusoidal frequency and phase content of local sections of a signal as it changes over time. The function to be transformed is first multiplied by a Gaussian function, which can be regarded as a window function, and the resulting function is then transformed with a Fourier transform to derive the time-frequency analysis. The window function means that the signal near the time being analyzed will have higher weight. The Gabor transform of a signal x(t) is defined by this formula: : G_x(\tau,\omega) = \int_{-\infty}^\infty x(t)e^{-\pi(t-\tau)^2}e^{-j \omega t}\,dt The Gaussian function has infinite range and it is impractical for implementation. However, a level of significance can be chosen (for instance 0.00001) for the distribution of the Gaussian function. : \begin{cases} e^{-{\pi}a^2} \ge 0.00001; & \left| a \right| \le 1.9143 \\ e^{-{\pi}a^2} 1.9143 \end{cases} Outside these limits of integration ( \left| a \right| > 1.9143 ) the Gaussian function is small enough to be ignored. Thus the Gabor transform can be satisfactorily approximated as : G_x(\tau,\omega) = \int_{-1.9143+\tau}^{1.9143+\tau} x(t) e^{-\pi(t-\tau)^2} e^{-j \omega t} \, dt This simplification makes the Gabor transform practical and realizable.…

The Gabor transform, named after Dennis Gabor, is a special case of the short-time Fourier transform. It is used to determine the sinusoidal frequency and phase content of local sections of a signal as it changes over time. The function to be transformed is first multiplied by a Gaussian function, which can be regarded as a window function, and the resulting function is then transformed with a Fourier transform to derive the time-frequency analysis. The window function means that the signal near the time being analyzed will have higher weight. The Gabor transform of a signal x(t) is defined by this formula: G_x(\tau,\omega) = \int_{-\infty}^\infty x(t)e^{-\pi(t-\tau)^2}e^{-j \omega t}\,dt The Gaussian function has infinite range and it is impractical for implementation. However, a level of significance can be chosen (for instance 0.00001) for the distribution of the Gaussian function. \begin{cases} e^{-{\pi}a^2} \ge 0.00001; & \left| a \right| \le 1.9143 \\ e^{-{\pi}a^2} 1.9143 \end{cases} Outside these limits of integration ( \left| a \right| > 1.9143 ) the Gaussian function is small enough to be ignored. Thus the Gabor transform can be satisfactorily approximated as G_x(\tau,\omega) = \int_{-1.9143+\tau}^{1.9143+\tau} x(t) e^{-\pi(t-\tau)^2} e^{-j \omega t} \, dt This simplification makes the Gabor transform practical and realizable. The window function width can also be varied to optimize the time-frequency resolution tradeoff for a particular application by replacing the {-{\pi}(t-\tau)^2} with {-{\pi}\alpha (t-\tau)^2} for some chosen \alpha . x(t) = e^{\pi(t-\tau_0)^2}\frac{1}{2\pi}\int_{-\infty}^\infty G_x(\tau_0,\omega) e^{j \omega t }\,d\omega Alternatively, all of the time components can be combined: x(t) = \int_{-\infty}^\infty \frac{1}{2\pi} \int_{-\infty}^\infty G_x(\tau,\omega) e^{j \omega t }\,d\omega\,d\tau x(t) = \begin{cases} \cos(2\pi t) & \text{for } t \le 0, \\ \cos(4\pi t) & \text{for } t> 0. \end{cases} But if the total bandwidth available is 5 Hz, other frequency bands except x(t) are wasted. Through time–frequency analysis by applying the Gabor transform, the available bandwidth can be known and those frequency bands can be used for other applications and bandwidth is saved. The right side picture shows the input signal x(t) and the output of the Gabor transform. As was our expectation, the frequency distribution can be separated into two parts. One is t ≤ 0 and the other is t > 0. The white part is the frequency band occupied by x(t) and the black part is not used. Note that for each point in time there is both a negative (upper white part) and a positive (lower white part) frequency component. == Discrete Gabor-transformation== A discrete version of Gabor representation y(t)= \sum_{m = - \infty}^ \infty \sum_{n=- \infty}^ \infty C_{nm} \cdot g_{nm} (t) with g_{nm} (t) = s(t-m \tau_0 ) \cdot e^{j\Omega nt} can be derived easily by discretizing the Gabor-basis-function in these equations. Hereby the continuous parameter t is replaced by the discrete time k. Furthermore, the now finite summation limit in Gabor representation has to be considered. In this way, the sampled signal y(k) is split into M time frames of length N. According to \Omega \le \tfrac{2\pi}{\tau_0} , the factor Ω for critical sampling is \Omega = \tfrac{2\pi}{N} . Similar to the DFT (discrete Fourier transformation) a frequency domain split into N discrete partitions is obtained. An inverse transformation of these N spectral partitions then leads to N values y(k) for the time window, which consists of N sample values. For overall M time windows with N sample values, each signal y(k) contains K = N \cdot M sample values: (the discrete Gabor representation) y(k) = \sum_{m=0}^ {M-1} \sum_{n=0}^{N-1} C_{nm} \cdot g_{nm} (k) with g_{nm} (k) = s(k-mN) \cdot e^{j\Omega nk} According to the equation above, the N \cdot M coefficients C_{nm} correspond to the number of sample values K of the signal. For over-sampling \Omega is set to \Omega \le \tfrac{2\pi}{N} = \tfrac{2\pi}{N^\prime} with N′ > N, which results in N′ > N summation coefficients in the second sum of the discrete Gabor representation. In this case, the number of obtained Gabor-coefficients would be M \cdot N′ > K. Hence, more coefficients than sample values are available and therefore a redundant representation would be achieved. W_{\text{gaussian}}(t) = e^{-\sigma \pi t^2} So the Scaled Gabor transform can be written as: G_x(t,f) = \sqrt[4]{\sigma}\textstyle \int_{-\infty}^{\infty} \displaystyle e^{-\sigma \pi(\tau -t)^2} e^{-j2\pi f\tau}x(\tau)d\tau \qquad With a large \sigma , the window function will be narrow, causing higher resolution in time domain but lower resolution in frequency domain. Similarly, a small \sigma will lead to a wide window, with higher resolution in frequency domain but lower resolution in time domain. ==See also== Gabor filter Gabor wavelet Gabor atom Time-frequency representation S transform Short-time Fourier transform Wigner distribution function ==References== D. Gabor, Theory of Communication, Part 1, J. Inst. of Elect. Eng. Part III, Radio and Communication, vol 93, p. 429 1946 (http://genesis.eecg.toronto.edu/gabor1946.pdf) Jian-Jiun Ding, Time frequency analysis and wavelet transform class note, the Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan, 2007.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1298360798 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001298360798 · captured 1751411552.0 · version history

Cite this page as: encyclopegia.org, “Gabor transform”, snapshot enwiki-001298360798. https://encyclopegia.org/a/gabor-transform

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.