Sublinear-time algorithms for compressive phase retrieval

In the problem of compressed phase retrieval, the goal is to reconstruct a sparse or approximately k-sparse vector x in C n given access to y= |φ x|, where |v| denotes the vector obtained from taking the absolute value of v inCn coordinate-wise. In this paper we present sublinear-time algorithms for...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Yi, Nakos, Vasileios
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/161218
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first