Density, Overcompleteness, and Localization of Frames. II. Gabor Systems

This work develops a quantitative framework for describing the overcompleteness of a large class of frames. A previous article introduced notions of localization and approximation between two frames F = {f_i}_i∈I and E = {e_j}_j∈G (G a discrete abelian group), relating the decay of the expansion of the elements of F in terms of the elements of E via a map a : I → G. This article shows that those abstract results yield an array of new implications for irregular Gabor frames. Additionally, various Nyquist density results for Gabor frames are recovered as special cases, and in the process both their meaning and implications are clarified. New results are obtained on the excess and overcompleteness of Gabor frames, on the relationship between frame bounds and density, and on the structure of the dual frame of an irregular Gabor frame. More generally, these results apply both to Gabor frames and to systems of Gabor molecules, whose elements share only a common envelope of concentration in the time-frequency plane. The notions of localization and related approximation properties are a spectrum of ideas that quantify the degree to which elements of one frame can be approximated by elements of another frame. In this article, a comprehensive examination of the interrelations among these localization and approximation concepts is made, with most implications shown to be sharp.     

Excess of a class of g-frames

In this paper, we study the relationship between frames for the super Hilbert space H⊕H and g-frames for H with respect to C². We show that a g-frame associated with a frame for H⊕H remains a g-frame whenever any one of its elements is removed. Furthermore, we show that the excess of such a g-frame is at least dimH.     

Perturbations of Banach Frames and Atomic Decompositions

Banach frames and atomic decompositions are sequences that have basis-like properties but which need not be bases. In particular, they allow elements of a Banach space to be written as linear combinations of the frame or atomic decomposition elements in a stable manner. In this paper we prove several functional — analytic properties of these decompositions, and show how these properties apply to Gabor and wavelet systems. We first prove that frames and atomic decompositions are stable under small perturbations. This is inspired by corresponding classical perturbation results for bases, including the Paley — Wiener basis stability criteria and the perturbation theorem el kato. We introduce new and weaker conditions which ensure the desired stability. We then prove quality properties of atomic decompositions and consider some consequences for Hilbert frames. Finally, we demonstrate how our results apply in the practical case of Gabor systems in weighted L² spaces. Such systems can form atomic decompositions for L²_w(IR), but cannot form Hilbert frames but L²_w(IR) unless the weight is trivial.     

Continuous Frames, Function Spaces, and the Discretization Problem

A continuous frame is a family of vectors in a Hilbert space which allows reproductions of arbitrary elements by continuous superpositions. Associated to a given continuous frame we construct certain Banach spaces. Many classical function spaces can be identified as such spaces. We provide a general method to derive Banach frames and atomic decompositions for these Banach spaces by sampling the continuous frame. This is done by generalizing the coorbit space theory developed by Feichtinger and Gröchenig. As an important tool the concept of localization of frames is extended to continuous frames. As a byproduct we give a partial answer to the question raised by Ali, Antoine, and Gazeau whether any continuous frame admits a corresponding discrete realization generated by sampling.     

Random Tight Frames

We introduce probabilistic frames to study finite frames whose elements are chosen at random. While finite tight frames generalize orthonormal bases by allowing redundancy, independent, uniformly distributed points on the sphere approximately form a finite unit norm tight frame (FUNTF). In the present paper, we develop probabilistic versions of tight frames and FUNTFs to significantly weaken the requirements on the random choice of points to obtain an approximate finite tight frame. Namely, points can be chosen from any probabilistic tight frame, they do not have to be identically distributed, nor have unit norm. We also observe that classes of random matrices used in compressed sensing are induced by probabilistic tight frames.     

An uncertainty principle for finite frames

We consider the notion of uncertainty for finite frames. Using a difference operator inspired by the Gauss-Hermite differential equation we obtain a time-frequency measure for finite frames. We then find the minimizer of the measure over all equal norm Parseval frames, dependent on the dimension of the space and the number of elements in the frame. Next we show that given a frame one can find the dual frame that minimizes this time-frequency measure, generalizing some work of Daubechies, Landau and Landau to the finite case and extending some recent work on Sobolev duals for finite frames.     

A Characterization of Schauder Frames Which Are Near-Schauder Bases

A basic problem of interest in connection with the study of Schauder frames in Banach spaces is that of characterizing those Schauder frames which can essentially be regarded as Schauder bases. In this paper, we give a solution to this problem using the notion of the minimal-associated sequence spaces and the minimal-associated reconstruction operators for Schauder frames. We prove that a Schauder frame is a near-Schauder basis if and only if the kernel of the minimal-associated reconstruction operator contains no copy of c ₀. In particular, a Schauder frame of a Banach space with no copy of c ₀ is a near-Schauder basis if and only if the minimal-associated sequence space contains no copy of c ₀. In these cases, the minimal-associated reconstruction operator has a finite dimensional kernel and the dimension of the kernel is exactly the excess of the near-Schauder basis. Using these results, we make related applications on Besselian frames and near-Riesz bases.     

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.     

Representation of the inverse of a frame multiplier

Certain mathematical objects appear in a lot of scientific disciplines, like physics, signal processing and, naturally, mathematics. In a general setting they can be described as frame multipliers, consisting of analysis, multiplication by a fixed sequence (called the symbol), and synthesis. In this paper we show a surprising result about the inverse of such operators, if any, as well as new results about a core concept of frame theory, dual frames. We show that for semi-normalized symbols, the inverse of any invertible frame multiplier can always be represented as a frame multiplier with the reciprocal symbol and dual frames of the given ones. Furthermore, one of those dual frames is uniquely determined and the other one can be arbitrarily chosen. We investigate sufficient conditions for the special case, when both dual frames can be chosen to be the canonical duals. In connection to the above, we show that the set of dual frames determines a frame uniquely. Furthermore, for a given frame, the union of all coefficients of its dual frames is dense in ?²${?}^2$. We also introduce a class of frames (called pseudo-coherent frames), which includes Gabor frames and coherent frames, and investigate invertible pseudo-coherent frame multipliers, allowing a classification for frame-type operators for these frames. Finally, we give a numerical example for the invertibility of multipliers in the Gabor case.     

(p,Y)-算子框架的稳定性

In this paper we study the stability of（p,Y）-operator frames.We firstly discuss the relations between p-Bessel sequences（or p-frames） and（p,Y）-operator Bessel sequences（or（p,Y）-operator frames）.Through defining a new union,we prove that adding some elements to a given（p,Y）-operator frame,the resulted sequence will be still a（p,Y）-operator frame.We obtain a necessary and sufficient condition for a sequence of compound operators to be a（p,Y）operator frame.Lastly,we show that（p,Y）-operator frames for X are stable under some small perturbations.     

Invariances of frame sequences under perturbations

This paper determines the exact relationships that hold among the major Paley-Wiener perturbation theorems for frame sequences. It is shown that major properties of a frame sequence such as excess, deficit, and rank remain invariant under Paley-Wiener perturbations, but need not be preserved by compact perturbations. For localized frames, which are frames with additional structure, it is shown that the frame measure function is also preserved by Paley-Wiener perturbations.     

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.     

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.     

Approximations for Gabor and wavelet frames

Let be a frame vector under the action of a collection of unitary operators . Motivated by the recent work of Frank, Paulsen and Tiballi and some application aspects of Gabor and wavelet frames, we consider the existence and uniqueness of the best approximation by normalized tight frame vectors. We prove that for any frame induced by a projective unitary representation for a countable discrete group, the best normalized tight frame (NTF) approximation exists and is unique. Therefore it applies to Gabor frames (including Gabor frames for subspaces) and frames induced by translation groups. Similar results hold for semi-orthogonal wavelet frames.

     

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.     

Decomposition of Analysis Operators and Frame Ranges for Continuous Frames

In this article, the measure space associated with a continuous frame is supposed to be σ-finite and positive, and a frame range is the range of the analysis operator for a continuous frame. Gabardo and Han in 2003 asked whether two frame ranges can both be contained in another one. To solve this problem, we give two decompositions of analysis operators and frame ranges for continuous frames respectively, which essentially establish a relationship between continuous frames and Hilbert-Schmidt operator valued frames. As applications, it follows that only separable Hilbert space can have a continuous frame, that there exists a continuous frame of Riesz-type if and only if the associated measure space is purely atomic, and that the sum of two frame ranges is still a frame range when the sum is closed. Finally, we construct a counterexample which shows that the Gabardo-Han problem is not necessarily true in general.     

Finite-dimensional approximation of the inverse frame operator

A frame in a Hilbert space allows every element in to be written as a linear combination of the frame elements, with coefficients called frame coefficients. Calculations of those coefficients and many other situations where frames occur, requires knowledge of the inverse frame operator. But usually it is hard to invert the frame operator if the underlying Hilbert space is infinite dimensional. In the present paper we introduce a method for approximation of the inverse frame operator using finite subsets of the frame. In particular this allows to approximate the frame coefficients (even inl ²) using finite-dimensional linear algebra. We show that the general method simplifies in the important cases of Weil-Heisenberg frames and wavelet frames.     

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.     

Auto-tuning unit norm frames

Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be robust against additive noise and erasures, and as such, have great potential as encoding schemes. Unfortunately, up to this point, these frames have proven notoriously difficult to construct. Indeed, though the set of all unit norm tight frames, modulo rotations, is known to contain manifolds of nontrivial dimension, we have but a small finite number of known constructions of such frames. In this paper, we present a new iterative algorithm—gradient descent of the frame potential—for increasing the degree of tightness of any finite unit norm frame. The algorithm itself is easy to implement, and it preserves certain group structures present in the initial frame. In the special case where the number of frame elements is relatively prime to the dimension of the underlying space, we show that this algorithm converges to a unit norm tight frame at a linear rate, provided the initial unit norm frame is already sufficiently close to being tight. By slightly modifying this approach, we get a similar, but weaker, result in the non-relatively-prime case, providing an explicit answer to the Paulsen problem: “How close is a frame which is almost tight and almost unit norm to some unit norm tight frame?”     

Perfect compactifications of frames

Perfect compactifications of frames are introduced. It is shown that the Stone-Čech compactification is an example of such a compactification. We also introduce rim-compact frames and for such frames we define its Freudenthal compactification, another example of a perfect compactification. The remainder of a rim-compact frame in its Freudenthal compactification is shown to be zero-dimensional. It is shown that with the assumption of the Boolean Ultrafilter Theorem the Freudenthal compactification for spaces, as well as the Freudenthal-Morita Theorem for spaces, can be obtained from our frame constructions.