Storage-efficient quasi-Newton algorithms for image super-resolution
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Multiframe image super-resolution algorithms can be used to obtain a higher-resolution higher-quality image from a set of low-resolution, blurred, and noisy images. Very often, these algorithms rely on an optimization-based inversion of the image acquisition model. Recently, two algorithms for grayscale and hybrid demosaicing and color super-resolution have been proposed by Farsiu et al. These algorithms are of practical interest because they are fast and also they can overcome mismatches in the assumed acquisition model. However, they rely on the use of steepest-descent minimization which is inefficient in highly nonlinear and ill-conditioned problems like super-resolution. In this paper, we use two storage-efficient quasi-Newton algorithms, the memoryless and the limited-memory BFGS algorithms, to improve the performance of the super-resolution approaches proposed by Farsiu et al.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| 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.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it