2016
DOI: 10.1364/oe.24.015897
|View full text |Cite
|
Sign up to set email alerts
|

Simultaneous algebraic reconstruction technique based on guided image filtering

Abstract: The challenge of computed tomography is to reconstruct high-quality images from few-view projections. Using a prior guidance image, guided image filtering smoothes images while preserving edge features. The prior guidance image can be incorporated into the image reconstruction process to improve image quality. We propose a new simultaneous algebraic reconstruction technique based on guided image filtering. Specifically, the prior guidance image is updated in the image reconstruction process, merging informatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
21
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 25 publications
(21 citation statements)
references
References 23 publications
0
21
0
Order By: Relevance
“…When there is no statistical noise, the image (f) that was reconstructed using this algorithm converges to the weighted least-squares solution of min f Af À g k k, where A and g denote the system matrix and projection data, respectively. 17 The SART algorithm updates an image at pixel j, and each iteration n (f n j ), as…”
Section: A Image Reconstructionmentioning
confidence: 99%
See 2 more Smart Citations
“…When there is no statistical noise, the image (f) that was reconstructed using this algorithm converges to the weighted least-squares solution of min f Af À g k k, where A and g denote the system matrix and projection data, respectively. 17 The SART algorithm updates an image at pixel j, and each iteration n (f n j ), as…”
Section: A Image Reconstructionmentioning
confidence: 99%
“…0. 17 For TV minimization, the gradient descent method 22 was applied on f nþ1 j , as shown in Eq. (3):…”
Section: A Image Reconstructionmentioning
confidence: 99%
See 1 more Smart Citation
“…The empirical-knowledge based methods can utilize the known information (e.g., the boundary, shape, density range and the sparsity) of an object to formulate the reconstruction model, such as the total variation (TV) based reconstruction algorithm [23], tensor based reconstruction algorithm [24], low-rank based reconstruction algorithm [25], and so on. The prior-image knowledge based methods explore both image sparsity and similarity by utilizing the high-quality prior images, e.g., the dictionary learning based reconstruction algorithm [26], the prior image constrained compressed sensing (PICCS) algorithm [27], and the guided image filtering (GIF) [28] based simultaneous algebraic reconstruction technique algorithm [29]. The IR methods have the excellent performance for the few-projection CT reconstruction, however, they often require large memory space for very large computational tasks, and they also take a long execution time (typically costing tens of minutes and even a few hours for one CT).…”
Section: Introductionmentioning
confidence: 99%
“…Although SART algorithms can improve the signal-to-noise ratio of the output images, these methods usually have a heavy computing burden and always lead to oversmoothed output images. These limitations of analytic CT algorithms and iterative algorithms usually degrade the image resolution of clinical CT data, and noisy low-resolution (LR) images may result in misdiagnosis 3,4 . Therefore, the utilization of super resolution (SR) based on dictionary learning and sparse representation is necessary to obtain high-resolution (HR) images and avoid excessive smoothing.…”
Section: Introductionmentioning
confidence: 99%