This letter develops a fast iterative shrinkage-thresholding algorithm, which can efficiently tackle the issue in undersampled phase retrieval. First, using the gradient framework and proximal regularization theory, the undersampled phase retrieval problem is formulated as an optimization in terms of least-absolute-shrinkage-and-selection-operator form with $(\ell _2+\ell _1)$-norm minimization in the case of sparse signals. A gradient-based phase retrieval via majorization–minimization technique (G-PRIME) is applied to solve a quadratic approximation of the original problem, which, however, suffers a slow convergence rate. Then, an extension of the G-PRIME algorithm is derived to further accelerate the convergence rate, in which an additional iteration is chosen with a marginal increase in computational complexity. Experimental results show that the proposed algorithm outperforms the state-of-the-art approaches in terms of the convergence rate.
A Fast Gradient-Based Iterative Algorithm for Undersampled Phase Retrieval
IEEE Transactions on Aerospace and Electronic Systems ; 54 , 4 ; 2086-2090
2018-08-01
359587 byte
Article (Journal)
Electronic Resource
English
Superresolution performance for undersampled imagers
SPIE | 2004
|Super-Resolution from Highly Undersampled Images
British Library Conference Proceedings | 2005
|Super-resolution from highly undersampled images
IEEE | 2005
|