The road to equal-norm Parseval frames

The construction of equal-norm Parseval frames is fundamental for many applications of frame theory. We present a construction method based on a system of ordinary differential equations, which generates a flow on the set of Parseval frames that converges to equal-norm Parseval frames. We developed this method to address a question posed by Vern Paulsen: How close is a nearly equal-norm, nearly Parseval frame to an equal-norm Parseval frame? The distance estimate derived here can be used to substantiate numerically found, approximate constructions of equal-norm Parseval frames. The estimate is valid for a fairly general class of frames — requiring that the dimension of the Hilbert space and the number of frame vectors is relatively prime. In addition, we re-phrase our distance estimate to show that certain projection matrices which are nearly constant on the diagonal are close in Hilbert-Schmidt norm to ones which have a constant diagonal.     

Super-Wavelets and Decomposable Wavelet Frames

A wavelet frame is called decomposable whenever it is equivalent to a superwavelet frame of length greater than one. Decomposable wavelet frames are closely related to some problems on super-wavelets. In this article we first obtain some necessary or sufficient conditions for decomposable Parseval wavelet frames. As an application of these conditions, we prove that for each n > 1 there exists a Parseval wavelet frame which is m-decomposable for any 1 < m ≤ n, but not k-decomposable for any k > n. Moreover, there exists a super-wavelet whose components are non-decomposable. Similarly we also prove that for each n > 1, there exists a Parseval wavelet frame that can be extended to a super-wavelet of length m for any 1 < m ≤ n, but can not be extended to any super-wavelet of length k with k > n. The connection between decomposable Parseval wavelet frames and super-wavelets is investigated, and some necessary or sufficient conditions for extendable Parseval wavelet frames are given.     

Dualizable Shearlet Frames and Sparse Approximation

Shearlet systems have been introduced as directional representation systems, which provide optimally sparse approximations of a certain model class of functions governed by anisotropic features while allowing faithful numerical realizations by a unified treatment of the continuum and digital realm. They are redundant systems, and their frame properties have been extensively studied. In contrast to certain band-limited shearlets, compactly supported shearlets provide high spatial localization but do not constitute Parseval frames. Thus reconstruction of a signal from shearlet coefficients requires knowledge of a dual frame. However, no closed and easily computable form of any dual frame is known. In this paper, we introduce the class of dualizable shearlet systems, which consist of compactly supported elements and can be proved to form frames for \(L^2({\mathbb {R}}^2)\). For each such dualizable shearlet system, we then provide an explicit construction of an associated dual frame, which can be stated in closed form and is efficiently computed. We also show that dualizable shearlet frames still provide near optimal sparse approximations of anisotropic features.     

Further results on the connectivity of Parseval frame wavelets

In a previous paper, the authors introduced new ideas to treat the problem of connectivity of Parseval frames. With these ideas it was shown that a large set of Parseval frames is arcwise connected. In this article we exhibit a larger class of Parseval frames for which the arcwise connectivity is true. This larger class fails to include all Parseval frames.

     

Parseval frame wavelets with -dilations

We study Parseval frame wavelets in with matrix dilations of the form , where A is an arbitrary expanding n×n matrix with integer coefficients, such that |detA|=2. We show that each A-MRA admits either Parseval frame wavelets, or Parseval frame bi-wavelets. The minimal number of generators for a Parseval frame associated with an A-MRA (i.e. 1 or 2) is determined in terms of a scaling function. All Parseval frame (bi)wavelets associated with A-MRA's are described. We then introduce new classes of filter induced wavelets and bi-wavelets. It is proved that these new classes strictly contain the classes of all A-MRA Parseval frame wavelets and bi-wavelets, respectively. Finally, we demonstrate a method of constructing all filter induced Parseval frame (bi)wavelets from generalized low-pass filters.     

Full Spark Frames

Finite frame theory has a number of real-world applications. In applications like sparse signal processing, data transmission with robustness to erasures, and reconstruction without phase, there is a pressing need for deterministic constructions of frames with the following property: every size-M subcollection of the M-dimensional frame elements is a spanning set. Such frames are called full spark frames, and this paper provides new constructions using the discrete Fourier transform. Later, we prove that full spark Parseval frames are dense in the entire set of Parseval frames, meaning full spark frames are abundant, even if one imposes an additional tightness constraint. Finally, we prove that testing whether a given matrix is full spark is hard for NP under randomized polynomial-time reductions, indicating that deterministic full spark constructions are particularly significant because they guarantee a property which is otherwise difficult to check.     

Directional Haar wavelet frames on triangles

Traditional wavelets are not very effective in dealing with images that contain orientated discontinuities (edges). To achieve a more efficient representation one has to use basis elements with much higher directional sensitivity. In recent years several approaches like curvelets and shearlets have been studied providing essentially optimal approximation properties for images that are piecewise smooth and have discontinuities along C²-curves. While curvelets and shearlets have compact support in frequency domain, we construct directional wavelet frames generated by functions with compact support in time domain. Our Haar wavelet constructions can be seen as special composite dilation wavelets, being based on a generalized multiresolution analysis (MRA) associated with a dilation matrix and a finite collection of ‘shear’ matrices. The complete system of constructed wavelet functions forms a Parseval frame. Based on this MRA structure we provide an efficient filter bank algorithm. The freedom obtained by the redundancy of the applied Haar functions will be used for an efficient sparse representation of piecewise constant images as well as for image denoising.     

Parseval frames for ICC groups

We analyze Parseval frames generated by the action of an ICC group on a Hilbert space. We parametrize the set of all such Parseval frames by operators in the commutant of the corresponding representation. We characterize when two such frames are strongly disjoint. We prove an undersampling result showing that if the representation has a Parseval frame of equal norm vectors of norm , the Hilbert space is spanned by an orthonormal basis generated by a subgroup. As applications we obtain some sufficient conditions under which a unitary representation admits a Parseval frame which is spanned by a Riesz sequences generated by a subgroup. In particular, every subrepresentation of the left-regular representation of a free group has this property.     

Minimally Supported Frequency Composite Dilation Parseval Frame Wavelets

A composite dilation Parseval frame wavelet is a collection of functions generating a Parseval frame for L ²(ℝ ⁿ ) under the actions of translations from a full rank lattice and dilations by products of elements of groups A and B. A minimally supported frequency composite dilation Parseval frame wavelet has generating functions whose Fourier transforms are characteristic functions of sets contained in a lattice tiling set. Constructive proofs are used to establish the existence of minimally supported frequency composite dilation Parseval frame wavelets in arbitrary dimension using any finite group B, any full rank lattice, and an expanding matrix generating the group A and normalizing the group B. Moreover, every such system is derived from a Parseval frame multiresolution analysis. Multiple examples are provided including examples that capture directional information.      

A new identity for Parseval frames

In this paper we establish a surprising new identity for Parseval frames in a Hilbert space. Several variations of this result are given, including an extension to general frames. Finally, we discuss the derived results.

     

Sparse fusion frames: existence and construction

Fusion frame theory is an emerging mathematical theory that provides a natural framework for performing hierarchical data processing. A fusion frame can be regarded as a frame-like collection of subspaces in a Hilbert space, and thereby generalizes the concept of a frame for signal representation. However, when the signal and/or subspace dimensions are large, the decomposition of the signal into its fusion frame measurements through subspace projections typically requires a large number of additions and multiplications, and this makes the decomposition intractable in applications with limited computing budget. To address this problem, in this paper, we introduce the notion of a sparse fusion frame, that is, a fusion frame whose subspaces are generated by orthonormal basis vectors that are sparse in a ‘uniform basis’ over all subspaces, thereby enabling low-complexity fusion frame decompositions. We study the existence and construction of sparse fusion frames, but our focus is on developing simple algorithmic constructions that can easily be adopted in practice to produce sparse fusion frames with desired (given) operators. By a desired (or given) operator we simply mean one that has a desired (or given) set of eigenvalues for the fusion frame operator. We start by presenting a complete characterization of Parseval fusion frames in terms of the existence of special isometries defined on an encompassing Hilbert space. We then introduce two general methodologies to generate new fusion frames from existing ones, namely the Spatial Complement Method and the Naimark Complement Method, and analyze the relationship between the parameters of the original and the new fusion frame. We proceed by establishing existence conditions for 2-sparse fusion frames for any given fusion frame operator, for which the eigenvalues are greater than or equal to two. We then provide an easily implementable algorithm for computing such 2-sparse fusion frames.     

Wavelet and Weyl Transforms Associated with the Spherical Mean Operator

The admissible wavelets associated with spherical mean operator and corresponding Weyl transforms are defined. The admissible condition is given in the generalized Fourier transforms, and Plancherel formula, Parseval formula, Reproducing formula and Reproducing kernel are studied. The criteria of boundedness of the Weyl transform on the L^p– spaces is given in term of the symbol function .     

Smooth Functions Associated with Wavelet Sets on ℝ d , d≥1, and Frame Bound Gaps

The theme is to smooth characteristic functions of Parseval frame wavelet sets by convolution in order to obtain implementable, computationally viable, smooth wavelet frames. We introduce the following: a new method to improve frame bound estimation; a shrinking technique to construct frames; and a nascent theory concerning frame bound gaps. The phenomenon of a frame bound gap occurs when certain sequences of functions, converging in L ² to a Parseval frame wavelet, generate systems with frame bounds that are uniformly bounded away from 1. We prove that smoothing a Parseval frame wavelet set wavelet on the frequency domain by convolution with elements of an approximate identity produces a frame bound gap. Furthermore, the frame bound gap for such frame wavelets in L ²(? ^d ) increases and converges as d increases.     

The extrapolation of band-limited signals in L2 with sampling errors

In this paper we will provide a theory for an extrapolation algorithm of band-limited signals with sampling errors or low noises. The main result is as follows: Suppose thatf(t) is in L² and is a continuous Ω band-limited signal. Then for any positive numbers T, A(>T) and ε, there exists a δ>0 such that when the sampling errors (or noises) off(t) on [−T, T] is less than δ we can extrapolate the values off(t) on the interval [−A, A] such that the difference between the extrapolated value and the exact value off(t) does not exceed ε.     

Procrustes Problems and Parseval Quasi-Dual Frames

Parseval frames have particularly useful properties, and in some cases, they can be used to reconstruct signals which were analyzed by a non-Parseval frame. In this paper, we completely describe the degree to which such reconstruction is feasible. Indeed, notice that for fixed frames \({\mathcal{F}}\) and \({\mathcal{X}}\) with synthesis operators F and X, the operator norm of FX ^??I measures the (normalized) worst-case error in the reconstruction of vectors when analyzed with \({\mathcal{X}}\) and synthesized with \({\mathcal{F}}\) . Hence, for any given frame \({\mathcal{F}}\) , we compute explicitly the infimum of the operator norm of FX ^??I, where \({\mathcal{X}}\) is any Parseval frame. The \({\mathcal{X}}\) ’s that minimize this quantity are called Parseval quasi-dual frames of \({\mathcal{F}}\) . Our treatment considers both finite and infinite Parseval quasi-dual frames.     

Examples of frames on the Cantor dyadic group

We present two ways to construct frames on the locally compact Cantor dyadic group. The first approach gives a Parseval frame related to the generalized Walsh?CDirichlet kernel, while the second approach includes the Daubechies-type ??admissible condition?? and leads to dyadic compactly supported wavelet frames. The corresponding wavelet constructions on the Cantor and Vilenkin groups (as well as on the half-line $ {\mathbb{R}_{+} } $ ) requires an additional constraint related to the requirement that the masks have no blocking sets.     

L~2(R~n)上的半正交多小波框架

本文研究L2(Rn)上伸缩矩阵A满足|detA|1的半正交多小波框架.本文得到半正交和严格半正交框架的一系列性质及刻画.本文证明半正交Parseval多小波框架与广义多分辨分析(GMRA)Parseval多小波框架是等价的.特别地,本文利用最小频率支撑(MSF)多小波框架和小波集,构造若干半正交多小波框架的例子.     

SOME PROPERTIES OF OPERATOR-VALUED FRAMES

Operator-valued frames(or g-frames) are generalizations of frames and fusion frames and have been used in packets encoding, quantum computing, theory of coherent states and more. In this article, we give a new formula for operator-valued frames for finite dimensional Hilbert spaces. As an application, we derive in a simple manner a recent result of A. Najati concerning the approximation of g-frames by Parseval ones. We obtain also some results concerning the best approximation of operator-valued frames by its alternate duals,with optimal estimates.