<title>Novel polygonal-aperture encoding for designing diffractive optical elements</title>
Bibliographic record
Abstract
A novel multiplexed computer-generated hologram (CGH) is designed with polygonal apertures. The multiplexed CGH is encoded with elementary rectangular cells divided into arbitrary-shaped polygonal apertures. The division is identical in all cells. The phase values of the apertures are assigned during the design. The polygonal apertures of same locations inside the cells constitute a subhologram. The cells are further divided in pixel arrays to exploit the huge number of degrees of freedom provided by electron-beam lithography. With the Abbe transform that has never been used, to our knowledge, in other CGH designs, the subhologram subimages are obtained by fast Fourier transforms. Hence, it is possible to design a multiplexed CGH that has a size thousands times larger than the manageable size of a conventional CGH designed with the iterative Fourier-transform algorithm. A much larger object window than that of the conventional CGH can also be achieved with the multiplexed polygonal-aperture CGH, because of its much larger number of pixels. A new iterative gradient descent algorithm results in a high performance of the multiplexed polygonal-aperture CGH. The noise appearing in other multiplexed-CGH designs is avoided.
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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".