arXiv research

Proposes a differentiable STFT for more efficient optimization of hop length.

Recently, we proposed short-time Fourier transform (STFT)-based loss functions for training a neural speech waveform model. In this paper, we generalize the above framework and propose a training scheme for such models based on spectral amplitude and phase losses obtained by either STFT or continuous wavelet transform …

Efficient trainable front-end for neural speech enhancement.

This study proposes a trainable adaptive window switching (AWS) method and apply it to a deep-neural-network (DNN) for speech enhancement in the modified discrete cosine transform domain. Time-frequency (T-F) mask processing in the short-time Fourier transform (STFT)-domain is a typical speech enhancement method. To re…

Fourier methods have a long and proven track record as an excellent tool in data processing. As memory and computational constraints gain importance in embedded and mobile applications, we propose to combine Fourier methods and recurrent neural network architectures. The short-time Fourier transform allows us to effici…

Nonnegative matrix factorization (NMF) is a popular method for audio spectral unmixing. While NMF is traditionally applied to off-the-shelf time-frequency representations based on the short-time Fourier or Cosine transforms, the ability to learn transforms from raw data attracts increasing attention. However, this adds…

Steganography is the science of hiding a secret message within an ordinary public message, which is referred to as Carrier. Traditionally, digital signal processing techniques, such as least significant bit encoding, were used for hiding messages. In this paper, we explore the use of deep neural networks as steganograp…

Time-frequency (TF) representations provide powerful and intuitive features for the analysis of time series such as audio. But still, generative modeling of audio in the TF domain is a subtle matter. Consequently, neural audio synthesis widely relies on directly modeling the waveform and previous attempts at unconditio…

Recent advances in deep learning motivate the use of deep neural networks in Internet-of-Things (IoT) applications. These networks are modelled after signal processing in the human brain, thereby leading to significant advantages at perceptual tasks such as vision and speech recognition. IoT applications, however, ofte…

The multiple fundamental frequency detection problem and the source separation problem from a single-channel signal containing multiple oscillatory components and a nonstationary noise are both challenging tasks. To extract the fetal electrocardiogram (ECG) from a single-lead maternal abdominal ECG, we face both challe…

Diffusion models enhance speech without supervision.

We propose a method for recognizing moving vehicles, using data from roadside audio sensors. This problem has applications ranging widely, from traffic analysis to surveillance. We extract a frequency signature from the audio signal using a short-time Fourier transform, and treat each time window as an individual data …

Supervised learning based on a deep neural network recently has achieved substantial improvement on speech enhancement. Denoising networks learn mapping from noisy speech to clean one directly, or to a spectrum mask which is the ratio between clean and noisy spectra. In either case, the network is optimized by minimizi…

iSTFTNet speeds up mel-spectrogram vocoders without sacrificing quality.

Convolutional neural networks (CNN) are widely used for speech emotion recognition (SER). In such cases, the short time fourier transform (STFT) spectrogram is the most popular choice for representing speech, which is fed as input to the CNN. However, the uncertainty principles of the short-time Fourier transform preve…

Vehicle recognition and classification have broad applications, ranging from traffic flow management to military target identification. We demonstrate an unsupervised method for automated identification of moving vehicles from roadside audio sensors. Using a short-time Fourier transform to decompose audio signals, we t…

Paper proves Fourier transform for valuations, simplifying previous work.

A new algorithm computes Fourier coefficients for a specified range efficiently.

Optimal transport as a loss for machine learning optimization problems has recently gained a lot of attention. Building upon recent advances in computational optimal transport, we develop an optimal transport non-negative matrix factorization (NMF) algorithm for supervised speech blind source separation (BSS). Optimal …

Structured CNN designed using the prior information of problems potentially improves efficiency over conventional CNNs in various tasks in solving PDEs and inverse problems in signal processing. This paper introduces BNet2, a simplified Butterfly-Net and inline with the conventional CNN. Moreover, a Fourier transform i…

Paper computes link determinants using Fourier-Hadamard transforms.

The Fourier transform of Heegaard Floer d-invariants helps classify 3-manifolds.

X-ray transform on H-type groups solved, revealing function injectivity.

Proves conditions for Fourier transforms in rank 1 symmetric spaces.

The starting point of our analysis is an old idea of writing an eigenfunction expansion for a heat kernel considered in the case of a hypoelliptic heat kernel on a nilpotent Lie group $G$. One of the ingredients of this approach is the generalized Fourier transform. The formula one gets using this approach is explicit …

A convolution neural network (CNN) based classification method for broadband DOA estimation is proposed, where the phase component of the short-time Fourier transform coefficients of the received microphone signals are directly fed into the CNN and the features required for DOA estimation are learnt during training. Si…

This work improves Fourier pricing for multi-asset options using RQMC with domain transformation.

This paper proposes a new loss using short-time Fourier transform (STFT) spectra for the aim of training a high-performance neural speech waveform model that predicts raw continuous speech waveform samples directly. Not only amplitude spectra but also phase spectra obtained from generated speech waveforms are used to c…

Algorithm describes Fourier transform of Stokes data at infinity.

The paper studies Fourier-Laplace transforms in polynomial OU volatility models for option pricing.

New algorithms learn sparse set functions in non-orthogonal Fourier bases.

Early recognition of abnormal rhythms in ECG signals is crucial for monitoring and diagnosing patients' cardiac conditions, increasing the success rate of the treatment. Classifying abnormal rhythms into exact categories is very challenging due to the broad taxonomy of rhythms, noises and lack of large-scale real-world…

In this paper, we study robust tensor completion by using transformed tensor singular value decomposition (SVD), which employs unitary transform matrices instead of discrete Fourier transform matrix that is used in the traditional tensor SVD. The main motivation is that a lower tubal rank tensor can be obtained by usin…

We prove that the Fourier--Laplace--Nahm transform for connections on the projective line is a hyper-Kähler isometry.

Transformers improve with Fourier integral attentions.

The paper derives statistics of multi-factor functions from their Fourier transforms.

Study spherical Fourier transform on hypergeometric type harmonic manifolds.

In this paper we prove a new inversion theorem and a refinement of an old support theorem for two Radon transforms on a symmetric space. Included are some new identities for the Abel transform and some results about the Fourier transform from a joint work with Rawat, Sengupta and Sitaram.

Given two compact hyperkähler surfaces $X$ and $Y$ and a holomorphic vector bundle $Q$ on $X\times Y$, which is a generalized instanton, one can define a Fourier-Mukai transform, which, under suitable assumptions, maps vector bundles on $X$ to vector bundles on $Y$. If $X$ and $Y$ are dual complex tori, this transform …

Enhances Fourier estimator performance for asynchronous event-data.

Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish …

RP-GFRFT unifies fractional order and rotation control for graph signals.

The paper derives and proves the Helgason Fourier transform for vector bundle-valued differential forms on homogeneous spaces.

Study identifies and analyzes three types of errors in learning Fourier operators.

Paper introduces a differentiable STFT for continuous window length optimization.

The study establishes uncertainty principles on harmonic manifolds of rank one.

FourNet approximates financial transition densities using Fourier transforms.

This paper proposes an approach to the joint modeling of the short-time Fourier transform magnitude and phase spectrograms with a deep generative model. We assume that the magnitude follows a Gaussian distribution and the phase follows a von Mises distribution. To improve the consistency of the phase values in the time…