Fetching the paper…
Reading the bibliography…
The paper explores the problem of \emph{spectral compressed sensing}, which aims to recover a spectrally sparse signal from a small random subset of its $n$ time domain samples.
D. Tufts and R. Kumaresan, “Estimation of frequencies of multiple sinusoids: Making linear prediction perform like maximum likelihood,” Proceedings of the IEEE , vol. 70, no. 9, pp. 975 – 989, sept. 1982
1982
Earlier work this paper cites.
J. A. Cadzow, “Spectral estimation: An overdetermined rational model equation approach,” Proceedings of the IEEE , vol. 70, no. 9, pp. 907–939, 1982
1982
Earlier work this paper cites.
R. Roy and T. Kailath, “ESPRIT-estimation of signal parameters via rotational invariance techniques,” IEEE Transactions on Acoustics, Speech and Signal Processing , vol. 37, no. 7, pp. 984 –995, Jul 1989
1989
Earlier work this paper cites.
Y. Hua and T. K. Sarkar, “Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise,” IEEE Transactions on Acoustics, Speech and Signal Processing , vol. 38, no. 5, pp. 814 –824, may 1990
1990
Earlier work this paper cites.
L. L. Scharf, Statistical signal processing . Addison-Wesley Reading, MA, 1991, vol. 98
1991
Earlier work this paper cites.
Y. Hua, “Estimating two-dimensional frequencies by matrix enhancement and matrix pencil,” IEEE Transactions on Signal Processing , vol. 40, no. 9, pp. 2267 –2280, Sep 1992
1992
Earlier work this paper cites.
S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM Review , vol. 43, no. 1, pp. 129–159, 2001
2001
Earlier work this paper cites.
L. Borcea, G. Papanicolaou, C. Tsogka, and J. Berryman, “Imaging and time reversal in random media,” Inverse Problems , vol. 18, no. 5, p. 1247, 2002
2002
Earlier work this paper cites.
M. Vetterli, P. Marziliano, and T. Blu, “Sampling signals with finite rate of innovation,” IEEE Transactions on Signal Processing , vol. 50, no. 6, pp. 1417–1428, 2002
2002
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. P. Boyd, “Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices,” American Control Conference , vol. 3, pp. 2156 – 2162 vol.3, June 2003
2003
Earlier work this paper cites.
E. J. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on Information Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Earlier work this paper cites.
D. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory , vol. 52, no. 4, pp. 1289 –1306, April 2006
2006
Earlier work this paper cites.
E. J. Candes, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements,” Communications on Pure and Applied Mathematics , vol. 59, no. 8, pp. 1207–1223, 2006
2006
Earlier work this paper cites.
M. Lustig, D. Donoho, and J. M. Pauly, “Sparse MRI: The application of compressed sensing for rapid MR imaging,” Magnetic Resonance in Medicine , vol. 58, no. 6, pp. 1182–1195, 2007
2007
Earlier work this paper cites.
P. L. Dragotti, M. Vetterli, and T. Blu, “Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets strang-fix,” IEEE Transactions on Signal Processing , vol. 55, no. 5, pp. 1741 –1757, May 2007
2007
Earlier work this paper cites.
M. Wu, “Collaborative filtering via ensembles of matrix factorizations,” vol. 2007, 2007
2007
Earlier work this paper cites.
I. Markovsky, “Structured low-rank approximation and its applications,” Automatica , vol. 44, no. 4, pp. 891–909, 2008
2008
Earlier work this paper cites.
M. Grant, S. Boyd, and Y. Ye, “CVX: Matlab software for disciplined convex programming,” Online accessiable: http://stanford. edu/ ˜ boyd/cvx , 2008
2008
Earlier work this paper cites.
N. Alon and J. H. Spencer, The Probabilistic Method (3rd Edition) . Wiley, 2008
2008
Earlier work this paper cites.
E. J. Candes and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics , vol. 9, no. 6, pp. 717–772, April 2009
2009
Cited alongside, same era.
L. Potter, E. Ertin, J. Parker, and M. Cetin, “Sparsity and compressed sensing in radar imaging,” Proceedings of the IEEE , vol. 98, no. 6, pp. 1006–1020, 2010
2010
Cited alongside, same era.
L. Schermelleh, R. Heintzmann, and H. Leonhardt, “A guide to super-resolution fluorescence microscopy,” The Journal of cell biology , vol. 190, no. 2, pp. 165–175, 2010
2010
Cited alongside, same era.
J. A. Tropp, J. N. Laska, M. F. Duarte, J. K. Romberg, and R. G. Baraniuk, “Beyond nyquist: Efficient sampling of sparse bandlimited signals,” Information Theory, IEEE Transactions on , vol. 56, no. 1, pp. 520–544, 2010
2010
Cited alongside, same era.
A. Fannjiang and W. Liao, “Coherence pattern-guided compressive sensing with unresolved grids,” SIAM Journal on Imaging Sciences , vol. 5, no. 1, pp. 179–202, 2012
2012
Later among the works it cites.
S. Negahban and M. Wainwright, “Restricted strong convexity and weighted matrix completion: Optimal bounds with noise,” The Journal of Machine Learning Research , vol. 98888, pp. 1665–1697, May 2012
2012
Later among the works it cites.
B. Balle and M. Mohri, “Spectral learning of general weighted automata via constrained matrix completion,” Advances in Neural Information Processing Systems (NIPS) , pp. 2168–2176, 2012
2012
Later among the works it cites.
B. Alexeev, J. Cahill, and D. G. Mixon, “Full spark frames,” Journal of Fourier Analysis and Applications , vol. 18, no. 6, pp. 1167–1194, 2012
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Transactions on Information Theory , vol. 56, no. 6, pp. 2980–2998, 2010
2010
Cited alongside, same era.
E. Candes and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2053 –2080, May 2010
2010
Cited alongside, same era.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM Review , vol. 52, no. 3, pp. 471–501, 2010
2010
Cited alongside, same era.
E. J. Candes and Y. Plan, “Matrix completion with noise,” Proceedings of the IEEE , vol. 98, no. 6, pp. 925 –936, June 2010
2010
Cited alongside, same era.
A. Sankaranarayanan, P. Turaga, R. Baraniuk, and R. Chellappa, “Compressive acquisition of dynamic scenes,” Computer Vision–ECCV 2010 , pp. 129–142, 2010
2010
Cited alongside, same era.
M. Lustig, M. Elad, and J. Pauly, “Calibrationless parallel imaging reconstruction by structured low-rank matrix completion,” in Proceedings of the 18th Annual Meeting of the International Society for Magnetic Resonance in Medicine (ISMRM) , 2010, p. 2870
2010
Cited alongside, same era.
J. F. Cai, E. J. Candes, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization , vol. 20, no. 4, pp. 1956–1982, 2010
2010
Cited alongside, same era.
K. Gedalyahu, R. Tur, and Y. C. Eldar, “Multichannel sampling of pulse streams at the rate of innovation,” IEEE Transactions on Signal Processing , vol. 59, no. 4, pp. 1491–1504, 2011
2011
Cited alongside, same era.
2013
Closest in time.
X. Li, “Compressed sensing and matrix completion with constant proportion of corruptions,” Constructive Approximation , vol. 37, pp. 73–99, 2013
2013
Closest in time.
——, “Super-resolution from noisy data,” Journal of Fourier Analysis and Applications , vol. 19, no. 6, pp. 1229–1254, 2013
2013
Closest in time.
G. Tang, B. Bhaskar, P. Shah, and B. Recht, “Compressed sensing off the grid,” Information Theory, IEEE Transactions on , vol. 59, no. 11, pp. 7465–7490, Nov 2013
2013
Closest in time.
Y. Chi and Y. Chen, “Compressive recovery of 2-d off-grid frequencies,” in Signals, Systems and Computers, 2013 Asilomar Conference on . IEEE, 2013, pp. 687–691
2013
Closest in time.
Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis, “Low-rank matrix recovery from errors and erasures,” IEEE Transactions on Information Theory , vol. 59, no. 7, pp. 4324–4337, 2013
2013
Closest in time.
T. Zhang, J. Y. Cheng, A. G. Potnick, R. A. Barth, M. T. Alley, M. Uecker, M. Lustig, J. M. Pauly, and S. S. Vasanawala, “Fast pediatric 3D free-breathing abdominal dynamic contrast enhanced MRI with high spatiotemporal resolution,” Journal of Magnetic Resonance Imaging, DOI: 10.1002/jmri.24551 , 2013
2013
Closest in time.
Y. Chen and Y. Chi, “Spectral compressed sensing via structured matrix completion,” International Conference on Machine Learning (ICML) , June 2013
2013
Closest in time.
2013
Closest in time.
M. Fazel, T. K. Pong, D. Sun, and P. Tseng, “Hankel matrix rank minimization with applications to system identification and realization,” SIAM Journal on Matrix Analysis and Applications , vol. 34, no. 3, pp. 946–977, 2013
2013
Closest in time.
J. A. Tropp, “User-friendly tail bounds for sums of random matrices,” Foundations of Computational Mathematics , vol. 12, no. 4, pp. 389–434, 2012
2013
Closest in time.
E. J. Candès and C. Fernandez-Granda, “Towards a mathematical theory of super-resolution,” Communications on Pure and Applied Mathematics , vol. 67, no. 6, pp. 906–956, 2014
2014
Closest in time.
Y. Chen, “Incoherence-optimal matrix completion,” arXiv preprint arXiv:1310.0154 , 2014
2014
Closest in time.
T. Zhang, J. M. Pauly, and I. R. Levesque, “Accelerating parameter mapping with a locally low rank constraint,” Magnetic Resonance in Medicine, DOI: 10.1002/mrm.25161 , 2014
2014
Closest in time.