A Hybrid Iterative Algorithm of Amplitude Weighting and Phase Gradient Descent for Generating Phase-Only Fourier Hologram
Bibliographic record
Abstract
Reconstruction of target images from phase-only hologram (POH) has the advantages of high diffraction efficiency and no conjugate terms. The Gerchberg-Saxton (GS) algorithm is a classical algorithm applied to recover the phase, but it most likely stagnantes after a few iterations. This paper proposes a hybrid iterative algorithm of Amplitude Weighting and Phase Gradient Descent (AW-PGD) to generate a higher-quality POH. Firstly, the quadratic phase is used as the initial phase, zero-pads the periphery of the target image, and then multiplies the two to form the complex amplitude as the iterative initial value. During iteration, the amplitude of the reconstructed image is constrained by an adaptive dynamic exponential term in the signal region to improve the reconstruction accuracy, the constraint in the non-signal region is relaxed to reduce the computational effort at the same time; and the phase gradient descent technology is used to increase the iteration step and speed up the convergence. Finally, the target image amplitude is reconstructed based on the generated POH. The numerical simulation results show that the algorithm does not have a significant increase in time cost with better reconstruction quality than the GS, Weighted GS (WGS) and Adaptive Weighted GS (AWGS) algorithm.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".