Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Phase Retrieval Algorithm Using a Convolution Based Hilbert Space

Not Accessible

Your library or personal account may give you access

Abstract

A phase retrieval algorithm using the method of projection onto convex sets (POCS) [1,2] in a new Hilbert Space framework which is based on convolution is described. In this space, the set of sequences with a prescribed Fourier Transform magnitude constitute a closed convex set, which is not true in (or L2) Hilbert space. This property of the constraints ensures convergence in the POCS method. Examples of phase retrieval for 2-D sequences are presented.

© 1986 Optical Society of America

PDF Article
More Like This
Phase Retrieval: Algorithm Improvements, Uniqueness, and Complex Objects

J.R. Fienup
ThA2 Signal Recovery and Synthesis (SRS) 1986

Image reconstruction in tomography using convex projections

Henry Stark and Peyma Oskoui-Fard
MR4 OSA Annual Meeting (FIO) 1986

Image restoration from the signed Fourier magnitude using generalized projections

Aharon Levi, Eitan Yudilevich, George Habetler, and Henry Stark
TUG6 OSA Annual Meeting (FIO) 1986

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.