Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,016,073 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Adaptive-additive algorithm
Algorithm
Holography
List of algorithms
Expand
Broader (1)
Digital signal processing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Almost perfect phase retrieval in the Fresnel domain by a modified Gerchberg-Saxton algorithm
Soheil Mehrabkhani
,
M. Kuester
,
T. Schneider
2017
Corpus ID: 126087979
The modified Gerchberg-Saxton algorithm (MGSA) is one of the standard methods for phase retrieval. In this work we apply the MGSA…
Expand
2015
2015
Full-color and less-speckled modified Gerchberg–Saxton algorithm computer-generated hologram floating in a dual-parabolic projection system
Chien-Yu Chen
,
Hsuan T. Chang
,
Tsung-Jan Chang
,
and Chih-Hao Chuang
2015
Corpus ID: 55640818
This Letter proposes to apply full-color computer-generated holograms to the virtual image projection system so that the viewers…
Expand
2015
2015
An iterative algorithm for computer-generated holograms calculation
Weirui Yue
,
Qiang Song
,
Jingdan Liu
,
G. Situ
2015
Corpus ID: 62438084
We propose an iterative algorithm by introducing the strategy of gradient decent and magnitude modification into the Gerchburg…
Expand
2009
2009
Reconstruction of Drifting Sensor Responses Based on Papoulis–Gerchberg Method
Dongliang Huang
,
H. Leung
IEEE Sensors Journal
2009
Corpus ID: 24731697
This paper presents a method to reconstruct the drifting sensor responses for electronic-nose (E-nose) systems. The sensor drift…
Expand
2006
2006
Non-linear Signal Retrieval in Wide-Band Photonic Time-Stretch Systems Using the Gerchberg-Saxton Algorithm
G. Stigwall
,
S. Galt
International Topical Meeting on Microwave…
2006
Corpus ID: 38077886
The Gerchberg-Saxton algorithm, which is often used for phase retrieval in free space diffractive optics, is here applied to the…
Expand
2005
2005
Improved Papoulis-Gerchberg algorithm for restoring lost samples
Chau-Yun Hsu
,
Tsung-Ming Lo
Proceedings of the Fifth IEEE International…
2005
Corpus ID: 16886143
The iterative algorithm of Papoulis-Gerchberg is famous for solving the lost samples recovery problem, however, is usually slowly…
Expand
Highly Cited
2003
Highly Cited
2003
Superresolution images reconstructed from aliased images
P. Vandewalle
,
S. Süsstrunk
,
M. Vetterli
Visual Communications and Image Processing
2003
Corpus ID: 10865855
In this paper, we present a simple method to almost quadruple the spatial resolution of aliased images. From a set of four low…
Expand
2001
2001
Phase retrieval, Gerchberg-Saxton algorithm, and Fienup variants: A view from convex optimization
Heinz H. Bauschke
,
P. Combettes
,
D. R. Luke
2001
Corpus ID: 118551124
The phase retrieval problem is of paramount importance in various areas of applied physics and engineering. The state of the art…
Expand
1994
1994
Errorless restoration algorithms for band-limited images
P. J. Ferreira
,
A. Pinho
Proceedings of 1st International Conference on…
1994
Corpus ID: 16777092
Considers the problem of restoring randomly distributed sets of missing pixels in band-limited discrete images, and give non…
Expand
1984
1984
An improved version of Papoulis-Gerchberg algorithm on band-limited extrapolation
C. Chamzas
,
Wen Xu
1984
Corpus ID: 122097754
An iterative algorithm for extrapolating analog band-limited signals has been proposed by Papoulis and Gerchberg.1By inserting a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE