Fetching the paper…
Reading the bibliography…
Multichannel blind deconvolution is the problem of recovering an unknown signal $f$ and multiple unknown channels $x_i$ from their circular convolution $y_i=x_i \circledast f$ ($i=1,2,\dots,N$).
A. Paulraj and T. Kailath, “Direction of arrival estimation by eigenstructure methods with unknown sensor gain and phase,” in ICASSP ’85. IEEE International Conference on Acoustics, Speech, and Signal Processing , vol. 10, Apr 1985, pp. 640–643
1985
Earlier work this paper cites.
O. Shalvi and E. Weinstein, “New criteria for blind deconvolution of nonminimum phase systems (channels),” IEEE Transactions on Information Theory , vol. 36, no. 2, pp. 312–321, March 1990
1990
Earlier work this paper cites.
L. Tong, G. Xu, and T. Kailath, “A new approach to blind identification and equalization of multipath channels,” in [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems Computers , Nov 1991, pp. 856–860 vol.2
1991
Earlier work this paper cites.
M. P. Wylie, S. Roy, and R. F. Schmitt, “Self-calibration of linear equi-spaced (les) arrays,” in 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing , vol. 1, April 1993, pp. 281–284 vol.1
1993
Earlier work this paper cites.
E. Moulines, P. Duhamel, J. F. Cardoso, and S. Mayrargue, “Subspace methods for the blind identification of multichannel fir filters,” IEEE Transactions on Signal Processing , vol. 43, no. 2, pp. 516–525, Feb 1995
1995
Earlier work this paper cites.
G. Xu, H. Liu, L. Tong, and T. Kailath, “A least-squares approach to blind channel identification,” IEEE Transactions on Signal Processing , vol. 43, no. 12, pp. 2982–2993, Dec 1995
1995
Earlier work this paper cites.
M. I. Gurelli and C. L. Nikias, “Evam: an eigenvector-based algorithm for multichannel blind deconvolution of input colored signals,” IEEE Transactions on Signal Processing , vol. 43, no. 1, pp. 134–149, Jan 1995
1995
Earlier work this paper cites.
D. Kundur and D. Hatzinakos, “Blind image deconvolution,” IEEE Signal Processing Magazine , vol. 13, no. 3, pp. 43–64, May 1996
1996
Earlier work this paper cites.
L. Tong and S. Perreau, “Multichannel blind identification: from subspace to maximum likelihood methods,” Proceedings of the IEEE , vol. 86, no. 10, pp. 1951–1968, Oct 1998
1998
Earlier work this paper cites.
G. Harikumar and Y. Bresler, “Fir perfect signal reconstruction from multiple convolutions: minimum deconvolver orders,” IEEE Transactions on Signal Processing , vol. 46, no. 1, pp. 215–218, Jan 1998
1998
Earlier work this paper cites.
K. F. Kaaresen and T. Taxt, “Multichannel blind deconvolution of seismic signals,” Geophysics , vol. 63, no. 6, pp. 2093–2107, 1998
1998
Earlier work this paper cites.
T. Strohmer, “Four short stories about toeplitz matrix calculations,” Linear Algebra and its Applications , vol. 343, pp. 321–344, 2002
2002
Earlier work this paper cites.
D. R. Gitelman, W. D. Penny, J. Ashburner, and K. J. Friston, “Modeling regional and psychophysiologic interactions in fmri: the importance of hemodynamic deconvolution,” Neuroimage , vol. 19, no. 1, pp. 200–207, 2003
2003
Earlier work this paper cites.
D. L. Donoho and M. Elad, “Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 \ell_{1} minimization,” Proceedings of the National Academy of Sciences , vol. 100, no. 5, pp. 2197–2202, feb 2003
2003
Earlier work this paper cites.
K. G. Sabra and D. R. Dowling, “Blind deconvolution in ocean waveguides using artificial time reversal,” The Journal of the Acoustical Society of America , vol. 116, no. 1, pp. 262–271, 2004
2004
Earlier work this paper cites.
M. J. Rust, M. Bates, and X. Zhuang, “Sub-diffraction-limit imaging by stochastic optical reconstruction microscopy (storm),” Nature methods , vol. 3, no. 10, p. 793, 2006
2006
Earlier work this paper cites.
E. Betzig, G. H. Patterson, R. Sougrat, O. W. Lindwasser, S. Olenych, J. S. Bonifacino, M. W. Davidson, J. Lippincott-Schwartz, and H. F. Hess, “Imaging intracellular fluorescent proteins at nanometer resolution,” Science , vol. 313, no. 5793, pp. 1642–1645, 2006
2006
Earlier work this paper cites.
P. Sarder and A. Nehorai, “Deconvolution methods for 3-d fluorescence microscopy images,” IEEE Signal Processing Magazine , vol. 23, no. 3, pp. 32–45, May 2006
2006
Earlier work this paper cites.
L. Balzano and R. Nowak, “Blind calibration of sensor networks,” in Proceedings of the 6th international conference on Information processing in sensor networks . ACM, 2007, pp. 79–88
2007
Earlier work this paper cites.
N. J. Higham, Functions of matrices: theory and computation . SIAM, 2008, vol. 104
2008
Earlier work this paper cites.
S. Cho and S. Lee, “Fast motion deblurring,” in ACM Transactions on Graphics (TOG) , vol. 28, no. 5. ACM, 2009, p. 145
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM journal on imaging sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Earlier work this paper cites.
P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization algorithms on matrix manifolds . Princeton University Press, 2009
2009
Earlier work this paper cites.
C. R. Berger, S. Zhou, J. C. Preisig, and P. Willett, “Sparse channel estimation for multicarrier underwater acoustic communication: From subspace methods to compressed sensing,” IEEE Transactions on Signal Processing , vol. 58, no. 3, pp. 1708–1721, March 2010
2010
Cited alongside, same era.
A. Levin, Y. Weiss, F. Durand, and W. T. Freeman, “Understanding blind deconvolution algorithms,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 33, no. 12, pp. 2354–2367, Dec 2011
2011
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, aug 2011
2011
Cited alongside, same era.
E. A. Mukamel, H. Babcock, and X. Zhuang, “Statistical deconvolution for superresolution fluorescence microscopy,” Biophysical journal , vol. 102, no. 10, pp. 2391–2400, 2012
2012
Cited alongside, same era.
Y. Li, K. Lee, and Y. Bresler, “Identifiability in bilinear inverse problems with applications to subspace or sparsity-constrained blind gain and phase calibration,” IEEE Transactions on Information Theory , vol. 63, no. 2, pp. 822–842, Feb 2017
2017
Later among the works it cites.
J. Sun, Q. Qu, and J. Wright, “Complete dictionary recovery over the sphere i: Overview and the geometric picture,” IEEE Transactions on Information Theory , vol. 63, no. 2, pp. 853–884, Feb 2017
2017
Later among the works it cites.
——, “A geometric analysis of phase retrieval,” Foundations of Computational Mathematics , Aug 2017
2017
Later among the works it cites.
J. Sun, Q. Qu, and J. Wright, “Complete dictionary recovery over the sphere ii: Recovery by riemannian trust-region method,” IEEE Transactions on Information Theory , vol. 63, no. 2, pp. 885–914, Feb 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Xu, S. Zheng, and J. Jia, “Unnatural l0 sparse representation for natural image deblurring,” in Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on . IEEE, 2013, pp. 1107–1114
2013
Cited alongside, same era.
H. Zhang, D. Wipf, and Y. Zhang, “Multi-image blind deblurring using a coupled adaptive sparse prior,” in Computer Vision and Pattern Recognition (CVPR), 2013 IEEE Conference on . IEEE, 2013, pp. 1051–1058
2013
Cited alongside, same era.
X.-T. Yuan and T. Zhang, “Truncated power method for sparse eigenvalue problems,” Journal of Machine Learning Research , vol. 14, no. Apr, pp. 899–925, 2013
2013
Cited alongside, same era.
M. Ledoux and M. Talagrand, Probability in Banach Spaces: isoperimetry and processes . Springer Science & Business Media, 2013
2013
Cited alongside, same era.
A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,” IEEE Transactions on Information Theory , vol. 60, no. 3, pp. 1711–1732, March 2014
2014
Cited alongside, same era.
C. Bilen, G. Puy, R. Gribonval, and L. Daudet, “Convex optimization approaches for blind sensor calibration using sparsity,” IEEE Transactions on Signal Processing , vol. 62, no. 18, pp. 4847–4856, Sept 2014
2014
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
Cited alongside, same era.
H. She, R.-R. Chen, D. Liang, Y. Chang, and L. Ying, “Image reconstruction from phased-array data based on multichannel blind deconvolution,” Magnetic resonance imaging , vol. 33, no. 9, pp. 1106–1113, 2015
2015
Cited alongside, same era.
2017
Later among the works it cites.
C. Jin, R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan, “How to escape saddle points efficiently,” in International Conference on Machine Learning , 2017, pp. 1724–1732
2017
Later among the works it cites.
Z. Allen-Zhu, “Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 2017, pp. 89–97
2017
Later among the works it cites.
N. Agarwal, Z. Allen-Zhu, B. Bullins, E. Hazan, and T. Ma, “Finding approximate local minima faster than gradient descent,” in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing . ACM, 2017, pp. 1195–1199
2017
Later among the works it cites.
D. Goldfarb, C. Mu, J. Wright, and C. Zhou, “Using negative curvature in solving nonlinear programs,” Computational Optimization and Applications , vol. 68, no. 3, pp. 479–502, Dec 2017
2017
Later among the works it cites.
Y. Zhang, H.-W. Kuo, and J. Wright, “Structured local optima in sparse blind deconvolution,” in Proceedings of the 10th NIPS Workshop on Optimization for Machine Learning (OPTML) , 2017
2017
Later among the works it cites.
Y. Li and Y. Bresler, “Global geometry of multichannel sparse blind deconvolution on the sphere,” in Advances in Neural Information Processing Systems , 2018, pp. 1140–1151
2018
Closest in time.
X. Li, S. Ling, T. Strohmer, and K. Wei, “Rapid, robust, and reliable blind deconvolution via nonconvex optimization,” Applied and computational harmonic analysis , 2018
2018
Closest in time.
W. Huang and P. Hand, “Blind deconvolution by a steepest descent algorithm on a quotient manifold,” SIAM Journal on Imaging Sciences , vol. 11, no. 4, pp. 2757–2785, 2018
2018
Closest in time.
K. Lee, F. Krahmer, and J. Romberg, “Spectral methods for passive imaging: Nonasymptotic performance and robustness,” SIAM Journal on Imaging Sciences , vol. 11, no. 3, pp. 2110–2164, 2018
2018
Closest in time.
K. Lee, N. Tian, and J. Romberg, “Fast and guaranteed blind multichannel deconvolution under a bilinear system model,” IEEE Transactions on Information Theory , vol. 64, no. 7, pp. 4792–4818, July 2018
2018
Closest in time.
Y. Li, K. Lee, and Y. Bresler, “Blind gain and phase calibration via sparse spectral methods,” IEEE Transactions on Information Theory , 2018
2018
Closest in time.
S. Ling and T. Strohmer, “Self-calibration and bilinear inverse problems via linear least squares,” SIAM Journal on Imaging Sciences , vol. 11, no. 1, pp. 252–292, jan 2018
2018
Closest in time.
——, “Natasha 2: Faster non-convex optimization than sgd,” in Advances in Neural Information Processing Systems , 2018, pp. 2680–2691
2018
Closest in time.
Y. Chen, Y. Chi, J. Fan, and C. Ma, “Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval,” Mathematical Programming , pp. 1–33, 2018
2018
Closest in time.
2018
Closest in time.
N. Boumal, P.-A. Absil, and C. Cartis, “Global rates of convergence for nonconvex optimization on manifolds,” IMA Journal of Numerical Analysis , vol. 39, no. 1, pp. 1–33, 2018
2018
Closest in time.
Y. C. Eldar, W. Liao, and S. Tang, “Sensor calibration for off-the-grid spectral estimation,” Applied and Computational Harmonic Analysis , 2018
2018
Closest in time.