Towards Low-Cost Learning-based Camera ISP via Unrolled Optimization
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
Recently, learning-based image signal processor (ISP) pipelines modeled using convolutional neural networks (CNNs) have been able to provide higher quality images over traditional model-based ISPs at the expense of significant memory, energy, and computation overhead. We propose an unrolled optimization network that models the ISP pipeline with considerably lower number of parameters and computation overhead. The unrolled optimization solves the image reconstruction problem of the ISP by leveraging both model-based and learning-based methods. In the proposed ISP model, the image formation operators namely, blur kernels and sensor sampling functions are formulated with learnable parameters such that the physical constraints are respected during conventional training. A CNN that is shared across the iterations of the unrolled model plays the role of the prior and performs denoising. An efficient tone mapper network is also utilized to further improve the quality of the resulting images. The entire pipeline is then trained in an end-to-end fashion using perceptual loss. The proposed ISP has over <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{34}\times$</tex> fewer parameters in comparison to the state-of-the art deep ISPs.
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.001 |
| 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