Gradient-based Optimization Algorithm for Hybrid Loss Function in Low-dose CT Denoising
Bibliographic record
Abstract
Deep learning techniques have emerged in de-noising low-dose computed tomography (CT) images to avoid the potential health risks of high ionizing radiation dose on patients. Although these post-processing methods display high quality denoised images, the denoising performance still has the potential to improve. The primary purpose of this work was to determine and analyze the most effective and efficient hybrid loss function in deep learning (DL)-based denoising network. Objective functions in deep learning algorithms are the main keys for optimizing the parameters of a network and can affect the quality of the denoised image significantly. Hence, this work examined the various combinations of the most common objective functions in CT denoising networks, namely L1 loss, per-pixel loss, perceptual loss, and structural dissimilarity loss. Further, a hyperparameter learning algorithm was also introduced to find the best scalable factors of the loss functions in each hybrid loss function combination. For simplic-ity, RED-CNN was used in this study to easily demonstrate the performance of the losses during the denoising process. Based on this experiment, the balance between these loss function via the gradient-based optimization algorithm could help in the generalizability prediction of designing future CT denoising networks.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| 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.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".