TY - JOUR
T1 - Fast Signal Recovery from Quadratic Measurements
AU - Moscoso, Miguel
AU - Novikov, Alexei
AU - Papanicolaou, George
AU - Tsogka, Chrysoula
N1 - Funding Information:
Manuscript received October 7, 2020; revised January 20, 2021 and March 9, 2021; accepted March 9, 2021. Date of publication March 19, 2021; date of current version April 12, 2021. The work of Miguel Moscoso was supported by Spanish MICINN under Grant FIS2016-77892-R. The work of Alexei Novikov was supported by NSF DMS under Grant 1813943 and AFOSR under Grant FA9550-20-1-0026. The work of George Papanicolaou was supported by AFOSR under Grant FA9550-18-1-0519. The work of Chrysoula Tsogka was supported by AFOSR under Grants FA9550-17-1-0238 and FA9550-18-1-0519. (Corresponding author: Chrysoula Tsogka.) Miguel Moscoso is with the Department of Mathematics, Univer-sidad Carlos III de Madrid, Leganes 28911, Madrid, Spain (e-mail: moscoso@math.uc3m.es).
Publisher Copyright:
© 1991-2012 IEEE.
PY - 2021
Y1 - 2021
N2 - We present a novel approach for recovering a sparse signal from quadratic measurements corresponding to a rank-one tensorization of the data vector. Such quadratic measurements, referred to as interferometric or cross-correlated data, naturally arise in many fields such as remote sensing, spectroscopy, holography and seismology. Compared to the sparse signal recovery problem that uses linear measurements, the unknown in this case is a matrix formed by the cross correlations of the sought signal. This creates a bottleneck for the inversion since the number of unknowns grows quadratically with the dimension of the signal. The main idea of the proposed approach is to reduce the dimensionality of the problem by recovering only the diagonal of the unknown matrix, whose dimension grows linearly with the size of the signal, and use an efficient Noise Collector to absorb the cross-correlated data that come from the off-diagonal elements of this matrix. These elements do not carry extra information about the support of the signal, but significantly contribute to these data. With this strategy, we recover the unknown matrix by solving a convex linear problem whose cost is similar to the one that uses linear measurements. Our theory shows that the proposed approach provides exact support recovery when the data is not too noisy, and that there are no false positives for any level of noise. It also demonstrates that the level of sparsity that can be recovered scales almost linearly with the number of data. The numerical experiments presented in the paper corroborate these findings.
AB - We present a novel approach for recovering a sparse signal from quadratic measurements corresponding to a rank-one tensorization of the data vector. Such quadratic measurements, referred to as interferometric or cross-correlated data, naturally arise in many fields such as remote sensing, spectroscopy, holography and seismology. Compared to the sparse signal recovery problem that uses linear measurements, the unknown in this case is a matrix formed by the cross correlations of the sought signal. This creates a bottleneck for the inversion since the number of unknowns grows quadratically with the dimension of the signal. The main idea of the proposed approach is to reduce the dimensionality of the problem by recovering only the diagonal of the unknown matrix, whose dimension grows linearly with the size of the signal, and use an efficient Noise Collector to absorb the cross-correlated data that come from the off-diagonal elements of this matrix. These elements do not carry extra information about the support of the signal, but significantly contribute to these data. With this strategy, we recover the unknown matrix by solving a convex linear problem whose cost is similar to the one that uses linear measurements. Our theory shows that the proposed approach provides exact support recovery when the data is not too noisy, and that there are no false positives for any level of noise. It also demonstrates that the level of sparsity that can be recovered scales almost linearly with the number of data. The numerical experiments presented in the paper corroborate these findings.
UR - http://www.scopus.com/inward/record.url?scp=85103271136&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85103271136&partnerID=8YFLogxK
U2 - 10.1109/TSP.2021.3067140
DO - 10.1109/TSP.2021.3067140
M3 - Article
AN - SCOPUS:85103271136
VL - 69
SP - 2042
EP - 2055
JO - IRE Transactions on Audio
JF - IRE Transactions on Audio
SN - 1053-587X
M1 - 9382106
ER -