GS Phase Retrieval Algorithm Implementation

This implementation provides an image phase retrieval algorithm called the Gerchberg-Saxton (GS) algorithm. The GS algorithm represents a fundamental iterative approach for phase recovery problems. Through this code, you can understand and apply the algorithm's core principles, which involve alternating between Fourier and image domains while applying amplitude constraints. The implementation typically includes functions for Fourier transforms, amplitude replacement, and convergence checking. The package includes sample images that serve as test cases for algorithm validation and performance evaluation. These images help demonstrate the algorithm's application scenarios and effectiveness in practical phase retrieval tasks. The GS algorithm operates through iterative projections where the Fourier transform magnitude is constrained while the phase is progressively refined. By studying and practicing with this implementation, you can master the principles and techniques of image phase retrieval algorithms. The code structure allows for modifications and extensions, enabling deeper research and applications in related fields such as optics, microscopy, and computational imaging. Key algorithmic steps include initialization with random phases, Fourier domain constraints, and inverse transforms with proper handling of complex arrays.