Skip to search formSkip to main contentSkip to account menu

Gerchberg–Saxton algorithm

Known as: Gerchberg Saxton algorithm, Gerchberg-Saxton algorithm 
The Gerchberg–Saxton (GS) algorithm is an iterative algorithm for retrieving the phase of a pair of light distributions (or any other mathematically… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The modified Gerchberg-Saxton algorithm (MGSA) is one of the standard methods for phase retrieval. In this work we apply the MGSA… 
2015
2015
This Letter proposes to apply full-color computer-generated holograms to the virtual image projection system so that the viewers… 
2015
2015
We propose an iterative algorithm by introducing the strategy of gradient decent and magnitude modification into the Gerchburg… 
2009
2009
This paper presents a method to reconstruct the drifting sensor responses for electronic-nose (E-nose) systems. The sensor drift… 
2006
2006
The Gerchberg-Saxton algorithm, which is often used for phase retrieval in free space diffractive optics, is here applied to the… 
2005
2005
The iterative algorithm of Papoulis-Gerchberg is famous for solving the lost samples recovery problem, however, is usually slowly… 
Highly Cited
2003
Highly Cited
2003
In this paper, we present a simple method to almost quadruple the spatial resolution of aliased images. From a set of four low… 
2001
2001
The phase retrieval problem is of paramount importance in various areas of applied physics and engineering. The state of the art… 
1994
1994
Considers the problem of restoring randomly distributed sets of missing pixels in band-limited discrete images, and give non… 
1984
1984
An iterative algorithm for extrapolating analog band-limited signals has been proposed by Papoulis and Gerchberg.1By inserting a…