Auto-tuning unit norm frames

DOI10.1016/J.ACHA.2011.02.005zbMATH Open1230.42037arXiv1009.5562OpenAlexW2010693285MaRDI QIDQ654442FDOQ654442

Authors: Peter G. Casazza, Matthew Fickus, Dustin G. Mixon 

Publication date: 28 December 2011

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally 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 trivial 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?"

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

Recommendations

• Paulsen problem for A-admissible frames
• A new algorithm of the construction of the unit norm tight frames based on Spectral Tetris
• Existence and construction of finite tight frames
• Generation of finite tight frames by Householder transformations
• A class of methods for constructing equal-norm tight frames in a finite dimensional Hilbert space

zbMATH Keywords

framesfinitegradient descenttightframe potentialunit norm

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15)

Cites Work

• Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
• Quantized frame expansions with erasures
• Finite normalized tight frames
• Equal-norm tight frames with erasures
• Title not available (Why is that?)
• Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
• Title not available (Why is that?)
• Optimal frames for erasures.
• Minimization of convex functionals over frame operators
• Title not available (Why is that?)
• The road to equal-norm Parseval frames
• Existence and construction of finite tight frames
• Constructing tight fusion frames
• Minimizing fusion frame potential
• The structure of minimizers of the frame potential on fusion frames
• Convolutional frames and the frame potential
• Frame potential and finite abelian groups
• Optimal reconstruction systems for erasures and for the \(q\)-potential
• Filter Bank Fusion Frames

Cited In (19)

• Frame completion with prescribed norms via alternating projection method
• Optimal sensor placement for target localisation and tracking in 2D and 3D
• Constructing all self-adjoint matrices with prescribed spectrum and diagonal
• Optimization over finite frame varieties and structured dictionary design
• Phase retrieval from very few measurements
• Preconditioning filter bank decomposition using structured normalized tight frames
• Designing incoherent unit norm tight frames via block coordinate descent-based alternating projection
• Constructive subsampling of finite frames with applications in optimal function recovery
• Gradient Flows for Probabilistic Frame Potentials in the Wasserstein Space
• The Paulsen problem made simple
• A new algorithm of the construction of the unit norm tight frames based on Spectral Tetris
• Constructing finite frames of a given spectrum and set of lengths
• Computing the distance between frames and between subspaces of a Hilbert space
• Generalized frame operator distance problems
• Moving finite unit norm tight frames for \(S^{n}\)
• A Quiver Invariant Theoretic Approach to Radial Isotropy and the Paulsen Problem for Matrix Frames
• Optimal frames and Newton's method
• Paulsen problem for A-admissible frames
• Frame potentials and the geometry of frames

This page was built for publication: Auto-tuning unit norm frames

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