In this paper we wish to present a new class of tight frames on the sphere. These frames have excellent pointwise localization and approximation properties. These properties are based on pointwise localization of kernels arising in the spectral calculus for certain self-adjoint operators, and on a positive-weight quadrature formula for the sphere that the authors have recently developed. Improv...

The aim of this paper is to investigate symmetry properties of tight frames, with a view to constructing tight frames of orthogonal polynomials in several variables which share the symmetries of the weight function, and other similar applications. This is achieved by using representation theory to give methods for constructing tight frames as orbits of groups of unitary transformations acting o...

Glossary 5 Introduction 6 Definition of Wavelets 7 Definition of Filters 8 Multi-Resolution Analysis 9 Wavelet Decomposition and Reconstruction 10 Refinable Functions 11 Compactly Supported Orthonormal Wavelets 12 Parameterization of Orthonormal Wavelets 13 Biorthogonal Wavelets 14 Prewavelets 15 Tight Wavelet Frames 16 Tight Wavelet Frames over Bounded Domain 17 q-Dilated Orthonormal Wavelets ...

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...

Introduction to Frames . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Frame Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 Tight Frames . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 More Precise Frame Bound...

For a given class F of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation |〈fk, fl〉| among all frames {fk}k∈I ∈ F . We first analyze finite-dimensional Grassmannian frames. Using links to packings in Grassmannian spaces and antipodal spherical codes we derive bounds on the minimal achievable correlation for Grassmannian frames. These ...

Finite tight frames for polynomial subspaces are constructed using monic Hahn polynomials and Krawtchouk polynomials of several variables. Based on these polynomial frames, two methods for constructing tight frames for the Euclidean spaces are designed. With r(d, n) := ( n+d−1 n ) , the first method generates, for each m ≥ n, two families of tight frames in R with r(d + 1,m) elements. The secon...