34,073 research outputs found

    Gabor frames and deep scattering networks in audio processing

    Get PDF
    This paper introduces Gabor scattering, a feature extractor based on Gabor frames and Mallat's scattering transform. By using a simple signal model for audio signals specific properties of Gabor scattering are studied. It is shown that for each layer, specific invariances to certain signal characteristics occur. Furthermore, deformation stability of the coefficient vector generated by the feature extractor is derived by using a decoupling technique which exploits the contractivity of general scattering networks. Deformations are introduced as changes in spectral shape and frequency modulation. The theoretical results are illustrated by numerical examples and experiments. Numerical evidence is given by evaluation on a synthetic and a "real" data set, that the invariances encoded by the Gabor scattering transform lead to higher performance in comparison with just using Gabor transform, especially when few training samples are available.Comment: 26 pages, 8 figures, 4 tables. Repository for reproducibility: https://gitlab.com/hararticles/gs-gt . Keywords: machine learning; scattering transform; Gabor transform; deep learning; time-frequency analysis; CNN. Accepted and published after peer revisio

    Deformations of Gabor Frames

    Full text link
    The quantum mechanical harmonic oscillator Hamiltonian generates a one-parameter unitary group W(\theta) in L^2(R) which rotates the time-frequency plane. In particular, W(\pi/2) is the Fourier transform. When W(\theta) is applied to any frame of Gabor wavelets, the result is another such frame with identical frame bounds. Thus each Gabor frame gives rise to a one-parameter family of frames, which we call a deformation of the original. For example, beginning with the usual tight frame F of Gabor wavelets generated by a compactly supported window g(t) and parameterized by a regular lattice in the time-frequency plane, one obtains a family of frames F_\theta generated by the non-compactly supported windows g_\theta=W(theta)g, parameterized by rotated versions of the original lattice. This gives a method for constructing tight frames of Gabor wavelets for which neither the window nor its Fourier transform have compact support. When \theta=\pi/2, we obtain the well-known Gabor frame generated by a window with compactly supported Fourier transform. The family F_\theta therefore interpolates these two familiar examples.Comment: 8 pages in Plain Te

    A Comparative study of Arabic handwritten characters invariant feature

    Get PDF
    This paper is practically interested in the unchangeable feature of Arabic handwritten character. It presents results of comparative study achieved on certain features extraction techniques of handwritten character, based on Hough transform, Fourier transform, Wavelet transform and Gabor Filter. Obtained results show that Hough Transform and Gabor filter are insensible to the rotation and translation, Fourier Transform is sensible to the rotation but insensible to the translation, in contrast to Hough Transform and Gabor filter, Wavelets Transform is sensitive to the rotation as well as to the translation

    Characterization and computation of canonical tight windows for Gabor frames

    Full text link
    Let (gnm)n,mZ(g_{nm})_{n,m\in Z} be a Gabor frame for L2(R)L_2(R) for given window gg. We show that the window h0=S1/2gh^0=S^{-1/2} g that generates the canonically associated tight Gabor frame minimizes gh\|g-h\| among all windows hh generating a normalized tight Gabor frame. We present and prove versions of this result in the time domain, the frequency domain, the time-frequency domain, and the Zak transform domain, where in each domain the canonical h0h^0 is expressed using functional calculus for Gabor frame operators. Furthermore, we derive a Wiener-Levy type theorem for rationally oversampled Gabor frames. Finally, a Newton-type method for a fast numerical calculation of \ho is presented. We analyze the convergence behavior of this method and demonstrate the efficiency of the proposed algorithm by some numerical examples
    corecore