Share Email Print
cover

Proceedings Paper

Phase Recovery Via Mathematical Programming
Author(s): Arnold Lent
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Gerchberg-Saxton problem of phase recovery is identified with the canonical problem of locating a point of maximum norm in a given convex set. Some heuristic algorithms are proposed.

Paper Details

Date Published: 1 November 1989
PDF: 4 pages
Proc. SPIE 1199, Visual Communications and Image Processing IV, (1 November 1989); doi: 10.1117/12.970160
Show Author Affiliations
Arnold Lent, Fairleigh Dickinson University (United States)


Published in SPIE Proceedings Vol. 1199:
Visual Communications and Image Processing IV
William A. Pearlman, Editor(s)

© SPIE. Terms of Use
Back to Top