On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing (original) (raw)
Related papers
On Verifiable Sufficient Conditions for Sparse Signal Recovery via $ ell_1$ Minimization
2008
Adaptive Sampling and Fast Low-Rank Matrix Approximation
Electronic Colloquium on Computational Complexity, 2006
Randomized algorithms for the low-rank approximation of matrices
Proceedings of the National Academy of Sciences, 2007
A fast and efficient algorithm for low-rank approximation of a matrix
2009
ADMiRA: Atomic Decomposition for Minimum Rank Approximation
2010
IEEE Transactions on Information Theory
Low rank approximation and decomposition of large matrices using error correcting codes
IEEE Transactions on Information Theory, 2017
Tighter low-rank approximation via sampling the leveraged element
Exact Low-rank Matrix Completion via Convex Optimization
Randomized algorithms for the low-rank approximation of
2000
Explicit matrices for sparse approximation
2011 IEEE International Symposium on Information Theory Proceedings, 2011
Near Optimal Compressed Sensing of Sparse Rank-One Matrices via Sparse Power Factorization
A fast randomized algorithm for the approximation of matrices
Applied and Computational Harmonic Analysis, 2008
Recovery of Low Rank and Jointly Sparse Matrices with Two Sampling Matrices
IEEE Signal Processing Letters, 2015
Godec: Randomized low-rank & sparse matrix decomposition in noisy case
2011
On the Compression of Low Rank Matrices
SIAM Journal on Scientific Computing, 2005
Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
IEEE Transactions on Signal Processing
Fast Monte-Carlo Low Rank Approximations for Matrices
Computing Research Repository, 2005
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
2008
Compressed sensing and r-algorithms
2011 MICROWAVES, RADAR AND REMOTE SENSING SYMPOSIUM, 2011
Kronecker product matrices for compressive sensing
Acoustics Speech and Signal …, 2010
A Randomized Algorithm for the Approximation of Matrices
78-82-Deterministic Measurement Matrix in Compressed Sensing
Completing Low-Rank Matrices with Corrupted Samples from Few Coefficients in General Basis
Fast and Efficient Compressive Sensing Using Structurally Random Matrices
IEEE Transactions on Signal Processing, 2012
Computing sparse reduced-rank approximations to sparse matrices
Fast Monte Carlo Algorithms for Computing a Low-Rank Approximation to a Matrix
2014
Fast Exact Matrix Completion with Finite Samples
Low Rank Approximations Randomised Algorithms SIAMReview
A remark on Compressed Sensing
Mathematical Notes, 2007
General approach for construction of deterministic compressive sensing matrices
Iet Signal Processing, 2019
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion
IEEE Signal Processing Letters, 2018
Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
IEEE Transactions on Signal Processing, 2016
Optimal Weighted Low-rank Matrix Recovery with Subspace Prior Information
arXiv: Information Theory, 2018
2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013