Fetching the paper…
Reading the bibliography…
Blind deconvolution is an ubiquitous non-linear inverse problem in applications like wireless communications and image processing.
G. Xu, H. Liu, L. Tong, and T. Kailath, “A least-squares approach to blind channel identification,” IEEE Trans. Signal Process. , vol. 43, no. 12, pp. 2982–2993, 1995
1995
Earlier work this paper cites.
P. Mattila, Geometry of sets and measures in Euclidean spaces , ser. Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1995, vol. 44, fractals and rectifiability
1995
Earlier work this paper cites.
D. Kundur and D. Hatzinakos, “Blind Image Deconvolution,” IEEE Signal Process. Mag. , vol. 13, no. 3, pp. 43–64, May 1996
1996
Earlier work this paper cites.
H. Liu, G. Xu, L. Tong, and T. Kailath, “Recent developments in blind channel equalization: From cyclostationarity to subspaces,” Signal Processing , vol. 50, no. 1, pp. 83–99, 1996, special Issue on Subspace Methods, Part I: Array Signal Processing and Subspace Computations
1996
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.
M. Vanderveen and A. Paulraj, “Improved blind channel identification using a parametric approach,” Communications Letters, IEEE , vol. 2, no. 8, pp. 226–228, 1998
1998
Earlier work this paper cites.
C. H. Papadimitriou, H. Tamaki, P. Raghavan, and S. Vempala, “Latent semantic indexing: a probabilistic analysis,” in Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , ser. PODS ’98. New York, NY, USA: ACM, 1998, pp. 159–168
1998
Earlier work this paper cites.
G. Giannakis and C. Tepedelenlioglu, “Basis expansion models and diversity techniques for blind identification and equalization of time-varying channels,” Proc. IEEE , vol. 86, no. 10, pp. 1969–1986, 1998
1998
Earlier work this paper cites.
E. Bai and M. Fu, “Blind system identification and channel equalization of IIR systems without statistical information,” IEEE Trans. Signal Process. , vol. 47, no. 7, pp. 1910–1921, 1999
1999
Earlier work this paper cites.
A. Liavas, P. Regalia, and J.-P. Delmas, “Blind channel approximation: effective channel order determination,” IEEE Trans. Signal Process. , vol. 47, no. 12, pp. 3336–3344, 1999
1999
Earlier work this paper cites.
D. L. Donoho, “Sparse components of images and optimal atomic decompositions,” Constr. Approx. , vol. 17, no. 3, pp. 353–382, 2001
2001
Earlier work this paper cites.
K. Diamantaras, “Blind channel identification based on the geometry of the received signal constellation,” IEEE Trans. Signal Process. , vol. 50, no. 5, pp. 1133–1143, 2002
2002
Earlier work this paper cites.
O. Grellier, P. Comon, B. Mourrain, and P. Trébuchet, “Analytical blind channel identification,” IEEE Trans. Signal Process. , vol. 50, no. 9, pp. 2196–2207, 2002
2002
Earlier work this paper cites.
J. H. Manton, “An improved least squares blind channel identification algorithm for linearly and affinely precoded communication systems,” IEEE Signal Process. Lett. , vol. 9, no. 9, pp. 282–285, Sep. 2002
2002
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
Cited alongside, same era.
J. H. Manton and W. D. Neumann, “Totally blind channel identification by exploiting guard intervals,” Systems & Control Letters , vol. 48, no. 2, pp. 113–119, 2003
2003
Cited alongside, same era.
E. de Carvalho and D. T. M. Slock, “Blind and semi-blind FIR multichannel estimation: (global) identifiability conditions,” IEEE Trans. Signal Process. , vol. 52, no. 4, pp. 1053–1064, 2004
2004
Cited alongside, same era.
P. Vaidyanathan and B. Vrcelj, “Transmultiplexers as precoders in modern digital communication: a tutorial review,” in Circuits and Systems, 2004. ISCAS ’04. Proceedings of the 2004 International Symposium on , vol. 5, 2004, pp. V–405–V–412 Vol.5
2004
Cited alongside, same era.
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
Later among the works it 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 Trans. Signal Process. , vol. 58, no. 3, pp. 1708–1721, Mar. 2010
2010
Later among the works it cites.
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
Later among the works it cites.
A. Levin, Y. Weiss, F. Durand, and W. T. Freeman, “Understanding Blind Deconvolution Algorithms,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 33, no. 12, pp. 2354–2367, Dec. 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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
Cited alongside, same era.
E. Balas, “Projection, lifting and extended formulation in integer and combinatorial optimization,” Ann. Oper. Res. , vol. 140, pp. 125–161, 2005
2005
Cited alongside, same era.
D. L. Donoho, “Compressed Sensing,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Cited alongside, same era.
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
Cited alongside, same era.
W. Li and J. Preisig, “Estimation of Rapidly Time-Varying Sparse Channels,” Oceanic Engineering, IEEE Journal of , vol. 32, no. 4, pp. 927–939, 2007
2007
Cited alongside, same era.
C. Shin, R. Heath, and E. Powers, “Blind Channel Estimation for MIMO-OFDM Systems,” Vehicular Technology, IEEE Transactions on , vol. 56, no. 2, pp. 670–685, 2007
2007
Cited alongside, same era.
Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan, “Large-Scale Parallel Collaborative Filtering for the Netflix Prize,” in Algorithmic Aspects in Information and Management , ser. Lecture Notes in Computer Science, R. Fleischer and J. Xu, Eds. Springer Berlin Heidelberg, 2008, vol. 5034, pp. 337–348
2008
Cited alongside, same era.
K. Herrity, R. Raich, and A. O. Hero, III, “Blind Reconstruction of Sparse Images with Unknown Point Spread Function,” Computational Imaging VI , vol. 6814, no. 1, p. 68140K, 2008
2008
Cited alongside, same era.
2011
Later among the works it cites.
D. Barchiesi and M. D. Plumbley, “Dictionary Learning of Convolved Signals,” in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011 , May 2011, pp. 5812–5815
2011
Later among the works it cites.
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
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
2012
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.
S. Choudhary and U. Mitra, “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 The Impossibility of Blind Deconvolution for Geometrically Decaying Subspace Sparse Signals,” in 2nd IEEE Global Conference on Signal and Information Processing (GlobalSIP) , Atlanta, USA, Dec. 2014, to appear
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.
S. Choudhary and U. Mitra, “Fundamental Limits of Blind Deconvolution Part II: Sparsity-Ambiguity Trade-offs,” 2014, in preparation
2014
Closest in time.