A logarithm-based image denoising method for a mixture of Gaussian white noise and signal dependent noise
Bibliographic record
Abstract
Noise reduction is a very important topic in image processing. In this paper, we present a novel method for reducing noise in an image corrupted by a mixture of Gaussian white noise and signal dependent noise. Our method can be built from any existing denoising methods. The main steps of our method can be described as follows: (a) reduce noise from the input noisy image, (b) take the logarithm of the denoised image, (c) reduce noise from the logarithm image, and (d) transform this noise-reduced logarithm image back to the original space. We conduct experiments for seven gray scale images and we find that our method is always better than the method that it was built up from in term of peak signal to noise ratio (PSNR). However, our method is comparable to total least square (TLS) method, which is specifically designed for reducing signal dependent noise. The PSNR’s of our method are sometimes higher and sometimes lower than those of the TLS method. Nevertheless, our method is much faster than the TLS method in CPU computation time.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".