Related papers: Finite equal norm Parseval Wavelet Frames over Pri…
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely…
We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie…
Wavelet and frames have become a widely used tool in mathematics, physics, and applied science during the last decade. This article gives an overview over some well known results about the continuous and discrete wavelet transforms and…
In this work, we first give some mathematical preliminaries concerning the generalized prolate spheroidal wave function (GPSWFs). These set of special functions have been introduced in [16] and [7] and they are defined as the infinite and…
As a generalization of orthonormal wavelets in $L_2(R)$, tight framelets (also called tight wavelet frames) are of importance in wavelet analysis and applied sciences due to their many desirable properties in applications such as image…
Two scaling functions $\varphi_A$ and $\varphi_B$ for Parseval frame wavelets are algebraically isomorphic, $\varphi_A \simeq \varphi_B$, if they have matching solutions to their (reduced) isomorphic systems of equations. Let $A$ and $B$ be…
Gabardo and Nashed have studied nonuniform wavelets based on the theory of spectral pairs for which the associated translation set $\Lambda =\left\{ 0,r/N\right\}+2\,\mathbb Z$ is no longer a discrete subgroup of $\mathbb R$ but a spectrum…
In this paper we propose a procedure which allows the construction of a large family of FIR d x d matrix wavelet filters by exploiting the one-to-one correspondence between QMF systems and orthogonal operators which commute with the shifts…
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in error correction coding. Hence, reducing the computational complexities of DFTs is of great significance, especially for long DFTs as increasingly longer…
Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally robust against additive noise and erasures, and as such, have great potential…
Discrete wavelet transform of finite-length signals must necessarily handle the signal boundaries. The state-of-the-art approaches treat such boundaries in a complicated and inflexible way, using special prolog or epilog phases. This holds…
In this paper we will look at the connection of frames and finite dimensionality. A main focus is to present simple algorithms and make them available online. The main result is a way to 'switch' between different frames, giving an…
The empirical wavelet transform is an adaptive multiresolution analysis tool based on the idea of building filters on a data-driven partition of the Fourier domain. However, existing 2D extensions are constrained by the shape of the…
In this paper, we present a finite element method (FEM) framework enhanced by an operator-adapted wavelet decomposition algorithm designed for the efficient analysis of multiscale electromagnetic problems. Usual adaptive FEM approaches,…
In this paper we characterize and construct novel oversampled filter banks implementing fusion frames. A fusion frame is a sequence of orthogonal projection operators whose sum can be inverted in a numerically stable way. When properly…
The constant center frequency to bandwidth ratio (Q-factor) of wavelet transforms provides a very natural representation for audio data. However, invertible wavelet transforms have either required non-uniform decimation -- leading to…
We propose a novel efficient and robust Wavelet-based Edge Multiscale Finite Element Method (WEMsFEM) motivated by \cite{MR3980476,GL18} to solve the singularly perturbed convection-diffusion equations. The main idea is to first establish a…
We introduce a fast algorithm for generating long self-affine profiles. The algorithm, which is based on the fast wavelet transform, is faster than the conventional Fourier filtering algorithm. In addition to increased performance for large…
We study the construction of Gabor frames and wavelet frames for Weyl-Heisenberg group and extended affine group by using contraction between the affine group and the Weyl-Heisenberg group due to Subag, Baruch, Birman and Mann. Firstly, we…
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,…