Information Theoretic Limits for Phase Retrieval With Subsampled Haar Sensing Matrices

From MaRDI portal
(Redirected from Publication:5138946)



Abstract: We study information theoretic limits of recovering an unknown n dimensional, complex signal vector mathbfxstar with unit norm from m magnitude-only measurements of the form yi=|(mathbfAmathbfxstar)i|2,;i=1,2dots,m, where mathbfA is the sensing matrix. This is known as the Phase Retrieval problem and models practical imaging systems where measuring the phase of the observations is difficult. Since in a number of applications, the sensing matrix has orthogonal columns, we model the sensing matrix as a subsampled Haar matrix formed by picking n columns of a uniformly random mimesm unitary matrix. We study this problem in the high dimensional asymptotic regime, where m,nightarrowinfty, while m/nightarrowdelta with delta being a fixed number, and show that if m<(2−on(1))cdotn, then any estimator is asymptotically orthogonal to the true signal vector mathbfxstar. This lower bound is sharp since when m>(2+on(1))cdotn, estimators that achieve a non trivial asymptotic correlation with the signal vector are known from previous works.













This page was built for publication: Information Theoretic Limits for Phase Retrieval With Subsampled Haar Sensing Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138946)