Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Alternating Phase Projected Gradient Descent with Generative Priors for Solving Compressive Phase Retrieval (1903.02707v1)

Published 7 Mar 2019 in cs.CV

Abstract: The classical problem of phase retrieval arises in various signal acquisition systems. Due to the ill-posed nature of the problem, the solution requires assumptions on the structure of the signal. In the last several years, sparsity and support-based priors have been leveraged successfully to solve this problem. In this work, we propose replacing the sparsity/support priors with generative priors and propose two algorithms to solve the phase retrieval problem. Our proposed algorithms combine the ideas from AltMin approach for non-convex sparse phase retrieval and projected gradient descent approach for solving linear inverse problems using generative priors. We empirically show that the performance of our method with projected gradient descent is superior to the existing approach for solving phase retrieval under generative priors. We support our method with an analysis of sample complexity with Gaussian measurements.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Rakib Hyder (10 papers)
  2. Viraj Shah (18 papers)
  3. Chinmay Hegde (109 papers)
  4. M. Salman Asif (54 papers)
Citations (44)

Summary

We haven't generated a summary for this paper yet.