Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization

DOI10.1109/TIT.2017.2784479zbMath1390.94261arXiv1312.0525MaRDI QIDQ4566735

No author found.

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (13)

Self-calibration and biconvex compressive sensing ⋮ Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication ⋮ Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion ⋮ Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems ⋮ Robust sensing of low-rank matrices with non-orthogonal sparse decomposition ⋮ Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ A novel blind restoration and reconstruction approach for CT images based on sparse representation and hierarchical Bayesian-MAP ⋮ A geometric analysis of phase retrieval ⋮ Jointly low-rank and bisparse recovery: Questions and partial answers ⋮ Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold

This page was built for publication: Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization