Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing
Bah, B
Tanner, J
(12 Jul 2012)
doi:10.48550/arxiv.1207.3094
Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
Bah, B
Tanner, J
(20 Jul 2012)
doi:10.48550/arxiv.1207.4883
Identification of Matrices having a Sparse Representation
Pfander, G
Rauhut, H
Tanner, J
(22 Apr 2015)
doi:10.48550/arxiv.1504.05807
On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing
Bah, B
Tanner, J
(24 Jul 2013)
doi:10.48550/arxiv.1307.6477
Parallel multi-scale reduction of persistent homology filtrations
Mendoza-Smith, R
Tanner, J
(15 Aug 2017)
doi:10.48550/arxiv.1708.04710
An Approximate Message Passing Algorithm for Rapid Parameter-Free Compressed Sensing MRI
Millard, C
Hess, A
Mailhé, B
Tanner, J
(04 Nov 2019)
doi:10.48550/arxiv.1911.01234
Approximate Message Passing with a Colored Aliasing Model for Variable Density Fourier Sampled Images
Millard, C
Hess, A
Mailhé, B
Tanner, J
(03 Mar 2020)
doi:10.48550/arxiv.2003.02701
Encoder blind combinatorial compressed sensing
Murray, M
Tanner, J
(10 Apr 2020)
doi:10.48550/arxiv.2004.05094
Compressed sensing of low-rank plus sparse matrices
Tanner, J
Vary, S
(18 Jul 2020)
doi:10.48550/arxiv.2007.09457
Implementations of Shannon’s sampling theorem, a time-frequency approach
Strohmer, T
Tanner, J
Sampling Theory, Signal Processing, and Data Analysis
volume 4
issue 1
2-17
(01 Jan 2005)
doi:10.1007/bf03549421