2015
DOI: 10.1016/j.compbiomed.2015.03.003
|View full text |Cite
|
Sign up to set email alerts
|

Median prior constrained TV algorithm for sparse view low-dose CT reconstruction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 29 publications
(13 citation statements)
references
References 26 publications
0
13
0
Order By: Relevance
“…A high‐accuracy system matrix G is important for CT image reconstruction. G could be determined by many methods (Turkington, ; Liu et al, ), e.g., the view‐of‐view method presented by Vardi et al (), and the Monte Carlo (MC) method presented by Veklerov et al (). Since the research focus of this article is not the system matrix G , we choose the linear distance method to compute the system matrix (Liu et al, ).…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…A high‐accuracy system matrix G is important for CT image reconstruction. G could be determined by many methods (Turkington, ; Liu et al, ), e.g., the view‐of‐view method presented by Vardi et al (), and the Monte Carlo (MC) method presented by Veklerov et al (). Since the research focus of this article is not the system matrix G , we choose the linear distance method to compute the system matrix (Liu et al, ).…”
Section: Methodsmentioning
confidence: 99%
“…One type of commonly used regularization is the MRF‐based penalty (Zhang et al, ), which penalizes the differences among local neighboring pixels but tends to achieve undesirable oversmoothing at the edge regions. In order to address this drawback, several edge‐preserving regularizations (Liu et al, ; Liu et al, ) were utilized later, such as the Huber prior, in which the penalty function is nonquadratic, and the median prior, which only relies on the properties of the local pixel region (Kontaxakis et al, ; Yan and Yu, ).…”
Section: Introductionmentioning
confidence: 99%
“…The Proposed Algorithm 1: Initialize parameters, tol = 10 −6 , A as the known CT system matrix, ψ as the known sparse representation matrix, 2: Set h 0 is a Dirac delta function 3: Input the known noisy projection data P 4: for each iteration do 5: while h(l + 1) − h(l) / h(l) > tol do 6: Calculatingx according to (9) 7: CalculatingV according to (14) 8: Calculatingf according tof = g(x) V 9: Sampling h according to (18) and (19) with a Gibbs method [24] 10: end while 11: end for 12: return To reconstruct CT image with far fewer projection data, a compressed sensing image reconstruction algorithm including a blind image restoration process was proposed. Image reconstruction is achieved by estimating a sparse coefficient vector.…”
Section: Of 15mentioning
confidence: 99%
“…The simulation was performed at 80 kV, and the corresponding spectrum ( Fig. 3) was divided into six energy bins: [20,30] keV, [30,40] keV, [40,50] keV, [50,60]…”
Section: Digital Circle Phantom-mentioning
confidence: 99%
“…Compressed sensing has recently been evaluated by several groups for spectral CT reconstruction from noisy and incomplete measurement [15,18,28,[35][36][37][38][39][40]. The key for the success of CS is the use of the sparse transform guided by prior information.…”
Section: Introductionmentioning
confidence: 99%