Related papers: Novel Special Affine Wavelet Transform and Associa…
The special affine Fourier transform (SAFT) is a promising tool for analyzing non-stationary signals with more degrees of freedom. However, the SAFT fails in obtaining the local features of non-transient signals due to its global kernel and…
In this paper, we study the convolution structure in the special affine Fourier transform domain to combine the advantages of the well known special affine Fourier and Stockwell transforms into a novel integral transform coined as special…
In this paper, we have given a new definition of continuous fractional wavelet transform in $\mathbb{R}^N$, namely the multidimensional fractional wavelet transform (MFrWT) and studied some of the basic properties along with the inner…
The translation operator $T^A$ associated with the special affine Fourier transform (SAFT) $\mathscr{F}_A$ is introduced from harmonic analysis point of view. The analogues of Wendel's theorem, Wiener theorem, Weiner-Tauberian theorem and…
The Special Affine Fourier Transformation or the SAFT generalizes a number of well known unitary transformations as well as signal processing and optics related mathematical operations. Shift-invariant spaces also play an important role in…
The Special Affine Fourier Transformation(SAFT), which generalizes several well-known unitary transformations, has been demonstrated as a valuable tool in signal processing and optics. In this paper, we explore the multivariate dynamical…
Recovering a sparse signal from its low-pass projections in the Fourier domain is a problem of broad interest in science and engineering and is commonly referred to as super-resolution. In many cases, however, Fourier domain may not be the…
In this paper, we study the convolution structure in the special affine Fourier domain to combine the advantages of the well known special affine Fourier and wavelet transforms into a novel integral transform coined as special affine…
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 purpose of this article is to extend the wavelet transform to quaternion algebra using the kernel of the two-sided quaternion Fourier transform (QFT). We study some fundamental properties of this extension such as scaling, translation,…
In this paper, we present new regularized Shannon sampling formulas related to the special affine Fourier transform (SAFT). These sampling formulas use localized sampling with special compactly supported window functions, namely B-spline,…
The quadratic phase Fourier transform has gained much popularity in recent years because of its applications in image and signal processing. However, the QPFT is inadequate for localizing the quadratic phase spectrum which is required in…
One of the key challenges in the area of signal processing on graphs is to design transforms and dictionaries methods to identify and exploit structure in signals on weighted graphs. In this paper, we first generalize graph Fourier…
The multiresolution analysis (MRA) associated with the Special affine Fourier transform (SAFT) provides a structured approach for generating orthonormal bases in \( L^2(\mathbb R) \), making it a powerful tool for advanced signal analysis.…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…
The nonlinear Schr\"odinger equation (NSE) is well-known to model an ideal fiber-optic communication channel. Even though the NSE is a nonlinear evolution equation, it can be solved analytically using a nonlinear Fourier transform (NFT).…
The Continuous Boostlet Transform (CBT) is introduced as a powerful tool for analyzing spatiotemporal signals, particularly acoustic wavefields. Overcoming the limitations of classical wavelets, the CBT leverages the Poincar\'e group and…
A sharper uncertainty inequality which exhibits a lower bound larger than that in the classical N-dimensional Heisenberg's uncertainty principle is obtained, and extended from N-dimensional Fourier transform domain to two N-dimensional…
The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value of an image, regardless of their properties in frequency…
In this paper, we have studied continuous fractional wavelet transform (CFrWT) in $n$-dimensional Euclidean space $\mathbb{R}^n$ with dilation parameter $\boldsymbol a=(a_{1},a_{2},\ldots,a_{n}),$ such that none of $a_{i}'s$ are zero.…