Phase retrieval with sparse phase constraint
From MaRDI portal
Abstract: For the first time, this paper investigates the phase retrieval problem with the assumption that the phase (of the complex signal) is sparse in contrast to the sparsity assumption on the signal itself as considered in the literature of sparse signal processing. The intended application of this new problem model, which will be conducted in a follow-up paper, is to practical phase retrieval problems where the aberration phase is sparse with respect to the orthogonal basis of Zernike polynomials. Such a problem is called sparse phase retrieval (SPR) problem in this paper. When the amplitude modulation at the exit pupil is uniform, a new scheme of sparsity regularization on phase is proposed to capture the sparsity property of the SPR problem. Based on this regularization scheme, we design and analyze an efficient solution method, named SROP algorithm, for solving SPR given only a single intensity point-spread-function image. The algorithm is a combination of the Gerchberg-Saxton algorithm with the newly proposed sparsity regularization on the phase. The latter regularization step is mathematically a rotation but with direction varying in iterations. Surprisingly, this rotation is shown to be a metric projection on an auxiliary set which is independent of iterations. As a consequence, SROP algorithm is proved to be the cyclic projections algorithm for solving a feasibility problem involving three auxiliary sets. Analyzing regularity properties of the latter auxiliary sets, we obtain convergence results for SROP algorithm based on recent convergence theory for the cyclic projections algorithm. Numerical results show clear effectiveness of the new regularization scheme for solving the SPR problem.
Recommendations
- Phase retrieval for Fresnel measurements using a shearlet sparsity constraint
- Phase retrieval via sparse Wirtinger flow
- Phase retrieval via matrix completion
- Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem
- Phase retrieval for imaging problems
Cites work
- A convergent relaxation of the Douglas-Rachford algorithm
- About regularity of collections of sets
- About subtransversality of collections of sets
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Implicit Functions and Solution Mappings
- Local differentiability of distance functions
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
- On Fienup Methods for Sparse Phase Retrieval
- Optical Wavefront Reconstruction: Theory and Numerical Methods
- Quantitative characterizations of regularity properties of collections of sets
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Restricted normal cones and sparsity optimization with affine constraints
- Set regularities and feasibility problems
- Variational Analysis
Cited in
(15)- Absorption and phase retrieval with Tikhonov and joint sparsity regularizations
- Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval
- A learning-enhanced projection method for solving convex feasibility problems
- Phase retrieval via sparse Wirtinger flow
- Phase retrieval for sparse binary signal: uniqueness and algorithm
- scientific article; zbMATH DE number 7295466 (Why is no real title available?)
- scientific article; zbMATH DE number 1790402 (Why is no real title available?)
- Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem
- Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér–Rao Bound
- Phase retrieval for Fresnel measurements using a shearlet sparsity constraint
- Solving phase retrieval via graph projection splitting
- Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
- Wasserstein-based projections with applications to inverse problems
- Projection methods for high numerical aperture phase retrieval
- Phase retrieval via matrix completion
This page was built for publication: Phase retrieval with sparse phase constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027026)
