Sublinear-Time Algorithms for Compressive Phase Retrieval

DOI10.1109/TIT.2020.3020701MaRDI QIDQ5138893zbMATH OpenOpenAlexFDO

Authors Yi Li, Vasileios Nakos

Publication date 4 December 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.02917

zbMATH Keywords

compressive phase retrieval problemsublinear-time algorithms

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: In the compressive phase retrieval problem, or phaseless compressed sensing, or compressed sensing from intensity only measurements, the goal is to reconstruct a sparse or approximately $k$-sparse vector $xinmathbb{R}^n$ given access to $y=|Phix|$, where $|v|$ denotes the vector obtained from taking the absolute value of $vinmathbb{R}^n$ coordinate-wise. In this paper we present sublinear-time algorithms for different variants of the compressive phase retrieval problem which are akin to the variants considered for the classical compressive sensing problem in theoretical computer science. Our algorithms use pure combinatorial techniques and near-optimal number of measurements.

This page was built for publication: Sublinear-Time Algorithms for Compressive Phase Retrieval

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