Related papers: Convolution theorems for the free metaplectic tran…

Convolutional neural network (CNN) is one of the most widely-used successful architectures in the era of deep learning. However, the high-computational cost of CNN still hampers more universal uses to light devices. Fortunately, the Fourier…

A mathematical relation between elements of one- and multi-dimensional discrete Fourier transforms (DFT) is found. A method of analysing the multi-dimensional data by their single one-dimensional (1-D) DFT is offered. An experiment of…

The linear canonical transform (LCT) serves as a powerful generalization of the Fourier transform (FT), encapsulating various integral transforms within a unified framework. This versatility has made it a cornerstone in fields such as…

We propose a novel transformer model, capable of segmenting medical images of varying modalities. Challenges posed by the fine grained nature of medical image analysis mean that the adaptation of the transformer for their analysis is still…

The singular values of convolutional mappings encode interesting spectral properties, which can be used, e.g., to improve generalization and robustness of convolutional neural networks as well as to facilitate model compression. However,…

The versatility of self-attention mechanism earned transformers great success in almost all data modalities, with limitations on the quadratic complexity and difficulty of training. To apply transformers across different data modalities,…

This comprehensive review paper delves into the intricacies of advanced Fourier type integral transforms and their mathematical properties, with a particular focus on fractional Fourier transform (FrFT), linear canonical transform (LCT),…

Fast methods for convolution and correlation underlie a variety of applications in computer vision and graphics, including efficient filtering, analysis, and simulation. However, standard convolution and correlation are inherently limited…

In this contribution we generalize the classical Fourier Mellin transform [S. Dorrode and F. Ghorbel, Robust and efficient Fourier-Mellin transform approximations for gray-level image reconstruction and complete invariant description,…

In this paper we introduce the temporally factorized 3D convolution (3TConv) as an interpretable alternative to the regular 3D convolution (3DConv). In a 3TConv the 3D convolutional filter is obtained by learning a 2D filter and a set of…

In this paper we introduce activation functions that move the entire computation of Convolutional Networks into the frequency domain, where they are actually Hadamard Networks. To achieve this result we employ the properties of Discrete…

In these notes we explain how the CFT description of random matrix models can be used to perform actual calculations. Our basic example is the hermitian matrix model, reformulated as a conformal invariant theory of free fermions. We give an…

Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms…

The Fractional Fourier Transform (FRFT) has been playing a unique and increasingly important role in signal and image processing. In this letter, we investigate the property of frequency shift in two-dimensional FRFT (2D-FRFT) domain. It is…

In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in…

The paper studies various properties of the V-line transform (VLT) in the plane and conical Radon transform (CRT) in $\mathbb{R}^n$. VLT maps a function to a family of its integrals along trajectories made of two rays emanating from a…

Transformers have captured growing attention in computer vision, thanks to its large capacity and global processing capabilities. However, transformers are data hungry, and their ability to generalize is constrained compared to…

Convolution is an efficient technique to obtain abstract feature representations using hierarchical layers in deep networks. Although performing convolution in Euclidean geometries is fairly straightforward, its extension to other…

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

We introduce the new notion of convolution of a (smooth or generalized) valuation on a group $G$ and a valuation on a manifold $M$ acted upon by the group. In the case of a transitive group action, we prove that the spaces of smooth and…