Understanding the Gerchberg-Saxton Algorithm through Convex Optimization

  • Context: Graduate 
  • Thread starter Thread starter j-lee00
  • Start date Start date
  • Tags Tags
    Algorithm
Click For Summary
SUMMARY

The Gerchberg-Saxton algorithm is a computational method used for phase retrieval in diffraction patterns, addressing the "phase problem" encountered when the dimensions of an object are unknown. The algorithm iteratively refines the phase of the wave produced in the diffraction plane, enhancing the accuracy of the retrieved phase. Key to understanding this algorithm is its basis in convex optimization, which facilitates the iterative improvement process. For further insights, the paper available on ResearchGate provides a comprehensive overview of the algorithm and its variants.

PREREQUISITES
  • Understanding of diffraction patterns and wave optics
  • Familiarity with phase retrieval techniques
  • Knowledge of convex optimization principles
  • Experience with iterative algorithms and their applications
NEXT STEPS
  • Study the mathematical foundations of the Gerchberg-Saxton algorithm
  • Explore convex optimization techniques relevant to phase retrieval
  • Review the Fienup variants of phase retrieval algorithms
  • Implement the Gerchberg-Saxton algorithm using Python libraries such as NumPy and SciPy
USEFUL FOR

Researchers, optical engineers, and computer scientists interested in phase retrieval methods and applications in imaging and signal processing will benefit from this discussion.

j-lee00
Messages
93
Reaction score
0
Please help me understand the Gerchberg–Saxton algorithm

what I comprehended so far

1) A source is shone on an object and produces a diffraction pattern in the diffraction plane. We do not know the dimensions of the object.

2) We are unable to calculate the phase of the of the wave, due to the "phase problem"

Now we want to computationally find the phase of the wave that is produced in the diffraction plane


I do not understand how the Gerchberg–Saxton algorithm works. i.e. how we improve to get a closer phase through the iterative method

Thanks
 
Science news on Phys.org
If you have checked Wikipedia and your doubts are still not clear, trying reading this paper available freely at ResearchGate:

https://www.researchgate.net/publication/11281090_Phase_retrieval_Gerchberg-Saxton_algorithm_and_Fienup_variants_A_view_from_convex_optimization
 

Similar threads

Graduate Diffraction theory, power density and angle of incidence
  • · Replies 5 ·
Replies
5
Views
3K
Graduate Abbe theory: diffraction pattern to primary image
  • · Replies 12 ·
Replies
12
Views
3K
Graduate How to compute phase gradient from Snell's law?
  • · Replies 1 ·
Replies
1
Views
3K
Graduate Fourier shifting theorem in diffraction
  • · Replies 1 ·
Replies
1
Views
2K
Graduate How to model converging illumination through object plane (in ZEMAX)
  • · Replies 1 ·
Replies
1
Views
1K
Undergrad Gradient descent algorithm and optimizers
  • · Replies 5 ·
Replies
5
Views
2K
Undergrad Diffraction Definition & Common Examples
  • · Replies 1 ·
Replies
1
Views
5K
Undergrad Difference between interference and diffraction?
  • · Replies 7 ·
Replies
7
Views
6K
Graduate What are the key considerations for imaging with a condenser fresnel lens?
  • · Replies 58 ·
2
Replies
58
Views
8K
Undergrad Understanding Ewald's sphere in the context of X-Ray diffraction
  • · Replies 3 ·
Replies
3
Views
6K