The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Blind Deconvolution Using Convex Programming
Abstract
We consider the problem of recovering two unknown vectors, w and x, of length L from their circular convolution. We make the structural assumption that the two vectors are members of known subspaces, one with dimension N and the other with dimension K. Although the observed convolution is nonlinear in both w and x, it is linear in the rank-1 matrix formed by their outer product wx*. This observation allows us to recast the deconvolution problem as low-rank matrix recovery problem from linear measurements, whose natural convex relaxation is a nuclear norm minimization program. We prove the effectiveness of this relaxation by showing that, for “generic” signals, the program can deconvolve w and x exactly when the maximum of N and K is almost on the order of L. That is, we show that if x is drawn from a random subspace of dimension N, and w is a vector in a subspace of dimension K whose basis vectors are spread out in the frequency domain, then nuclear norm minimization recovers wx* without error. We discuss this result in the context of blind channel estimation in communications. If we have a message of length N, which we code using a random L x N coding matrix, and the encoded message travels through an unknown linear time-invariant channel of maximum length K, then the receiver can recover both the channel response and the message when L ≳ N + K, to within constant and log factors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Weak Convergence and Empirical Processes
van der Vaart, A. W., & Wellner, J. A. (1996) · Springer Series in Statistics · doi:10.1007/978-1-4757-2545-2 · Cited by 5,014
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Self-citationGuaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Self-citationSparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
Self-citationThe Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Kundur, D., & Hatzinakos, D. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.489268 · Cited by 1,275
Total variation blind deconvolution
Chan, T. F., & Wong, C.-K. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661187 · Cited by 1,201
PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
Candès, E. J., Strohmer, T., & Voroninski, V. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21432 · Cited by 1,197
Blind deconvolution using a normalized sparsity measure
Krishnan, D., Tay, T., & Fergus, R. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995521 · Cited by 1,119
Quantum State Tomography via Compressed Sensing
Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., & Eisert, J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.150401 · Cited by 1,093
Blind identification and equalization based on second-order statistics: a time domain approach
Tong, L., Xu, G., & Kailath, T. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.312157 · Cited by 1,078
1 USER-FRIENDLY TAIL BOUNDS FOR SUMS OF RANDOM MATRICES
Tropp, J. A. (2010) · Cited by 1,018
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
An elementary proof of a theorem of Johnson and Lindenstrauss
Dasgupta, S., & Gupta, A. (2003) · Random Structures & Algorithms · doi:10.1002/rsa.10073 · Cited by 932
A Method of Self-Recovering Equalization for Multilevel Amplitude-Modulation Systems
Sato, Y. (1975) · IEEE Transactions on Communications · doi:10.1109/tcom.1975.1092854 · Cited by 861
A least-squares approach to blind channel identification
Xu, G., Liu, H., Tong, L., & Kailath, T. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.476442 · Cited by 777
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S., & Monteiro, R. D. C. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0352-8 · Cited by 770
User-Friendly Tail Bounds for Sums of Random Matrices
Tropp, J. A. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9099-z · Cited by 718
A Simpler Approach to Matrix Completion
Recht, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0910.0651 · Cited by 673
Self-citationMatrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Gross, D. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2104999 · Cited by 602
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V., Lounici, K., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/11-aos894 · Cited by 598
Recovering low-rank matrices from few coefficients in any basisPreprint
Gross, D. (2010) · Cited by 576
Multichannel blind identification: from subspace to maximum likelihood methods
Tong, L., & Perreau, S. (1998) · Proceedings of the IEEE · doi:10.1109/5.720247 · Cited by 572
Candès, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111771 · Cited by 569
Understanding Blind Deconvolution Algorithms
Levin, A., Weiss, Y., Durand, F., & Freeman, W. T. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.148 · Cited by 425
Local Minima and Convergence in Low-Rank Semidefinite Programming
Burer, S., & Monteiro, R. D. C. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0564-1 · Cited by 347
A Simpler Approach to Matrix Completion
RechtBenjamin (2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2185803 · Cited by 310
Parallel stochastic gradient algorithms for large-scale matrix completion
Recht, B., & Ré, C. (2013) · Mathematical Programming Computation · doi:10.1007/s12532-013-0053-8 · Cited by 300
Self-citationADMiRA: Atomic Decomposition for Minimum Rank Approximation
Lee, K., & Bresler, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054251 · Cited by 267
Terahertz imaging with compressed sensing and phase retrieval
Chan, W. L., Moravec, M. L., Baraniuk, R. G., & Mittleman, D. M. (2008) · Optics Letters · doi:10.1364/ol.33.000974 · Cited by 224
Recent developments in blind channel equalization: From cyclostationarity to subspaces
Liu, H., Xu, G., Tong, L., & Kailath, T. (1996) · Signal Processing · doi:10.1016/0165-1684(96)00013-8 · Cited by 165
Practical Large-Scale Optimization for Max-norm Regularization
Lee, J. D., Recht, B., Srebro, N., Tropp, J. A., & Salakhutdinov, R. (2010) · CaltechAUTHORS (California Institute of Technology) · Cited by 124
Self-citationCompressive multiplexers for correlated signals
Ahmed, A. M., & Romberg, J. (2012) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2012.6489159 · Cited by 9
Self-citation
Cited by
An Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439
Self-citationNonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
Sun, J., Qu, Q., & Wright, J. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2632162 · Cited by 213
Nonconvex Demixing From Bilinear Measurements
Dong, J., & Shi, Y. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2864660 · Cited by 37
“Although blind demixing can be regarded as a variant of blind deconvolution [7] by extending the problem of “single-source” setting to the “multi-source” setting, it is nontrivial to accomplish the extension.”
Blind Demixing for Low-Latency Communication
Dong, J., Yang, K., & Shi, Y. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2886191 · Cited by 22
Metadata
- Authors
- Ahmed, A., Recht, B., & Romberg, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-03
- Volume
- 60
- Issue
- 3
- Pages
- 1711-1732
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2140867429
- Cited by
- 387
- References
- 36
- FWCI
- 34.24
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.