Related papers: Finite equal norm Parseval Wavelet Frames over Pri…
In this article, we present a constructive method for computing the frame coefficients of finite wavelet frames over prime fields using tools from computational harmonic analysis and group theory.
Let $q\geq 2$ be an integer, and $\Bbb F_q^d$, $d\geq 1$, be the vector space over the cyclic space $\Bbb F_q$. The purpose of this paper is two-fold. First, we obtain sufficient conditions on $E \subset \Bbb F_q^d$ such that the inverse…
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…
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…
Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of…
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…
This paper introduces some foundations of wavelets over Galois fields. Standard orthogonal finite-field wavelets (FF-Wavelets) including FF-Haar and FF-Daubechies are derived. Non-orthogonal FF-wavelets such as B-spline over GF(p) are also…
In this paper, we introduce a new (constructive) characterization of tight wavelet frames on non-flat domains in both continuum setting, i.e. on manifolds, and discrete setting, i.e. on graphs; discuss how fast tight wavelet frame…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
In analogy with steerable wavelets, we present a general construction of adaptable tight wavelet frames, with an emphasis on scaling operations. In particular, the derived wavelets can be "dilated" by a procedure comparable to the operation…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
In this paper, we propose a new method for the construction of multi-dimensional, wavelet-like families of affine frames, commonly referred to as framelets, with specific directional characteristics, small and compact support in space,…
We provide constructive necessary and sufficient conditions for a family of periodic wavelets to be a Parseval wavelet frame. The criterion generalizes unitary and oblique extension principles. The case of one wavelet generator and…
In this paper, an algorithm based on polyphase matrix for constructing a pair of orthogonal wavelet frames is suggested, and a general form for all orthogonal tight wavelet frames on local fields of positive characteristic is described.…
The wavelet scattering transform creates geometric invariants and deformation stability. In multiple signal domains, it has been shown to yield more discriminative representations compared to other non-learned representations and to…
Digital Transforms have important applications on subjects such as channel coding, cryptography and digital signal processing. In this paper, two Fourier Transforms are considered, the discrete time Fourier transform (DTFT) and the finite…
For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\omega/2 + \epsilon})$ operations, for any $\epsilon > 0$. Here, $\omega$ is the exponent…
Continuing the ideas from our previous paper, we construct Parseval frames of weighted exponential functions for self-affine measures.
An explicit description of all Walsh polynomials generating tight wavelet frames is given. An algorithm for finding the corresponding wavelet functions is suggested, and a general form for all wavelet frames generated by an appropriate…
In the paper we design a Parseval wavelet frame with a compact support and many vanishing moments. The corresponding refinement mask approximates an arbitrary continuous periodic function $f$, $f(0)=1$. The refinable function has stable…