Optimization over finite frame varieties and structured dictionary design
From MaRDI portal
Publication:413650
DOI10.1016/j.acha.2011.09.001zbMath1246.42030OpenAlexW2009582890MaRDI QIDQ413650
Publication date: 7 May 2012
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2011.09.001
Related Items (10)
Connectivity and Irreducibility of Algebraic Varieties of Finite Unit Norm Tight Frames ⋮ On root frames in \(\mathbb{R}^d\) ⋮ Local minimizers of the distances to the majorization flows ⋮ Frame completions with prescribed norms: local minimizers and applications ⋮ Frame potentials and the geometry of frames ⋮ Constructions of biangular tight frames and their relationships with equiangular tight frames ⋮ Local Lidskii's theorems for unitarily invariant norms ⋮ Generalized frame operator distance problems ⋮ Unnamed Item ⋮ Optimal \(\alpha,\mathfrak{d})\)-multi-completion of \(\mathfrak{d}\)-designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Auto-tuning unit norm frames
- Second-order sigma-delta (\(\Sigma \Delta\)) quantization of finite frame expansions
- A note on equiangular tight frames
- Equiangular tight frames from complex Seidel matrices containing cube roots of unity
- On the existence of equiangular tight frames
- Grassmannian frames with applications to coding and communication
- Finite normalized tight frames
- Equal-norm tight frames with erasures
- The Schur-Horn theorem for operators and frames with prescribed norms and frame operator
- An Introduction to Frames
- Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences
- Designing structured tight frames via an alternating projection method
- Generalized welch bound equality sequences are tight frames
- Matrix Analysis
- Painless nonorthogonal expansions
- Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
- Symmetric informationally complete quantum measurements
- Matching pursuits with time-frequency dictionaries
- Complex sigma-delta quantization algorithms for finite frames
- Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- A Class of Nonharmonic Fourier Series
This page was built for publication: Optimization over finite frame varieties and structured dictionary design