Artificial Intelligence to Design a Mask Insensible to the Distance From the Camera to the Scene Objects
Bibliographic record
Abstract
The sharpness of an image depends on the spatial frequency response of the photographic imaging system and the sensor characteristics. In conventional digital cameras, only those objects within a distance range are in focus, while other objects are captured with different amounts of blurring depending on their distance to the focal plane. This can be desired for some applications; however, this can also be undesired because some objects in the scene may be blurred and impossible to recover. In the field of augmented reality, simulating this natural effect of showing sharp objects in combination with blurred objects increases the visual realism of augmented video. In order to simulate this effect, it is very important to capture all objects in the scene with high quality so that it could be possible to dynamically blur different objects in the scene at runtime. In this paper, we present an algorithm to find a set of possible complex-amplitude transmittance masks capable of considerably reducing the impact of focus errors in the scene objects. Computer simulations are used to compare the masks found in this paper with a classic mask in the state of the art. The main contribution of this paper is the use of Chebyshev polynomials to model an optical mask, and then, use artificial intelligence to establish some properties of this mask, such as the depth of field, the resolution, and the amount of gathered light.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".