The present paper for the first time constructs a frame/dual frame pair of shearlet type such that both frames possess the distinctive time-frequency localization properties needed in establishing their desirable approximation properties. Our construction is based on a careful pasting together of two bandlimited shearlet Parseval frames associated with two different frequency cones, inspired by...

for all x∈H . When A = B the frame is said to be tight and if in addition, A = B = 1 it is termed a Parseval frame. When F = { fi}i=1 is a frame, we shall abuse notations and denote by F again, the n×M matrix whose ith column is fi, and where n is the dimension of H . Using this notation, the frame operator is the n×n matrix S=FF∗ where F∗ is the adjoint of F . It is a folklore to note that F i...

In this chapter we survey several recent results on the existence of frames with prescribed norms and frame operator. These results are equivalent to Schur-Horn type theorems which describe possible diagonals of positive self-adjoint operators with specified spectral properties. The first infinite dimensional result of this type is due to Kadison who characterized diagonals of orthogonal projec...

Functional Gabor single-frame or multi-frame generator multipliers are the matrices of function entries that preserve Parseval generators. An interesting and natural question is how to characterize all such multipliers. This has been answered for several special cases including case generators in two dimensions one-dimension. In this paper we completely with respect separable time-frequency lat...

Frames are an essential tool for many emerging applications such as data transmission. Their main advantage is the fact that frames can be designed to be redundant while still providing reconstruction formulas. This makes them robust against noise and losses while allowing freedom in design (see, for example, [5, 10]). Due to their numerical stability, tight frames and Parseval frames are of in...

In [13] frames of subspaces extended to continuous version namely c-frame of subspaces. In this article we consider to the relations between cframes of subspaces and local c-frames. Also in this article we give some important relation about duality and parseval c-frames of subspaces.

New ideas were introduced in [3] 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.

We give a $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time for an undirected planar graph $G$ with $n$ vertices and non-negative edge lengths. For $\epsilon>0$ and any two vertices $u$ and $v$ in $G$, our oracle gives a distance $\tilde{d}(u,v)$ with stretch $(1+\epsilon)$ in $O(1)$ time. The oracle has size $O(n\log n ((\log n)/\epsilon+f(\epsilon)))$ and pre-processing time $...

The excess of a sequence in a Hilbert space H is the greatest number of elements that can be removed yet leave a set with the same closed span. This paper proves that if F is a frame for H and there exist infinitely many elements gn ∈ F such that F \ {gn} is complete for each individual n and if there is a uniform lower frame bound L for each frame F \ {gn}, then for each ε > 0 there exists an ...

Given a set of functions F = {f1, . . . , fm} ⊂ L2(R), we study the problem of finding the shift-invariant space V with n generators {φ1, . . . , φn} that is “closest” to the functions of F in the sense that V = argminV ′∈Vn m X i=1 wi‖fi − PV ′fi‖, where wis are positive weights, and Vn is the set of all shift-invariant spaces that can be generated by n or less generators. The Eckart-Young The...