Multiplexed computer-generated holograms with irregular-shaped polygonal apertures and discrete phase levels
Bibliographic record
Abstract
We propose a novel type of multiplexed computer-generated hologram (MCGH) with irregular-shaped polygonal apertures and discrete phase levels. Each elementary cell forming the new MCGH is divided into a central aperture and several peripheral apertures. The new MCGH allows us to exploit the huge space-bandwidth product provided by standard lithography technologies. With use of the Abbe transform, the Fraunhofer diffraction patterns from the polygonal apertures and, therefore, the layout coefficients can be computed with simple algebraic expressions. Several symmetries related to the polygonal apertures also facilitate the layout-coefficient computation. In the novel iterative subhologram design algorithm (ISDA), we consider all subholograms equally and apply the image-plane constraint to the total reconstructed image, which is the coherent addition of the subimages from the subholograms. We designed MCGHs with several billions of pixels per period, which cannot be achieved with the classical iterative Fourier transform algorithm, because of the prohibitive computational cost and memory limitation. MCGHs with irregular polygonal apertures and discrete phases, which were designed by the ISDA, reconstruct a desired image of large size with high diffraction efficiencies and low reconstruction errors.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".