Fetching the paper…
Reading the bibliography…
A number of ill-posed inverse problems in signal processing, like blind deconvolution, matrix factorization, dictionary learning and blind source separation share the common characteristic of being bilinear inverse problems (BIPs), i.e.
1952
Earlier work this paper cites.
W. Rudin, Real and complex analysis , 3rd ed. New York: McGraw-Hill Book Co., 1987
1987
Earlier work this paper cites.
M. Ledoux and M. Talagrand, Probability in Banach Spaces , ser. Classics in Mathematics. Berlin: Springer-Verlag, 2011, isoperimetry and Processes, Reprint of the 1991 Edition
1991
Earlier work this paper cites.
K. Abed-Meraim, W. Qiu, and Y. Hua, “Blind System Identification,” Proc. IEEE , vol. 85, no. 8, pp. 1310–1322, Aug. 1997
1997
Earlier work this paper cites.
C. R. Johnson, Jr., P. Schniter, T. J. Endres, J. D. Behm, D. R. Brown, and R. A. Casas, “Blind Equalization Using the Constant Modulus Criterion: A Review,” Proc. IEEE , vol. 86, no. 10, pp. 1927–1950, Oct. 1998
1998
Earlier work this paper cites.
J. Hopgood and P. J. W. Rayner, “Blind single channel deconvolution using nonstationary signal processing,” Speech and Audio Processing, IEEE Transactions on , vol. 11, no. 5, pp. 476–488, 2003
2003
Earlier work this paper cites.
D. L. Donoho and V. Stodden, “When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?” in NIPS , 2003
2003
Earlier work this paper cites.
P. D. O’grady, B. A. Pearlmutter, and S. T. Rickard, “Survey of sparse and non-sparse methods in source separation,” International Journal of Imaging Systems and Technology , vol. 15, no. 1, pp. 18–33, 2005
2005
Earlier work this paper cites.
E. Balas, “Projection, lifting and extended formulation in integer and combinatorial optimization,” Ann. Oper. Res. , vol. 140, pp. 125–161, 2005
2005
Earlier work this paper cites.
E. J. Candès and T. C. Tao, “Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?” IEEE Trans. Inf. Theory , vol. 52, no. 12, pp. 5406–5425, 2006
2006
Earlier work this paper cites.
D. L. Donoho, “Compressed Sensing,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Earlier work this paper cites.
M. S. Asif, W. Mantzel, and J. K. Romberg, “Random Channel Coding and Blind Deconvolution,” in 47th Annual Allerton Conference on Communication, Control, and Computing, 2009. Allerton 2009. , Oct. 2009, pp. 1021–1025
2009
Earlier work this paper cites.
A. Beck, “Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming,” J. Optim. Theory Appl. , vol. 142, no. 1, pp. 1–29, 2009
2009
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Found. Comput. Math. , vol. 9, no. 6, pp. 717–772, 2009
2009
Cited alongside, same era.
R. Vershynin. (2009) Lectures in Geometric Functional Analysis. [Online]. Available: http://www-personal.umich.edu/˜romanv/papers/GFA-book/GFA-book.pdf
2009
Cited alongside, same era.
A. Kammoun, A. Aissa El Bey, K. Abed-Meraim, and S. Affes, “Robustness of blind subspace based techniques using ℓ p \ell_{p} quasi-norms,” in Signal Processing Advances in Wireless Communications (SPAWC), 2010 IEEE Eleventh International Workshop on , 2010, pp. 1–5
2010
Cited alongside, same era.
R. Gribonval and K. Schnass, “Dictionary identification—sparse matrix-factorization via ℓ 1 \ell_{1} -minimization,” IEEE Trans. Inform. Theory , vol. 56, no. 7, pp. 3523–3539, 2010
2010
Cited alongside, same era.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The Convex Geometry of Linear Inverse Problems,” Found. Comput. Math. , vol. 12, no. 6, pp. 805–849, 2012
2012
Later among the works it cites.
S. Choudhary and U. Mitra, “Sparse recovery from convolved output in underwater acoustic relay networks,” in 2012 Asia-Pacific Signal Information Processing Association Annual Summit and Conference (APSIPA ASC) , Dec. 2012, pp. 1–8. [Online]. Available: http://www.apsipa.org/proceedings_2012/papers/349.pdf
2012
Later among the works it cites.
P. Walk and P. Jung, “Compressed Sensing on the Image of Bilinear Maps,” in IEEE International Symposium on Information Theory Proceedings (ISIT), 2012 , Jul. 2012, pp. 1291–1295
2012
Later among the works it cites.
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. J. Candès and T. C. Tao, “The Power of Convex Relaxation: Near-Optimal Matrix Completion,” IEEE Trans. Inf. Theory , vol. 56, no. 5, pp. 2053–2080, 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 Rev. , vol. 52, no. 3, pp. 471–501, 2010
2010
Cited alongside, same era.
2010
Cited alongside, same era.
C. Hegde and R. G. Baraniuk, “Sampling and Recovery of Pulse Streams,” IEEE Trans. Signal Process. , vol. 59, no. 4, pp. 1505–1517, 2011
2011
Cited alongside, same era.
D. Gross, “Recovering Low-Rank Matrices From Few Coefficients in Any Basis,” IEEE Trans. Inf. Theory , vol. 57, no. 3, pp. 1548–1566, 2011
2011
Cited alongside, same era.
B. Recht, W. Xu, and B. Hassibi, “Null space conditions and thresholds for rank minimization,” Math. Program. , vol. 127, no. 1, Ser. B, pp. 175–202, 2011
2011
Cited alongside, same era.
E. J. Candès and Y. Plan, “Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements,” IEEE Trans. Inform. Theory , vol. 57, no. 4, pp. 2342–2359, 2011
2011
Cited alongside, same era.
R. Baraniuk, M. A. Davenport, M. F. Duarte, and C. Hegde. (2011, Apr.) An Introduction to Compressive Sensing. Connexions. [Online]. Available: http://cnx.org/content/col11133/1.5/
2011
Cited alongside, same era.
Later among the works it cites.
S. Choudhary and U. Mitra, “On Identifiability in Bilinear Inverse Problems,” in 2013 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , May 2013, pp. 4325–4329
2013
Later among the works it cites.
——, “Identifiability Bounds for Bilinear Inverse Problems,” in 47th Asilomar Conference on Signals, Systems and Computers , Nov. 2013, pp. 1677–1681
2013
Later among the works it cites.
E. J. Candès, T. Strohmer, and V. Voroninski, “PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming,” Comm. Pure Appl. Math. , vol. 66, no. 8, pp. 1241–1274, 2013. [Online]. Available: http://dx.doi.org/10.1002/cpa.21432
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
2013
Later among the works it cites.
——, “Sparse Blind Deconvolution: What Cannot Be Done,” in 2014 IEEE International Symposium on Information Theory (ISIT) , Jun. 2014, pp. 3002–3006
2014
Closest in time.
——, “On Identifiability Limits for Sparse Blind Deconvolution,” 2014, in preparation. [Online]. Available: http://www-scf.usc.edu/˜sunavcho/SBD_limit.pdf
2014
Closest in time.
A. Ahmed, B. Recht, and J. Romberg, “Blind deconvolution using convex programming,” IEEE Trans. Inform. Theory , vol. 60, no. 3, pp. 1711–1732, 2014
2014
Closest in time.