Fetching the paper…
Reading the bibliography…
Neural recordings, returns from radars and sonars, images in astronomy and single-molecule microscopy can be modeled as a linear superposition of a small number of scaled and delayed copies of a band-limited or diffraction-limited point spread function, which is either determined by the nature or designed by the users; in other words, we observe the convolution between a point spread function and a sparse spike signal with unknown amplitudes and delays.
G. Gerstein and W. Clark, “Simultaneous studies of firing patterns in several neurons,” Science , vol. 143, no. 3612, pp. 1325–1327, 1964
1964
Earlier work this paper cites.
R. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE Transactions on Antennas and Propagation , vol. 34, no. 3, pp. 276–280, 1986
1986
Earlier work this paper cites.
B. Friedlander and A. Weiss, “Eigenstructure methods for direction finding with sensor gain and phase uncertainties,” in Acoustics, Speech, and Signal Processing, IEEE International Conference on , Apr 1988, pp. 2681–2684
1988
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.
M. Viberg and A. Swindlehurst, “A bayesian approach to auto-calibration for parametric array signal processing,” Signal Processing, IEEE Transactions on , vol. 42, no. 12, pp. 3495–3507, Dec 1994
1994
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.
E. Candès and Y. Plan, “A probabilistic and RIPless theory of compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 11, pp. 7235–7254, 2011
2011
Earlier work this paper cites.
Y. Chi, L. Scharf, A. Pezeshki, and A. Calderbank, “Sensitivity to basis mismatch in compressed sensing,” IEEE Transactions on Signal Processing , vol. 59, no. 5, pp. 2182–2195, May 2011
2011
Earlier work this paper cites.
T. Cai and L. Wang, “Orthogonal matching pursuit for sparse signal recovery with noise,” IEEE Transactions on Information Theory , vol. 57, no. 7, pp. 1–26, 2011
2011
Earlier work this paper cites.
E. J. Candès, T. Strohmer, and V. Voroninski, “Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics , 2012
2012
Earlier work this paper cites.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Cited alongside, same era.
J. A. Tropp, “User-friendly tail bounds for sums of random matrices,” Foundations of Computational Mathematics , vol. 12, no. 4, pp. 389–434, 2012
2012
Cited alongside, same era.
2012
Cited alongside, same era.
S. Choudhary and U. Mitra, “On identifiability in bilinear inverse problems,” in Acoustics, Speech and Signal Processing (ICASSP), IEEE International Conference on . IEEE, 2013, pp. 4325–4329
2013
Cited alongside, same era.
S. Ling and T. Strohmer, “Self-calibration and biconvex compressive sensing,” Inverse Problems , vol. 31, no. 11, p. 115002, 2015
2015
Closest in time.
K. Lee, Y. Li, M. Junge, and Y. Bresler, “Stability in blind deconvolution of sparse signals and reconstruction by alternating minimization,” in Int. Conf. Sampling Theory and Applications (SampTA) , 2015
2015
Closest in time.
2015
Closest in time.
T. Bendory, S. Dekel, and A. Feuer, “Super-resolution on the sphere using convex optimization,” Signal Processing, IEEE Transactions on , vol. 63, no. 9, pp. 2253–2262, 2015
2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Tang, B. N. Bhaskar, P. Shah, and B. Recht, “Compressed sensing off the grid,” IEEE transactions on information theory , vol. 59, no. 11, pp. 7465–7490, 2013
2013
Cited alongside, same era.
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
Cited alongside, same era.
A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,” Information Theory, IEEE Transactions on , vol. 60, no. 3, pp. 1711–1732, 2014
2014
Cited alongside, same era.
Y. Chi, “Joint sparsity recovery for spectral compressed sensing,” in Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on . IEEE, 2014, pp. 3938–3942
2014
Cited alongside, same era.
2015
Cited alongside, same era.
2015
Cited alongside, same era.
2015
Closest in time.
V. Duval and G. Peyré, “Exact support recovery for sparse spikes deconvolution,” Foundations of Computational Mathematics , vol. 15, no. 5, pp. 1315–1355, 2015
2015
Closest in time.
Y. Chi and Y. Chen, “Compressive two-dimensional harmonic retrieval via atomic norm minimization,” Signal Processing, IEEE Transactions on , vol. 63, no. 4, pp. 1030–1042, Feb 2015
2015
Closest in time.
S. Oymak, A. Jalali, M. Fazel, Y. C. Eldar, and B. Hassibi, “Simultaneously structured models with application to sparse and low-rank matrices,” Information Theory, IEEE Transactions on , vol. 61, no. 5, pp. 2886–2908, 2015
2015
Closest in time.
Y. Li and Y. Chi, “Off-the-grid line spectrum denoising and estimation with multiple measurement vectors,” IEEE Transactions on Signal Processing , vol. 64, no. 5, pp. 1257–1269, March 2016
2016
Closest in time.
Y. Chi, “Robust blind spikes deconvolution,” in Acoustics, Speech and Signal Processing (ICASSP), IEEE International Conference on . IEEE, 2016
2016
Closest in time.