coefficient sparsity in wavelet domains for limited-angle CT image reconstruction can be
found in [21–23]. In our work, we focus the regularization in the image domain just as TV reg-
ularization done. Thus, the TVM based reconstruction results are compared with our results.
In recent years, a novel regularization method based on the ℓ
0
-norm of image gradient has
been applied in the image smoothing [24], image segmentation [25], image super-resolution
and blur deconvolution [26], visual enhancement [27], disparity and optical flow partitioning
[28]. Different from the ℓ
0
-norm of image u,||u||
0
, which is the number of its non-zero coeffi-
cients, the ℓ
0
-norm of image gradient is denoted as
jjrujj
0
¼
X
p
#fpjj@
x
u
p
jþj@
y
u
p
j 6¼ 0g; ð2Þ
where the gradient of 2D image at the pixel point p is denoted as ru
p
=(@
x
u
p
,@
y
u
p
)
T
, @
x
u
p
and
@
y
u
p
represent the differences in x direction and in y direction respectively. #{} is counting
operator, counting the number of p that satisfies |@
x
u
p
|+|@
y
u
p
|6¼0. As the ℓ
0
-norm of image gra-
dient does not count on gradient magnitude, the large gradient magnitudes will not be penal-
ized, thus the edge can be effectively retained [24].
To better preserve the edges and suppress the artifacts to limited-angle CT image recon-
struction, we developed an alternating iterative reconstruction algorithm for limited-angle CT
based on ℓ
0
gradient minimization. In this paper, different from the ℓ
1
-norm of the image gra-
dient magnitude mentioned above, the ℓ
0
-norm of image gradient was taken as the regulariza-
tion function of the new optimization problem. We converted the optimization problem into a
few sub-problems, and solved these problems alternately. From the experimental results, it is
shown that by the developed algorithm the streak artifacts and gradual changed artifacts
nearby edges can be effectively reduced.
The rest of the paper is organized as follows. In section Method, our reconstruction algorithm
for limited-angle tomography is described, together with an efficient numerical scheme. More-
over, the performance evaluations are also outlined in this section. In the following section,
experimental results and discussion are presented and conclusions are given in final section.
Method
The fan-beam X-ray CT has been widely used in medical diagnosis, which will be the scanning
geometry that we focus in this paper. Fig 1 shows the scanning geometry configuration for cir-
cular and limited-angle fan-beam CT. For limited-angle tomography, in this paper, the scan-
ning angular range is limited within [0,θ], where θ is the maximum rotation angle of the X-ray
source, usually less than 180°.
As described in detail in S1 Appendix, we approximate the CT imaging model as following
discrete linear system [11]:
Au ¼ g ð3Þ
where u is the unknown object to be reconstructed, g is the measured projection data, A is the
system matrix which represents the forward projection.
In some practical CT imaging, when projection data are incomplete, the system Eq (3) is
underdetermined. To find the solution to this problem, we usually need to acquire the optimal
solution u
satisfying the optimization problem in the following form [29]:
u
¼ min
u
FðuÞ :¼ DðuÞþl C ðuÞ: ð4Þ
where D(u) is data fidelity term; C(u) represents the regularization term; λ is the penalty
parameter.
ℓ
0
Gradient Based Image Reconstruction for Limited-Angle Tomography
PLOS ONE | DOI:10.1371/journal.pone.0130793 July 9, 2015 3/15