Computerized Tomography with Total Variation and with Shearlets
August 23, 2016 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Edgar GarduΓ±o, Gabor T. Herman
arXiv ID
1608.06668
Category
physics.med-ph
Cross-listed
cs.CV
Citations
22
Venue
arXiv.org
Last Checked
3 months ago
Abstract
To reduce the x-ray dose in computerized tomography (CT), many constrained optimization approaches have been proposed aiming at minimizing a regularizing function that measures lack of consistency with some prior knowledge about the object that is being imaged, subject to a (predetermined) level of consistency with the detected attenuation of x-rays. Proponents of the shearlet transform in the regularizing function claim that the reconstructions so obtained are better than those produced using TV for texture preservation (but may be worse for noise reduction). In this paper we report results related to this claim. In our reported experiments using simulated CT data collection of the head, reconstructions whose shearlet transform has a small $\ell_1$-norm are not more efficacious than reconstructions that have a small TV value. Our experiments for making such comparisons use the recently-developed superiorization methodology for both regularizing functions. Superiorization is an automated procedure for turning an iterative algorithm for producing images that satisfy a primary criterion (such as consistency with the observed measurements) into its superiorized version that will produce results that, according to the primary criterion are as good as those produced by the original algorithm, but in addition are superior to them according to a secondary (regularizing) criterion. The method presented for superiorization involving the $\ell_1$-norm of the shearlet transform is novel and is quite general: It can be used for any regularizing function that is defined as the $\ell_1$-norm of a transform specified by the application of a matrix. Because in the previous literature the split Bregman algorithm is used for similar purposes, a section is included comparing the results of the superiorization algorithm with the split Bregman algorithm.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.med-ph
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Gibbs-Ringing Artifact Removal Based on Local Subvoxel-shifts
R.I.P.
π»
Ghosted
Deep Learning-enabled Virtual Histological Staining of Biological Samples
R.I.P.
π»
Ghosted
Eigenspectra optoacoustic tomography achieves quantitative blood oxygenation imaging deep in tissues
π
π
The Cartographer
Deep learning for biomedical photoacoustic imaging: A review
R.I.P.
π»
Ghosted
The reliability of a deep learning model in clinical out-of-distribution MRI data: a multicohort study
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Neural Architecture Search with Reinforcement Learning
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted