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.     

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.     

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.     

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.     

Linearly connected sequences and spectrally optimal dual frames for erasures

In the case that a frame is prescribed for applications and erasures occur in the process of data transmissions, we examine optimal dual frames for the recovery from single erasures. In contrast to earlier papers, we consider the spectral radius of the error operator instead of its operator norm as a measure of optimality. This notion of optimality is natural when the Neumann series is used to recover the original data in an iterative manner. We obtain a complete characterization of spectrally one-erasure optimal dual frames in terms of the redundancy distribution of the prescribed frame. Our characterization relies on the connection between erasure optimal frames and the linear connectivity property of the frame. We prove that the linear connectivity property is equivalent to the intersection dependent property, and is also closely related to the well-known concept of a k-independent set. Additionally, we also establish several necessary and sufficient conditions for the existence of an alternate dual frame to make the iterative reconstruction work.     

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.     

On Parseval super-frame wavelets

Suppose that η1,...,ηn are measurable functions in L2(R).We call the n-tuple (η1,…,ηn) a Parseval super frame wavelet of length n if {2k/2η1(2kt-)（@）...(@)2k/2ηn(2kt-l):k,l∈Z}is a Parseval frame for L2...     

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.      

Units of compatible nearrings

We study singly-generated wavelet systems on ${\mathbb {R}^2}$ that are naturally associated with rank-one wavelet systems on the Heisenberg group N. We prove a necessary condition on the generator in order that any such system be a Parseval frame. Given a suitable subset I of the dual of N, we give an explicit construction for Parseval frame wavelets that are associated with I. We say that ${g\in L^2(I\times \mathbb {R})}$ is Gabor field over I if, for a.e. ${\lambda \in I}$ , |??|^1/2 g(??, ·) is the Gabor generator of a Parseval frame for ${L^2(\mathbb {R})}$ , and that I is a Heisenberg wavelet set if every Gabor field over I is a Parseval frame (mother-)wavelet for ${L^2(\mathbb {R}^2)}$ . We then show that I is a Heisenberg wavelet set if and only if I is both translation congruent with a subset of the unit interval and dilation congruent with the Shannon set.     

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.     

On Dual Gabor Frame Pairs Generated by Polynomials

We provide explicit constructions of particularly convenient dual pairs of Gabor frames. We prove that arbitrary polynomials restricted to sufficiently large intervals will generate Gabor frames, at least for small modulation parameters. Unfortunately, no similar function can generate a dual Gabor frame, but we prove that almost any such frame has a dual generated by a B-spline. Finally, for frames generated by any compactly supported function φ whose integer-translates form a partition of unity, e.g., a B-spline, we construct a class of dual frame generators, formed by linear combinations of translates of φ. This allows us to chose a dual generator with special properties, for example, the one with shortest support, or a symmetric one in case the frame itself is generated by a symmetric function. One of these dual generators has the property of being constant on the support of the frame generator.     

Parseval Frame Wavelet Multipliers in L2（Rd）

Let A be a d × d real expansive matrix. An A-dilation Parseval frame wavelet is a function ?? ?? L ²(? ^d ), such that the set $ \left\{ {\left| {\det A} \right|^{\frac{n} {2}} \psi \left( {A^n t - \ell } \right):n \in \mathbb{Z},\ell \in \mathbb{Z}^d } \right\} $ forms a Parseval frame for L ²(? ^d ). A measurable function f is called an A-dilation Parseval frame wavelet multiplier if the inverse Fourier transform of d??? is an A-dilation Parseval frame wavelet whenever ?? is an A-dilation Parseval frame wavelet, where ??? denotes the Fourier transform of ??. In this paper, the authors completely characterize all A-dilation Parseval frame wavelet multipliers for any integral expansive matrix A with |det(A)| = 2. As an application, the path-connectivity of the set of all A-dilation Parseval frame wavelets with a frame MRA in L ²(? ^d ) is discussed.     

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.

     

Tight Gabor Frames Associated with Non-separable Lattices and the Hyperbolic Secant

We consider Gabor systems generated by a window given by the hyperbolic secant function. We show that such a system forms a Parseval frame for L ²(?) when the translations and modulations of the window are associated with certain non-separable lattices in ?² which we explicitly describe. We also study the more general problem of characterizing the positive Borel measures μ on ?²ⁿ with the property that the short-time Fourier transform defines an isometric embedding from L ²(? ⁿ ) to L _μ ² (?²ⁿ ) when the window belongs to the Schwartz class and, in particular, we characterize the extreme points of this set. In the case where the window is the hyperbolic secant function, we consider the situation where the measure is discrete with constant weights and supported on a non-separable lattice yielding a Parseval frame. We provide arithmetic conditions on the parameters defining the lattice characterizing when the associated measure is an extreme point.     

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.     

SOME RESULTS ON CONTROLLED FRAMES IN HILBERT SPACES

We use two appropriate bounded invertible operators to define a controlled frame with optimal frame bounds.We characterize those operators that produces Parseval controlled frames also we state a way to construct nearly Parseval controlled frames.We introduce a new perturbation of controlled frames to obtain new frames from a given one.Also we reduce the distance of frames by appropriate operators and produce nearly dual frames from two given frames which are not dual frames for each other.     

Attaching topological spaces to a module (I): Sobriety and spatiality

In this paper we study some frames associated to an R-module M. We define semiprimitive submodules and we prove that they form an spatial frame canonically isomorphic to the topology of $\mathrm{Max}(M)$. We characterize the soberness of $\mathrm{Max}(M)$ in terms of the point space of that frame. Beside of this, we study the regularity of an spatial frame associated to M given by annihilator conditions.     

Yet another patch construction for continuous frames and connections to the Fell compactification

It has been shown that the category of stably locally continuous frames and perfect frame homomorphisms reflects into the subcategory of continuous regular frames. The reflection functor is the patch frame construction, which has the following properties: For any stably locally continuous frame L and any regular frame M, a perfect frame homomorphism L → M factors uniquely through the patch frame of L. Furthermore, the patch is the universal solution to the problem of transforming the way–below relation into the well–inside relation. In this paper, we extend these results to the larger class of continuous frames, retaining functoriality and the universal properties, but at the price of sacrificing the reflection. We show that our patch construction can be obtained as a pushout involving the Fell compactification.     

Deterministic sampling of sparse trigonometric polynomials

One can recover sparse multivariate trigonometric polynomials from a few randomly taken samples with high probability (as shown by Kunis and Rauhut). We give a deterministic sampling of multivariate trigonometric polynomials inspired by Weil’s exponential sum. Our sampling can produce a deterministic matrix satisfying the statistical restricted isometry property, and also nearly optimal Grassmannian frames. We show that one can exactly reconstruct every M-sparse multivariate trigonometric polynomial with fixed degree and of length D from the determinant sampling X, using the orthogonal matching pursuit, and with |X| a prime number greater than (MlogD)². This result is optimal within the (logD)² factor. The simulations show that the deterministic sampling can offer reconstruction performance similar to the random sampling.     

Robust dimension reduction,fusion frames,and Grassmannian packings

We consider estimating a random vector from its measurements in a fusion frame, in presence of noise and subspace erasures. A fusion frame is a collection of subspaces, for which the sum of the projection operators onto the subspaces is bounded below and above by constant multiples of the identity operator. We first consider the linear minimum mean-squared error (LMMSE) estimation of the random vector of interest from its fusion frame measurements in the presence of additive white noise. Each fusion frame measurement is a vector whose elements are inner products of an orthogonal basis for a fusion frame subspace and the random vector of interest. We derive bounds on the mean-squared error (MSE) and show that the MSE will achieve its lower bound if the fusion frame is tight. We then analyze the robustness of the constructed LMMSE estimator to erasures of the fusion frame subspaces. We limit our erasure analysis to the class of tight fusion frames and assume that all erasures are equally important. Under these assumptions, we prove that tight fusion frames consisting of equi-dimensional subspaces have maximum robustness (in the MSE sense) with respect to erasures of one subspace among all tight fusion frames, and that the optimal subspace dimension depends on signal-to-noise ratio (SNR). We also prove that tight fusion frames consisting of equi-dimensional subspaces with equal pairwise chordal distances are most robust with respect to two and more subspace erasures, among the class of equi-dimensional tight fusion frames. We call such fusion frames equi-distance tight fusion frames. We prove that the squared chordal distance between the subspaces in such fusion frames meets the so-called simplex bound, and thereby establish connections between equi-distance tight fusion frames and optimal Grassmannian packings. Finally, we present several examples for the construction of equi-distance tight fusion frames.