Two Algorithms for Compressed Sensing of Sparse Tensors

DOI10.1007/978-3-319-16042-9_9zbMath1333.94018arXiv1404.1506OpenAlexW1522074980MaRDI QIDQ3460836

Dan Schonfeld, Qun Li, Edgar A. Bernal, Shmuel Friedland

Publication date: 8 January 2016

Published in: Compressed Sensing and its Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Uses Software

• L1-MAGIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
• Compressed sensing and best 𝑘-term approximation
• Unified dynamics for microscopic and macroscopic systems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
• A Multilinear Singular Value Decomposition
• Compressive Sensing of Sparse Tensors
• Kronecker Compressive Sensing
• Stable signal recovery from incomplete and inaccurate measurements

This page was built for publication: Two Algorithms for Compressed Sensing of Sparse Tensors