Related papers: Connecting spatial and frequency domains for the q…

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,…

The Special Affine Fourier Transform or the SAFT generalizes a number of well known unitary transformations as well as signal processing and optics related mathematical operations. Unlike the Fourier transform, the SAFT does not work well…

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 paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a…

Neural networks in the real domain have been studied for a long time and achieved promising results in many vision tasks for recent years. However, the extensions of the neural network models in other number fields and their potential…

Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse…

The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…

Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based…

I discuss the nature of a Fractional Discrete Fourier Transform (FrDFT) described algorithmically by a combination of chirp transforms and ordinary DFTs. The transform is shown to be consistent with a continuous two-dimensional rotation…

The Quantum Fourier Transform (QFT) is a key component of many important quantum algorithms, most famously as being the essential ingredient in Shor's algorithm for factoring products of primes. Given its remarkable capability, one would…

This paper presents an experimental study on the application of quaternions in several machine learning algorithms. Quaternion is a mathematical representation of rotation in three-dimensional space, which can be used to represent complex…

The Cosmic Microwave Background (CMB) data analysis and the map-making process rely heavily on the use of spherical harmonics. For suitable pixelizations of the sphere, the (forward and inverse) Fourier transform plays a crucial role in…

Hypercomplex Fourier transforms are increasingly used in signal processing for the analysis of higher-dimensional signals such as color images. A main stumbling block for further applications, in particular concerning filter design in the…

Quantum Field Theory (QFT) makes predictions by combining two sets of assumptions: (1) quantum dynamics, such as a Schrodinger or Liouville equation; (2) quantum measurement, such as stochastic collapse to an eigenfunction of a measurement…

Many phenomena are described by bivariate signals or bidimensional vectors in applications ranging from radar to EEG, optics and oceanography. The time-frequency analysis of bivariate signals is usually carried out by analyzing two separate…

The goal of this paper is to re-express QFT in terms of two "classical" fields living in ordinary space with single extra dimension. The role of the first classical field is to set up an injection from the set of values of extra dimension…

In this paper, we mainly establish the uncertainty principle (UP) for a function and its quaternion Fractional Fourier transform (QFrFT), as well as the UP for two QFrFTs. Using the polar representation of quaternion-valued signals, we give…

Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…

Convolutional neural networks owe much of their success to hard-coding translation equivariance. Quantum convolutional neural networks (QCNNs) have been proposed as near-term quantum analogues, but the relevant notion of translation depends…

The fractional Fourier transform (FrFT), a fundamental operation in physics that corresponds to a rotation of phase space by any angle, is also an indispensable tool employed in digital signal processing for noise reduction. Processing of…