Sublinear-time algorithms for compressive phase retrieval
In the compressive phase retrieval problem, the goal is to reconstruct a sparse or approximately k-sparse vector x ∈ R n given access to y = |Φ x |, where |v| denotes the vector obtained from taking the absolute value of v ∈ R n coordinatewise. In this paper we present sublinear-time algorithms for...
Saved in:
Main Authors: | , |
---|---|
其他作者: | |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/142571 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
成為第一個發表評論!