Sublinear- Time Algorithms for Compressive Phase Retrieval

@article{Li2018SublinearTA,
  title={Sublinear- Time Algorithms for Compressive Phase Retrieval},
  author={Yi Li and Vasileios Nakos},
  journal={2018 IEEE International Symposium on Information Theory (ISIT)},
  year={2018},
  pages={2301-2305}
}
  • Yi Li, Vasileios Nakos
  • Published 2018
  • Computer Science, Mathematics
  • 2018 IEEE International Symposium on Information Theory (ISIT)
  • In the compressive phase retrieval problem, the goal is to reconstruct a sparse or approximately k-sparse vector $x\in \mathbb{R}^{n}$ given access to $y=\vert \Phi x\vert$, where $\vert v\vert$ denotes the vector obtained from taking the absolute value of $v\in \mathbb{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 of the classical compressive sensing problem considered… CONTINUE READING

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 65 REFERENCES

    Fast Phase Retrieval from Local Correlation Measurements

    VIEW 2 EXCERPTS

    A Geometric Analysis of Phase Retrieval

    • Ju Sun, Qing Qu, John Wright
    • Mathematics, Computer Science
    • 2016 IEEE International Symposium on Information Theory (ISIT)
    • 2016
    VIEW 1 EXCERPT

    Stable Signal Recovery from Phaseless Measurements

    VIEW 2 EXCERPTS

    On the Power of Adaptivity in Sparse Recovery

    VIEW 1 EXCERPT

    (1 + eps)-Approximate Sparse Recovery

    Almost optimal phaseless compressed sensing with sublinear decoding time

    • Vasileios Nakos
    • Computer Science, Mathematics
    • 2017 IEEE International Symposium on Information Theory (ISIT)
    • 2017
    VIEW 9 EXCERPTS

    PhaseMax: Convex Phase Retrieval via Basis Pursuit

    VIEW 1 EXCERPT

    Phase Retrieval via Wirtinger Flow: Theory and Algorithms

    VIEW 1 EXCERPT