Generalized proximal smoothing (GPS) for phase retrieval
نویسندگان
چکیده
منابع مشابه
A Proximal Algorithm for Total Variation-Based Phase Retrieval
In this paper, I study the problem of phase retrieval with total variation (TV) smoothing and denoising. I construct an optimization model with an anisotropic TV penalty term, then show how to solve it using a proximal gradient method. This iterative-shrinkage-thresholding phase retrieval algorithm (ISTPRA) combines fixed-point iterations with a fast gradient solver for the convex subproblem. I...
متن کاملPhase retrieval in generalized optical interferometry systems.
Modal analysis of an optical field via generalized interferometry (GI) is a novel technique that treats said field as a linear superposition of transverse modes and recovers the amplitudes of modal weighting coefficients. We use phase retrieval by nonlinear optimization to recover the phase of these modal weighting coefficients. Information diversity increases the robustness of the algorithm by...
متن کاملPRISMA: PRoximal Iterative SMoothing Algorithm
Motivated by learning problems including max-norm regularized matrix completion and clustering, robust PCA and sparse inverse covariance selection, we propose a novel optimization algorithm for minimizing a convex objective which decomposes into three parts: a smooth part, a simple non-smooth Lipschitz part, and a simple non-smooth non-Lipschitz part. We use a time variant smoothing strategy th...
متن کاملPhase smoothing functions for continuous phase modulation
| In this paper, the problem of signal design for continuous phase modulation is examined. Using the performance measures of e ective bandwidth and minimum distance, \optimal" signal shapes are calculated for various receiver observation intervals for full and partial response signalling. For the partial response case, the optimization could only be done for a receiver observation interval of o...
متن کاملGeneralized Probability Smoothing
In this work we consider a generalized version of Probability Smoothing, the core elementary model for sequential prediction in the state of the art PAQ family of data compression algorithms. Our main contribution is a code length analysis that considers the redundancy of Probability Smoothing with respect to a Piecewise Stationary Source. The analysis holds for a finite alphabet and expresses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2019
ISSN: 1094-4087
DOI: 10.1364/oe.27.002792