Sparse-view statistical image reconstruction with improved total variation regularization for X-ray micro-CT imaging
Bibliographic record
Abstract
Sparse-view x-ray micro computed tomography (micro-CT) reconstruction algorithms via total variation (TV) optimize the data without introducing notable noise and artifacts, resulting in significant scanning time reduction while maintaining image quality. However, due to the piecewise constant assumption for the image, a conventional TV minimization often suffers from patchy artifacts in reconstructed images. Moreover, for lack of directional gradient in TV some directional information are lost. To obviate these drawbacks, in this study we develop a penalized weighted least-square (PWLS) strategy for micro-CT sparse-view image reconstruction by incorporating an adaptive weighted total variation in combination with an adaptive weighted diagonal total variation (AwTV+AwDTV) penalty term. The AwTV considers the vertical and horizontal gradients while the AwDTV uses the diagonal gradients. The associated weights which are defined based on the anisotropic edge properties of an image, are expressed as an exponential function and can be adaptively adjusted by the amount of the difference between voxel intensities to preserve the edge details. To evaluate the presented (AwTV+AwDTV)-PWLS algorithm, both qualitative and quantitative studies were performed by computer simulations and micro-CT data experiments. The Shepp-Logan phantom for computer simulation and the micro-CT water phantom and a rat skull for micro-CT experiments are employed to perform image reconstruction. To evaluate the performance of AwTV+AwDTV algorithm, we compared it with TV and AwTV reconstruction algorithms. The simulation results show that the presented (AwTV+AwDTV)-PWLS algorithm can achieve the lowest RMSE and highest PSNR, SSIM and MTF for different number of projections as compared to the AwTV and conventional TV algorithms. The micro-CT data results confirmed the superiority of the proposed (AwTV+AwDTV) method to the AwTV and TV methods for different number of projections.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".