Reducing streak artifacts in computed tomography via sparse representation in coupled dictionaries
Bibliographic record
Abstract
PURPOSE: Reducing the number of acquired projections is a simple and efficient way to reduce the radiation dose in computed tomography (CT). Unfortunately, this results in streak artifacts in the reconstructed images that can significantly reduce their diagnostic value. This paper presents a novel algorithm for suppressing these artifacts in 3D CT. METHODS: The proposed algorithm is based on the sparse representation of small blocks of 3D CT images in learned overcomplete dictionaries. It learns two dictionaries, the first dictionary (D(a)) is for artifact-full images that have been reconstructed from a small number (approximately 100) of projections. The other dictionary (D(c)) is for clean artifact-free images. The core idea behind the proposed algorithm is to relate the representation coefficients of an artifact-full block in D(a) to the representation coefficients of the corresponding artifact-free block in D(c). The relation between these coefficients is modeled with a linear mapping. The two dictionaries and the linear relation between the coefficients are learned simultaneously from the training data. To remove the artifacts from a test image, small blocks are extracted from this image and their sparse representation is computed in D(a). The linear map is then used to compute the corresponding coefficients in D(c), which are then used to produce the artifact-suppressed blocks. RESULTS: The authors apply the proposed algorithm on real cone-beam CT images. Their results show that the proposed algorithm can effectively suppress the artifacts and substantially improve the quality of the reconstructed images. The images produced by the proposed algorithm have a higher quality than the images reconstructed by the FDK algorithm from twice as many projections. CONCLUSIONS: The proposed sparsity-based algorithm can be a valuable tool for postprocessing of CT images reconstructed from a small number of projections. Therefore, it has the potential to be an effective tool for low-dose CT.
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 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.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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".