arXiv Analytics

Sign in

arXiv:1403.1458 [cs.IT]AbstractReferencesReviewsResources

Phase Transitions in Phase Retrieval

Dustin G. Mixon

Published 2014-03-06, updated 2014-03-07Version 2

Consider a scenario in which an unknown signal is transformed by a known linear operator, and then the pointwise absolute value of the unknown output function is reported. This scenario appears in several applications, and the goal is to recover the unknown signal -- this is called phase retrieval. Phase retrieval has been a popular subject of research in the last few years, both in determining whether complete information is available with a given linear operator, and in finding efficient and stable phase retrieval algorithms in the cases where complete information is available. Interestingly, there are a few ways to measure information completeness, and each way appears to be governed by a phase transition of sorts. This chapter will survey the state of the art with some of these phase transitions, and identify a few open problems for further research.

Comments: Book chapter, survey of recent literature, submitted to Excursions in Harmonic Analysis: The February Fourier Talks at the Norbert Wiener Center
Categories: cs.IT, math.AG, math.FA, math.IT
Related articles: Most relevant | Search more
arXiv:1303.6672 [cs.IT] (Published 2013-03-26, updated 2014-04-25)
Living on the edge: Phase transitions in convex programs with random data
arXiv:1905.10031 [cs.IT] (Published 2019-05-24)
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation
arXiv:1003.0219 [cs.IT] (Published 2010-03-01)
Sequential Compressed Sensing