Sparse fusion frames: existence and construction

DOI10.1007/S10444-010-9162-3MaRDI QIDQ647422zbMATHOpenAlexDBLPWikidataFDO

Authors Robert Calderbank, Peter G. Casazza, Andreas Heinecke, Gitta Kutyniok, Ali Pezeshki

Publication date 23 November 2011

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0906.5606

zbMATH Keywords

signal processingsparsityHilbert spacesself-adjoint operatorsfusion frameshierarchical data processing

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Inner product spaces and their generalizations, Hilbert spaces (46C99)

Abstract: Fusion frame theory is an emerging mathematical theory that provides a natural framework for performing hierarchical data processing. A fusion frame is a frame-like collection of subspaces in a Hilbert space, thereby generalizing the concept of a frame for signal representation. In this paper, we study the existence and construction of fusion frames. We first present a complete characterization of a special class of fusion frames, called Parseval fusion frames. The value of Parseval fusion frames is that the inverse fusion frame operator is equal to the identity and therefore signal reconstruction can be performed with minimal complexity. We then introduce two general methods -- the spatial complement and the Naimark complement -- for constructing a new fusion frame from a given fusion frame. We then establish existence conditions for fusion frames with desired properties. In particular, we address the following question: Given $M,N,minNN$ and ${lambd{a}_j}_{j=1}^M$, does there exist a fusion frame in $R{R}^M$ with $N$ subspaces of dimension $m$ for which ${lambd{a}_j}_{j=1}^M$ are the eigenvalues of the associated fusion frame operator? We address this problem by providing an algorithm which computes such a fusion frame for almost any collection of parameters $M,N,minNN$ and ${lambd{a}_j}_{j=1}^M$. Moreover, we show how this procedure can be applied, if subspaces are to be added to a given fusion frame to force it to become Parseval.

Recommendations

• Non-orthogonal fusion frames and the sparsity of fusion frame operators
• Fusion frames and distributed sparsity
• Constructing tight fusion frames
• Fusion frames and the restricted isometry property
• Construction of fusion frame systems in finite dimensional Hilbert spaces
• Tight and random nonorthogonal fusion frames
• Orthogonal projection decomposition of matrices and construction of fusion frames
• Sparse matrices in frame theory
• Sparse Recovery From Combined Fusion Frame Measurements
• Weighted fusion frame construction via spectral tetris

Cites work

• scientific article; zbMATH DE number 2144539 (Why is no real title available?)
• scientific article; zbMATH DE number 2144540 (Why is no real title available?)
• scientific article; zbMATH DE number 1424495 (Why is no real title available?)
• A generalization of Gram-Schmidt orthogonalization generating all Parseval frames
• A quantitative notion of redundancy for finite frames
• An introduction to frames and Riesz bases
• Approximation of dual Gabor frames, window decay, and wireless communications
• Compressed sensing
• Constructing tight fusion frames
• Dual Gabor frames: theory and computational aspects
• Ellipsoidal tight frames and projection decompositions of operators
• Existence and construction of finite frames with a given frame operator
• Existence and construction of finite tight frames
• Finite normalized tight frames
• Frame paths and error bounds for sigma-delta quantization
• Framelets: MRA-based constructions of wavelet frames
• Frames, bases and group representations
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Fusion frames and distributed processing
• Grassmannian frames with applications to coding and communication
• Minimizing fusion frame potential
• New tight frames of curvelets and optimal representations of objects with piecewise C² singularities
• On signal reconstruction without phase
• On the spectra of sums of orthogonal projections with applications to parallel computing
• Optimal linear transmission by loss-insensitive packet encoding
• Optimal tight frames and quantum measurement
• Robust dimension reduction, fusion frames, and Grassmannian packings
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Robustness of fusion frames under erasures of subspaces and of local frame vectors
• Sampling with arbitrary sampling and reconstruction spaces and oblique dual frame vectors
• Sparse Recovery From Combined Fusion Frame Measurements
• The analysis and design of windowed Fourier frame based multiple description source coding schemes
• The art of frame theory
• The canonical dual frame of a wavelet frame
• The structure of minimizers of the frame potential on fusion frames

Cited in

(30)

• A quantitative notion of redundancy for finite frames
• Numerically erasure-robust frames
• Equichordal tight fusion frames
• Prime tight frames
• Every Hilbert space frame has a Naimark complement
• Decomposition of a Hermitian matrix into a sum of fixed number of orthogonal projections
• Frame scalings: a condition number approach
• Constructing tight fusion frames
• Sparse matrices in frame theory
• Fusion frames and distributed sparsity
• Some results on perturbation of duality of OPV-frames
• The duals of fusion frames for experimental data transmission coding of high energy physics
• A note on perturbations of fusion frames
• Compare and contrast between duals of fusion and discrete frames
• Spectral tetris fusion frame constructions
• The Fundamentals of Spectral Tetris Frame Constructions
• Minimizing fusion frame potential
• Tight \(p\)-fusion frames
• Sparsity and spectral properties of dual frames
• Optimal frame completions
• Fusion frames
• Necessary and sufficient conditions to perform spectral tetris
• Fusion frames and the restricted isometry property
• Non-orthogonal fusion frames and the sparsity of fusion frame operators
• The construction of \(G\)-invariant finite tight frames
• Cross-frame potential
• Manifold matching: joint optimization of fidelity and commensurability
• Random fusion frames are nearly equiangular and tight
• Weighted fusion frame construction via spectral tetris
• Orthogonal projection decomposition of matrices and construction of fusion frames

This page was built for publication: Sparse fusion frames: existence and construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647422)