Skip to main content

Phase Retrieval via Accelerated Gradient Descent

  • Conference paper
  • First Online:
Artificial Intelligence and Security (ICAIS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11634))

Included in the following conference series:

  • 1378 Accesses

Abstract

Phase retrieval, as a non-convex optimization problem arises in many areas of signal processing, is to recover the missed signal phase. Based on the Truncated Wirtinger Flow (TWF), where the updating can be regarded as stochastic gradient descent, we present the Accelerated Wirtinger Flow (AWF), which updates the iterative process with accelerated steepest descent. WF algorithm solves the problem by two steps: (a) initialization signal with truncated spectral initialization method provided in TWF and (b) a series of updates this initial estimate by iteratively applying a novel update rule, AWF. Meanwhile, according to the Amplitude Flow objective, the proximal gradient method is suggested.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Duchi, J.C., Ruan, F.: Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval. Inf. Infer.: A J. IMA (2017). https://doi.org/10.1093/imaiai/iay015

  2. Candès, E.J., Eldar, Y.C., Strohmer, T., Voroninski, V.: Phase retrieval via matrix completion. CoRR abs/1109.0573 (2011). http://arxiv.org/abs/1109.0573

  3. Candès, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via wirtinger flow: theory and algorithms. IEEE Trans. Inf. Theory 61(4), 1985–2007 (2015). https://doi.org/10.1109/TIT.2015.2399924

    Article  MathSciNet  MATH  Google Scholar 

  4. Candès, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval from coded diffraction patterns. Appl. Comput. Harmonic Anal. 39 (2013). https://doi.org/10.1016/j.acha.2014.09.004

    Article  MathSciNet  Google Scholar 

  5. Candès, E.J., Strohmer, T., Voroninski, V.: Phaselift: exact and stable signal recovery from magnitude measurements via convex programming. CoRR abs/1109.4499 (2011). http://arxiv.org/abs/1109.4499

  6. Chen, Y., Candès, E.J.: Solving random quadratic systems of equations is nearly as easy as solving linear systems. CoRR abs/1505.05114 (2015). http://arxiv.org/abs/1505.05114

  7. Eldar, Y.C., Mendelson, S.: Phase retrieval: stability and recovery guarantees. Appl. Comput. Harmonic Anal. 36(3), 473–494 (2014). https://doi.org/10.1016/j.acha.2013.08.003. http://www.sciencedirect.com/science/article/pii/S1063520313000717

    Article  MathSciNet  MATH  Google Scholar 

  8. Gerchberg, R., Saxton, W.O.A.: A practical algorithm for the determination of phase from image and diffraction plane pictures. Optik 35, 237–250 (1971)

    Google Scholar 

  9. Jain, P., Kar, P.: Non-convex optimization for machine learning. Found. Trends® Mach. Learn. 10, 142–336 (2017). https://doi.org/10.1561/2200000058

    Article  Google Scholar 

  10. Lucas, A.: A-DNA and B-DNA: comparing their historical x-ray fiber diffraction images. J. Chem. Educ. 85 (2008). https://doi.org/10.1021/ed085p737

    Article  Google Scholar 

  11. Luenberger, D., Ye, Y.: Linear and nonlinear programming (2008). https://doi.org/10.1007/978-0-387-74503-9

    Book  Google Scholar 

  12. Netrapalli, P., Jain, P., Sanghavi, S.: Phase retrieval using alternating minimization. IEEE Trans. Signal Process. 63(18), 4814–4826 (2015). https://doi.org/10.1109/TSP.2015.2448516

    Article  MathSciNet  MATH  Google Scholar 

  13. Shechtman, Y., Eldar, Y.C., Cohen, O., Chapman, H.N., Miao, J., Segev, M.: Phase retrieval with application to optical imaging. CoRR abs/1402.7350 (2014). http://arxiv.org/abs/1402.7350

  14. Shuo Tan, Y., Vershynin, R.: Phase retrieval via randomized kaczmarz: theoretical guarantees. Inf. Infer.: A J. IMA (2017). https://doi.org/10.1093/imaiai/iay005

    Article  MathSciNet  Google Scholar 

  15. Sun, J., Qu, Q., Wright, J.: A geometric analysis of phase retrieval. CoRR abs/1602.06664 (2016). http://arxiv.org/abs/1602.06664

  16. Wang, G., Zhang, L., Giannakis, G.B., Akçakaya, M., Chen, J.: Sparse phase retrieval via truncated amplitude flow. CoRR abs/1611.07641 (2016). http://arxiv.org/abs/1611.07641

  17. Xiong, Z., Shen, Q., Wang, Y., Zhu, C.: Paragraph vector representation based on word to vector and CNN learning. CMC: Comput. Mater. Continua 055(2), 213–227 (2018)

    Google Scholar 

  18. Zhang, J., Xie, N., Zhang, X., Yue, K., Li, W., Kumar, D.: Machine learning based resource allocation of cloud computing in auction. CMC: Comput. Mater. Continua 056(1), 123–135 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi Qin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qin, Y. (2019). Phase Retrieval via Accelerated Gradient Descent. In: Sun, X., Pan, Z., Bertino, E. (eds) Artificial Intelligence and Security. ICAIS 2019. Lecture Notes in Computer Science(), vol 11634. Springer, Cham. https://doi.org/10.1007/978-3-030-24271-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24271-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24270-1

  • Online ISBN: 978-3-030-24271-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics