Related papers: A discrete fractional random transform
We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the R\'enyi (or backwards) continued fraction map. We explore the continued fraction expansions that this…
Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and…
In the present article the author extends the Fourier transform to a more general class of functions; First to power-law functions with integer and half-integer exponents then to the widely used quantum statistics function (Fermi-Dirac and…
The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
We established a new method called Discrete Weierstrass Fourier Transform, a faster and more generalized Discrete Fourier Transform, to approximate discrete data. The theory of this method as well as some experiments are analyzed in this…
Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by…
Over the last decade, it has been demonstrated that many systems in science and engineering can be modeled more accurately by fractional-order than integer-order derivatives, and many methods are developed to solve the problem of fractional…
The current digital era, driven by growing threats to data security, requires a robust image encryption technique. Classical encryption algorithms suffer from a trade-off among security, image fidelity, and computational efficiency. This…
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…
In recent years it has turned out that shearlets have the potential to retrieve directional information so that they became interesting for many applications. Moreover the continuous shearlet transform has the outstanding property to stem…
The basic principle of astronomical interferometry is to derive the angular distribution of radiation in the sky from the Fourier transform of the electric field on the ground. What is so special about the Fourier transform? Nothing, it…
The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.
This study reexamines diffusive representations for fractional integrals with the goal of pioneering new variants of such representations. These variants aim to offer highly efficient numerical algorithms for the approximate computation of…
The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In…
This letter discusses the problem of testing the degree of randomness within an image, particularly for a shuffled or encrypted image. Its key contributions are: 1) a mathematical model of perfectly shuffled images; 2) the derivation of the…
The discrete Fourier transform has proven to be an essential tool in many geometric and combinatorial problems in vector spaces over finite fields. In general, sets with good uniform bounds for the Fourier transform appear more `random' and…
We discuss some of the mathematical properties of the fractional derivative defined by means of Fourier transforms. We first consider its action on the set of test functions $\Sc(\mathbb R)$, and then we extend it to its dual set,…