| Publication | Date of Publication | Type |
|---|
Encoder Blind Combinatorial Compressed Sensing
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Compressed sensing of low-rank plus sparse matrices
Applied and Computational Harmonic Analysis | 2023-03-09 | Paper |
An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks
Optimization and Engineering | 2022-08-26 | Paper |
Geometric anomaly detection in data
Proceedings of the National Academy of Sciences | 2022-05-05 | Paper |
| Tuning-free multi-coil compressed sensing MRI with Parallel Variable Density Approximate Message Passing (P-VDAMP) | 2022-03-08 | Paper |
Matrix rigidity and the ill-posedness of robust PCA and matrix completion
SIAM Journal on Mathematics of Data Science | 2022-02-03 | Paper |
Sparse non-negative super-resolution -- simplified and stabilised
Applied and Computational Harmonic Analysis | 2021-03-26 | Paper |
Compressed sensing of low-rank plus sparse matrices
(available as arXiv preprint) | 2020-07-18 | Paper |
A Robust Parallel Algorithm for Combinatorial Compressed Sensing
IEEE Transactions on Signal Processing | 2019-02-12 | Paper |
Expander \(\ell_0\)-decoding
Applied and Computational Harmonic Analysis | 2018-08-30 | Paper |
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Identification of Matrices Having a Sparse Representation
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
Information and Inference: A Journal of the IMA | 2018-02-16 | Paper |
| Parallel multi-scale reduction of persistent homology filtrations | 2017-08-15 | Paper |
Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Low rank matrix completion by alternating steepest descent methods
Applied and Computational Harmonic Analysis | 2016-01-28 | Paper |
Performance comparisons of greedy algorithms in compressed sensing.
Numerical Linear Algebra with Applications | 2015-09-29 | Paper |
Expander $\ell_0$-Decoding
(available as arXiv preprint) | 2015-08-05 | Paper |
GPU accelerated greedy algorithms for compressed sensing
Mathematical Programming Computation | 2014-10-06 | Paper |
Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
Linear Algebra and its Applications | 2014-03-03 | Paper |
Normalized iterative hard thresholding for matrix completion
SIAM Journal on Scientific Computing | 2014-01-21 | Paper |
Coarse quantization for random interleaved sampling of bandlimited signals
European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis | 2013-08-14 | Paper |
Compressed sensing: how sharp is the restricted isometry property?
SIAM Review | 2011-03-25 | Paper |
Phase transitions for greedy sparse approximation algorithms
Applied and Computational Harmonic Analysis | 2011-03-09 | Paper |
Counting faces of randomly projected polytopes when the projection radically lowers dimension
Journal of the American Mathematical Society | 2011-03-02 | Paper |
Improved bounds on restricted isometry constants for Gaussian matrices
SIAM Journal on Matrix Analysis and Applications | 2011-03-02 | Paper |
Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2010-05-08 | Paper |
Counting the faces of randomly-projected hypercubes and orthants, with applications
Discrete & Computational Geometry | 2010-04-12 | Paper |
Sparse nonnegative solution of underdetermined linear equations by linear programming
Proceedings of the National Academy of Sciences | 2008-05-07 | Paper |
Neighborliness of randomly projected simplices in high dimensions
Proceedings of the National Academy of Sciences | 2008-05-07 | Paper |
| Implementations of Shannon's sampling theorem, a time-frequency approach | 2008-03-27 | Paper |
Fast Reconstruction Methods for Bandlimited Functions from Periodic Nonuniform Sampling
SIAM Journal on Numerical Analysis | 2007-06-26 | Paper |
Optimal filter and mollifier for piecewise smooth spectral data
Mathematics of Computation | 2006-03-27 | Paper |
Robust reprojection methods for the resolution of the Gibbs phenomenon
Applied and Computational Harmonic Analysis | 2006-03-20 | Paper |
Adaptive filters for piecewise smooth spectral data*
IMA Journal of Numerical Analysis | 2005-11-21 | Paper |
An Adaptive Order Godunov Type Central Scheme
Hyperbolic Problems: Theory, Numerics, Applications | 2005-03-14 | Paper |
Adaptive mollifiers for high resolution recovery of piecewise smooth data from its spectral information
Foundations of Computational Mathematics | 2002-01-01 | Paper |
