Rain removal via shrinkage of sparse codes and learned rain dictionary
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, sparse coding and dictionary learning have been widely used for feature learning and image processing. They can also be applied to the rain removal by learning two types of rain and non-rain dictionaries, and then forcing the sparse codes of the rain dictionary to be zero vectors. However, this approach can generate edge artifacts that appear in the non-rain regions, especially around the edges of objects. Based on this observation, a new approach of shrinking the sparse codes is presented in the paper. To effectively shrink the sparse codes in the rain and non-rain regions, an error map between the input rain image and the reconstructed rain image with the learned rain dictionary is generated. Based on this error map, the sparse codes of the rain and non-rain dictionaries are used together to represent the image structures of objects and avoid the edge artifacts in the non-rain regions. In the rain regions, the correlation matrix between the rain and non-rain dictionaries is calculated and then the sparse codes corresponding to the highly correlated signal-atoms between the rain and non-rain dictionaries are shrunk together to improve the removal of the rain structures. The experimental results show that the proposed approach using the shrinkage of the sparse codes can preserve image structures and avoid the edge artifacts in the non-rain regions, while removing the rain structures in the rain regions.
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.000 |
| Open science | 0.000 | 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