Related papers: A discrete fractional random transform
A novel addition to the family of integral transforms, the quadratic phase Fourier transform (QPFT) embodies a variety of signal processing tools, including the Fourier transform (FT), fractional Fourier transform (FRFT), linear canonical…
A property of sparse representations in relation to their capacity for information storage is discussed. It is shown that this feature can be used for an application that we term Encrypted Image Folding. The proposed procedure is realizable…
Invertible image representation methods (transforms) are routinely employed as low-level image processing operations based on which feature extraction and recognition algorithms are developed. Most transforms in current use (e.g. Fourier,…
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
Fractional Fourier transform and chaos functions play a key role in many of encryption-decryption algorithms. In this work performance of image encryption-decryption algorithms is quantified and compared using the computation time i.e. the…
In this paper, we theoretically propose a new hashing scheme to establish the sparse Fourier transform in high-dimensional space. The estimation of the algorithm complexity shows that this sparse Fourier transform can overcome the curse of…
Fourier transform (FT) plays a crucial role in a broad range of applications, from enhancement, restoration and analysis through to security, compression and manipulation. The Fourier transform (FT) is a process that converts a function…
Discrete Fourier Transform (DFT) is widely used in signal processing to analyze the frequencies in a discrete signal. However, DFT fails to recover the exact Fourier spectrum, when the signal contains frequencies that do not correspond to…
Diffusive representations of fractional derivatives have proven to be useful tools in the construction of fast and memory efficient numerical methods for solving fractional differential equations. A common challenge in many of the known…
Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT),…
In this paper, we focus on Fourier analysis and holographic transforms for signal representation. For instance, in the case of image processing, the holographic representation has the property that an arbitrary portion of the transformed…
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)…
Fourier transform is applied to annular beams of simplified flat two-level geometry: bright outer ring with a darker core. The pattern of focal beam profile (i.e. far field) is calculated and characterized with respect of its intensity…
Starting from kicked equations of motion with derivatives of non-integer orders, we obtain "fractional" discrete maps. These maps are generalizations of well-known universal, standard, dissipative, kicked damped rotator maps. The main…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…
Via chirp functions from fractional Fourier transforms, the authors introduce fractional Riesz potentials related to chirp functions, establish their relations with fractional Fourier transforms, fractional Laplace operators related to…
Computing accurate estimates of the Fourier transform of analog signals from discrete data points is important in many fields of science and engineering. The conventional approach of performing the discrete Fourier transform of the data…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…