Related papers: The Discrete Fourier Transform for Golden Angle Li…
Gaze estimation is a crucial task in computer vision, however, existing methods suffer from high computational costs, which limit their practical deployment in resource-limited environments. In this paper, we propose a novel lightweight…
Ptychography is a popular imaging technique that combines diffractive imaging with scanning microscopy. The technique consists of a coherent beam that is scanned across an object in a series of overlapping positions, leading to reliable and…
Dispersive Fourier transformation is a powerful technique in which spectral information is mapped into the time domain using chromatic dispersion. It replaces a spectrometer with an electronic digitizer, and enables real-time spectroscopy.…
This correspondence presents an efficient method for reconstructing a band-limited signal in the discrete domain from its crossings with a sine wave. The method makes it possible to design A/D converters that only deliver the crossing…
The Fractional Fourier Transform (FRT) corresponds to an arbitrary-angle rotation in the phase space, e.g. the time-frequency (TF) space, and generalizes the fundamentally important Fourier Transform. FRT applications range from classical…
The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does…
In order to measure the radial displacements of facets on surface of a growing spherical Cu_{2-\delta}Se crystal with sub-nanometer resolution, we have investigated the reliability and accuracy of standard method of Fourier analysis of…
Image Representation learning via input reconstruction is a common technique in machine learning for generating representations that can be effectively utilized by arbitrary downstream tasks. A well-established approach is using…
In the realm of LiDAR-based perception, significant strides have been made, yet domain generalization remains a substantial challenge. The performance often deteriorates when models are applied to unfamiliar datasets with different LiDAR…
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…
Spherical Gauss-Laguerre (SGL) basis functions, i.e., normalized functions of the type $L_{n-l-1}^{(l + 1/2)} (r^2) r^{l} Y_{lm}(\vartheta,\varphi)$, $|m| \leq l < n \in \mathbb{N}$, $L_{n-l-1}^{(l + 1/2)}$ being a generalized Laguerre…
The short-time Fourier transform (STFT) usually computes the same number of frequency components as the frame length while overlapping adjacent time frames by more than half. As a result, the number of components of a spectrogram matrix…
Graph signal processing (GSP) leverages the inherent signal structure within graphs to extract high-dimensional data without relying on translation invariance. It has emerged as a crucial tool across multiple fields, including learning and…
The Frozen Section (FS) technique is a rapid and efficient method, taking only 15-30 minutes to prepare slides for pathologists' evaluation during surgery, enabling immediate decisions on further surgical interventions. However, FS process…
Discrete trigonometric transformations, such as the discrete Fourier and cosine/sine transforms, are important in a variety of applications due to their useful properties. For example, one well-known property is the convolution theorem for…
We propose a Gauss-Legendre quadrature based sampling on the rotation group for the representation of a band-limited signal such that the Fourier transform (FT) of a signal can be exactly computed from its samples. Our figure of merit is…
Phase retrieval from phaseless short-time Fourier transform (STFT) measurements is known to be inherently unstable when measurements are taken with respect to a single window. While an explicit inversion formula exists, it is useless in…
The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…
The recent demonstration of a real-time direct imaging radio interferometry correlator represents a new capability in radio astronomy. However wide field imaging with this method is challenging since wide-field effects and array…
By using unsupervised domain adaptation (UDA), knowledge can be transferred from a label-rich source domain to a target domain that contains relevant information but lacks labels. Many existing UDA algorithms suffer from directly using raw…