Blind deconvolution using convex programming

IEEE Transactions on Information Theory

Volumn 60, Issue 3, 2014, Pages 1711-1732

  Ahmed, Ali ^a   Recht, Benjamin ^b   Romberg, Justin ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

Blind deconvolution; Channel estimation; Compressed sensing; Convex programming; Image deblurring; Low rank matrix; Matrix factorizations; Nuclear norm minimization; Rank 1 matrix

Indexed keywords

CHANNEL ESTIMATION; COMPRESSED SENSING; CONVEX PROGRAMMING; CONVOLUTION; DECONVOLUTION; IMAGE ENHANCEMENT; MATRIX ALGEBRA; RECOVERY; RELAXATION PROCESSES;

BLIND DECONVOLUTION; IMAGE DEBLURRING; LOW-RANK MATRICES; MATRIX FACTORIZATIONS; NUCLEAR NORM MINIMIZATIONS;

VECTORS;

EID: 84894862359     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2294644     Document Type: Article

References (45)

1. M. Fazel, "Matrix rank minimization with applications," Ph.D. dissertation, Dept. Electr. Eng., Stanford Univ. Press, Stanford, CA, USA, Mar. 2002.
2. Y. Nesterov, H. Wolkowicz, and Y. Ye, "Nonconvex quadratic optimization," in Handbook of Semidefinite Programming (International Series in Operations Research and Management Science), H.Wolkowicz, R. Saigal, and L. Vandenberghe, Eds. Boston, MA, USA: Kluwer, 2000, pp. 361-420.
3. 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.
4. E. Candès, T. Strohmer, and V. Voroninski, "PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming," Commun. Pure Appl. Math., vol. 66, no. 8, pp. 1241-1274, Aug. 2013.
5. M. L. Moravec, J. Romberg, and R. G. Baraniuk, "Compressive phase retrieval," Proc. SPIE, vol. 6701, p. 670120, 2007.
6. W. L. Chan, M. L. Moravec, R. G. Baraniuk, and D. M. Mittleman, "Terahertz imaging with compressed sensing and phase retrieval," Opt. Lett., vol. 33, no. 9, pp. 974-976, May 2008.
7. M. S. Asif, W. Mantzel, and J. Romberg, "Random channel coding and blind deconvolution," in Proc. IEEE 47th Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, USA, Sep. 2009, pp. 1021-1025.
8. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
9. M. Rudelson and R. Vershynin, "Geometric approach to error correcting codes and reconstruction of signals," Int. Math. Res. Not., vol. 2005, no. 64, pp. 4019-4041, 2005. (Pubitemid 44178240)
10. D. Kundur and D. Hatzinakos, "Blind image deconvolution," IEEE Signal Process. Mag., vol. 13, no. 3, pp. 43-64, May 1996. (Pubitemid 126518975)
11. T. Chan and C. K. Wong, "Total variation blind deconvolution," IEEE Trans. Image Process., vol. 7, no. 3, pp. 370-375, Mar. 1998. (Pubitemid 128745355)
12. V. Saligrama and M. Zhao, "Compressed blind de-convolution," arXiv:0910.0239, 2009.
13. D. Krishnan, T. Tay, and R. Fergus, "Blind deconvolution using a normalized sparsity measure," in Proc. IEEE Conf. CVPR, Providence, RI, USA, Jun. 2011, pp. 233-240.
14. 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.
15. Y. Sato, "A method of self-recovering equalization for multilevel amplitude-modulation," IEEE Trans. Commun., vol. 23, no. 6, pp. 679-682, Jun. 1975.
16. L. Tong, G. Xu, and T. Kailath, "Blind identification and equalization based on second-order statistics: A time domain approach," IEEE Trans. Inf. Theory, vol. 40, no. 2, pp. 340-349, Mar. 1994.
17. H. Liu, G. Xu, L. Tong, and T. Kailath, "Recent developments in blind channel equalization: From cyclostationarity to subspaces," Signal Process., vol. 50, nos. 1-2, pp. 83-99, Apr. 1996. (Pubitemid 126375037)
18. L. Tong and S. Perreau, "Multichannel blind identification: From subspace to maximum likelihood methods," Proc. IEEE, vol. 86, no. 10, pp. 1951-1968, Oct. 1998. (Pubitemid 128720288)
19. C. R. Johnson, 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.
20. G. B. 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, Oct. 1998. (Pubitemid 128720289)
21. 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, Dec. 1995.
22. E. Candès and Y. Plan, "Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2342-2359, Apr. 2011.
23. B. Recht, "A simpler approach to matrix completion," J. Mach. Learn. Res., vol. 12, pp. 3413-3430, Dec. 2011.
24. E. Candès and T. Tao, "The power of convex relaxation: Nearoptimal matrix completion," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, May 2010.
25. D. Gross, "Recovering low-rank matrices from few coefficients in any basis," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1548-1566, Mar. 2011.
26. E. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, no. 6, pp. 717-772, Dec. 2009.
27. A. Ahmed and J. Romberg, "Compressive multiplexers for correlated signals," in Proc. IEEE 46th Asilomar Conf. Signals Syst. Comput., Pacific Grove, CA, USA, Nov. 2012, pp. 963-967.
28. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2980-2998, Jun. 2010.
29. V. Koltchinskii, K. Lounici, and A. B. Tsybakov, "Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion," Ann. Statist., vol. 39, no. 5, pp. 2302-2329, 2011.
30. K. Lee and Y. Bresler, "ADMiRA: Atomic decomposition for minimum rank approximation," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4402-4416, Sep. 2010.
31. J. Romberg and R. Neelamani, "Sparse channel separation using random probes," Inverse Problems, vol. 26, no. 11, pp. 115015-1-115015-25, Nov. 2010.
32. L. Applebaum, W. Bajwa, M. F. Duarte, and R. Calderbank, "Asynchronous code-division random access using convex optimization," Phys. Commun., vol. 5, no. 2, pp. 129-147, Jun. 2011.
33. J. P. Slavinsky, J. Laska, M. A. Davenport, and R. G. Baraniuk, "The compressive multiplexer for multi-channel compressive sensing," in Proc. IEEE ICASSP, Prague, Czech Republic, May 2011, pp. 3980-3983.
34. S. Burer and R. D. C. Monteiro, "A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization," Math. Program., vol. 95, no. 2, pp. 329-357, Feb. 2003. (Pubitemid 44757858)
35. S. Burer and R. D. C. Monteiro, "Local minima and convergence in low-rank semidefinite programming," Math. Program., vol. 103, no. 3, pp. 427-444, Jul. 2005. (Pubitemid 40925236)
36. J. Lee, B. Recht, N. Srebro, R. R. Salakhutdinov, and J. A. Tropp, "Practical large-scale optimization for max-norm regularization," in Proc. Adv. Neural Inf. Process. Syst., 2010, pp. 1-9.
37. B. Recht and C. Ré, "Parallel stochastic gradient algorithms for largescale matrix completion," Math. Program. Comput., vol. 5, no. 2, pp. 201-226, Jun. 2013.
38. M. Schmidt. (2012). MinFunc: Unconstrained Differentiable Multivariate Optimization in Matlab [Online]. Available: http://www.di.ens.fr/~mschmidt/ Software/minFunc.html
39. D. Gross, Y.-K. Liu, S. Flammia, S. Becker, and J. Eisert, "Quantum state tomography via compressed sensing," Phys. Rev. Lett., vol. 105, no. 15, pp. 150401-1-150401-4, Oct. 2010.
40. B. Recht, W. Xu, and B. Hassibi, "Null space conditions and thresholds for rank minimization," Math. Program., vol. 127, no. 1, pp. 175-202, 2011.
41. E. Candès and J. Romberg, "Sparsity and incoherence in compressive sampling," Inverse Problems, vol. 23, no. 3, pp. 969-986, Jun. 2007.
42. E. Candès and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, no. 6, pp. 925-936, Jun. 2010.
43. J. A. Tropp, "User-friendly tail bounds for sums of random matrices," Found. Comput. Math., vol. 12, no. 4, pp. 389-434, 2012.
44. A. W. V. der Vaart and J. A. Wellner, Weak Convergence and Empirical Processes. New York, NY, USA: Springer-Verlag, 1996.
45. S. Dasgupta and A. Gupta, "An elementary proof of a theorem of Johnson and Lindenstrauss," Random Struct. Algorithms, vol. 22, no. 1, pp. 60-65, 2003.