# An Improved Total Variation Minimization Method Using Prior Images and Split-Bregman Method in CT Reconstruction

Authors: Luzhen Deng; Peng Feng; Mianyi Chen; Peng He; Biao Wei
Journal: BioMed Research International
 (2016)

---

## Abstract

Compressive Sensing (CS) theory has great potential for reconstructing Computed Tomography (CT) images from sparse-views projection data and Total Variation- (TV-) based CT reconstruction method is very popular. However, it does not directly incorporate prior images into the reconstruction. To improve the quality of reconstructed images, this paper proposed an improved TV minimization method using prior images and Split-Bregman method in CT reconstruction, which uses prior images to obtain valuable previous information and promote the subsequent imaging process. The images obtained asynchronously were registered via Locally Linear Embedding (LLE). To validate the method, two studies were performed. Numerical simulation using an abdomen phantom has been used to demonstrate that the proposed method enables accurate reconstruction of image objects under sparse projection data. A real dataset was used to further validate the method.


---

## Body

## 1. Introduction

Research on how to reduce Computed Tomography (CT) scanning dose of patients while the image quality is not deteriorated has very important significance not only in theory but also in practical applications [1]. The dose depends on the number of projections, tube voltage, tube current and tube current-exposure time product, X-ray filters, organ shields, and so on. In our study we assume that other factors are fixed during the scanning, except the number of projections. Comparing with traditional CT reconstruction approaches [2–4], algorithms based on Compressive Sensing (CS) [5–10] are more popular with the conditions of incomplete projections. But they still can be improved by bringing in prior images.Generally, patients are not scanned only once; repeating CT scans contained some same structural information. Normally, the information embedded in previous scanning is called prior knowledge which is valuable for reconstructing better images with low-dose in the following CT scanning [11–15]. The same object can be scanned at different time to monitor the changes of the object. At the first time the object should be scanned with normal views to produce CT images with high quality. Then the subsequent scanning will be carried out under the low-dose circumstance, that is, few-views projections. As the previous normal-dose scans and low-dose scan are not performed simultaneously or even not with the same scanner, the prior images and reconstructed images cannot be utilized directly because of rigid or nonrigid object motion and other differences among these scans. Registration is necessary and how to register them is a huge challenge.In this paper, we propose an improved Total Variation (TV) minimization method using prior images and Split-Bregman [16] method in CT reconstruction (PISPTV) which tries to take fully advantage of prior images in order to get high-quality CT images with the conditions of incomplete projections. The images obtained asynchronously are registered via Locally Linear Embedding (LLE) and Split-Bregman method is used to solve the optimization problems. We introduce the proposed algorithm in the next section, show the results in the third section, and conclude the paper in the last section.


## 2. Theory and Method

### 2.1. CS-Based CT Reconstruction

For CT reconstruction algorithm based on CS, TV algorithm which is proposed by Sidky and Pan [6] is popular. Briefly, it can be defined as(1)min⁡f→TV,s.t.Af→-p→22<σ2,where f→ is the reconstructed image, A is the projection matrix, p→ is the projection data, σ is permissible error, and the TV of f→, that is, f→TV, is(2)f→TV=∑∇f→=∑i,j∇xf→2+∇yf→2,where ∇f→ represents gradient operator of an image f→, ∇xf→=fi,j-fi-1,j, ∇yf→=fi,j-fi,j-1, fi,j is a pixel value of f→, and i and j stand for x-coordinate and y-coordinate, respectively.


### 2.2. Proposed Algorithm

We propose an improved TV minimization method using prior images and Split-Bregman [16] method which can be defined as follows:(3)min⁡f→TV+μJPIf→,f→PI,s.t.Af→-p→22<σ2,where f→PI represents a prior image obtained by a conventional algorithm such as Algebraic Reconstruction Technique (ART) [3] from previous normal-view projections and (4)JPIf→,f→PI=∑twtf→-f→PIt22,where t represents the number of prior images and (5)wt=exp⁡-f→-f→PIt22h2,where h is the parameter to control the sensitivity.Split-Bregman method is used to solve (3); it contains three iteration steps.Step 1.
Consider the following:(6)f→k+1=arg⁡minf⁡λAf→-p→22+μ∑twtf→-f→PIt22+γd→k-∇f→-b→k22.Step 2.
Consider the following:(7)d→k+1=mind⁡d→1+γd→k-∇f→k+1-b→k22.Step 3.
(8) b → k + 1 = b → k + ∇ f → k + 1 - d → k + 1 ,where k is the iteration index of Split-Bregman method, λ, μ, and γ are tuning parameters, and d→ and b→ are intermediate variables.Equation (6) is solved by the steepest descent method [17] and the derivative of (6) is(9)g→k,m+1=2λA→mTA→mf→m-pm+2μ∑twtf→m-f→PIt-2γ∇Td→k-∇f→m-b→k,f→m+1=f→m+αdng⌢k,m+1,where m=2,…,M denotes the projection angles, A→mT is the transposition of A→m which is mth row vector of A=(A→1,A→2,…,A→M), p→=(p1,p2,…,pM), α is an appropriate step size, d(n) is gradient descent scaling parameter of PISPTV, g⌢k,m is the normalized g→[k,m], and their relationship is g⌢[k,m]=g→[k,m]/g→[k,m]2.The ART method is used to get initial image of iteration. Equation (7) can be computed as (10) using the shrinkage operator:(10)d→k+1=shrink∇f→k+1+b→k,1γ.


### 2.3. Calibration with LLE

Prior images are obtained by ART-TV algorithm from previous normal-view projections. Because the previous normal-dose scans and low-dose scan are not acquired simultaneously or even not scanned using the same scanner, the reconstructed imagesf→ and f→PI(t) generally are not the same because of rigid or nonrigid object motion and other differences among these scans. In practice we need to register these reconstructed images before further processing, and X-ray CT Geometrical Calibration via Locally Linear Embedding (LLE) which was provided by Chen et al. [18] can be used. In this method, an important step is to calculate the projection matrix which is affected by the geometric parameters; that is,(11)A=AD→,where D→ is a parameter vector containing source-object distance, object-detector distance and detector offset distance, detector tilt angle, projection angle, and so on. The geometric parameters are estimated by the following equation:(12)D→=argminp→-p→~s22,s.t.AD→f→=p→s.p → is the measured projection data, and p→~s(s=1,2,…,S) is the corresponding reprojection data during CT reconstruction. S is the number of reprojections. The geometric calibration problem is solved by dimensionality reduction via LLE. Specifically, the LLE consists of three steps.Step 1.
Consider the following:(13)cr=p→-p→~rTp→-p→~r.Step 2.
Consider the following:(14)∑rcrwr=1.Step 3.
(15) D → = ∑ r = 1 R w r D → ~ r ,where C=cr is the local covariance vector, p→~r are the R nearest reprojection vectors associated with the corresponding R vectors of parameters D→~r(D→~r=(dr1,dr2,…,drR) is a densely sampled parametric range), and wr are weight coefficients. The R nearest neighbors are determined by Euclidean distance p→-p→~s22. The relationship between p→~r and p→ is p→=∑r=1Rwrp→~r. The weight coefficients here are the same at that for (15). Therefore, the real parameter estimation can be refined by searching for the R nearest reprojected projection vectors and updating the parameter vector with the weight coefficients and the corresponding sampled parameters.


### 2.4. Implementation of Proposed Algorithm

Specifically, our method is flowcharted in Figure1 and the implementation steps of our proposed algorithm which is shown in Algorithm 1 contain two loops; the outside loop operates ART which is labeled by n and the total number of outside iterations is Niter. The inside loop operates PISPTV which is labeled by k and the total number of inside iterations is K. f→PI is a prior image obtained by a conventional algorithm such as ART and ART-TV from previous normal-view projections. The prior images are registered via LLE, respectively (the estimated parameter vectors are obtained via LLE before). D→ is an estimated parameter vector obtained by LLE and it is used to register this reconstructed image.Algorithm 1:Implementation steps of PISPTV reconstruction.
% Initialization GivenM, A→m(m=2,…,M), pm(m=2,…,M), D→=d1,d2,…,dr, λ, μ, γ, α, σ, h, K, I, J, Niter, f → P I ( t )   ( t = 1 , … , T ) and f→0=0; % Main iteration loop % ART Updating forn=1,2,…,Niter do f→n,0=f→n-1 form=2,…,M do A→m-1=A→m-1(D→) f→n,m=f→n,m-1+λ⋅A→m-1pm-1-A→m-1⋅f→n,m-1A→m-1⋅A→m-1 end fi,jn=fi,jn,Mfi,jn,M≥00fi,jn,M<0 % PISPTV d(n)=f→n-1-f→n,b→0=0,d→0=∇f→n fort=1,…,T do wt=exp⁡-f→n-f→PI(t)22h2 end f→n,1,1=f→n fork=1,2,…,K do form=2,…,M do g→k,m=2λAm-1TAm-1f→n,k,m-1-p→m-1 +2μ∑twtf→n,k,m-1-f→PIt -2γ∇Td→k-∇f→n,k,m-1-b→k g⌢k,m=g→k,m/g→k,m2 f→n,k,m=f→n,k,m-1-αdng⌢k,m end fi,jn,k,1=fi,jn,k,Mfi,jn,k,M≥00fi,jn,k,M<0 d→k=shrink∇f→n,k,1+b→k-1,1γ b→k=b→k-1+∇f→n,k,1-d→k end % Image Updating f→n+1=f→n,K,1 % Exit Criterion ifAf→-p→22<σ2 then exit end endFigure 1
Flowchart for PISPTV reconstruction.


## 2.1. CS-Based CT Reconstruction

For CT reconstruction algorithm based on CS, TV algorithm which is proposed by Sidky and Pan [6] is popular. Briefly, it can be defined as(1)min⁡f→TV,s.t.Af→-p→22<σ2,where f→ is the reconstructed image, A is the projection matrix, p→ is the projection data, σ is permissible error, and the TV of f→, that is, f→TV, is(2)f→TV=∑∇f→=∑i,j∇xf→2+∇yf→2,where ∇f→ represents gradient operator of an image f→, ∇xf→=fi,j-fi-1,j, ∇yf→=fi,j-fi,j-1, fi,j is a pixel value of f→, and i and j stand for x-coordinate and y-coordinate, respectively.


## 2.2. Proposed Algorithm

We propose an improved TV minimization method using prior images and Split-Bregman [16] method which can be defined as follows:(3)min⁡f→TV+μJPIf→,f→PI,s.t.Af→-p→22<σ2,where f→PI represents a prior image obtained by a conventional algorithm such as Algebraic Reconstruction Technique (ART) [3] from previous normal-view projections and (4)JPIf→,f→PI=∑twtf→-f→PIt22,where t represents the number of prior images and (5)wt=exp⁡-f→-f→PIt22h2,where h is the parameter to control the sensitivity.Split-Bregman method is used to solve (3); it contains three iteration steps.Step 1.
Consider the following:(6)f→k+1=arg⁡minf⁡λAf→-p→22+μ∑twtf→-f→PIt22+γd→k-∇f→-b→k22.Step 2.
Consider the following:(7)d→k+1=mind⁡d→1+γd→k-∇f→k+1-b→k22.Step 3.
(8) b → k + 1 = b → k + ∇ f → k + 1 - d → k + 1 ,where k is the iteration index of Split-Bregman method, λ, μ, and γ are tuning parameters, and d→ and b→ are intermediate variables.Equation (6) is solved by the steepest descent method [17] and the derivative of (6) is(9)g→k,m+1=2λA→mTA→mf→m-pm+2μ∑twtf→m-f→PIt-2γ∇Td→k-∇f→m-b→k,f→m+1=f→m+αdng⌢k,m+1,where m=2,…,M denotes the projection angles, A→mT is the transposition of A→m which is mth row vector of A=(A→1,A→2,…,A→M), p→=(p1,p2,…,pM), α is an appropriate step size, d(n) is gradient descent scaling parameter of PISPTV, g⌢k,m is the normalized g→[k,m], and their relationship is g⌢[k,m]=g→[k,m]/g→[k,m]2.The ART method is used to get initial image of iteration. Equation (7) can be computed as (10) using the shrinkage operator:(10)d→k+1=shrink∇f→k+1+b→k,1γ.


## 2.3. Calibration with LLE

Prior images are obtained by ART-TV algorithm from previous normal-view projections. Because the previous normal-dose scans and low-dose scan are not acquired simultaneously or even not scanned using the same scanner, the reconstructed imagesf→ and f→PI(t) generally are not the same because of rigid or nonrigid object motion and other differences among these scans. In practice we need to register these reconstructed images before further processing, and X-ray CT Geometrical Calibration via Locally Linear Embedding (LLE) which was provided by Chen et al. [18] can be used. In this method, an important step is to calculate the projection matrix which is affected by the geometric parameters; that is,(11)A=AD→,where D→ is a parameter vector containing source-object distance, object-detector distance and detector offset distance, detector tilt angle, projection angle, and so on. The geometric parameters are estimated by the following equation:(12)D→=argminp→-p→~s22,s.t.AD→f→=p→s.p → is the measured projection data, and p→~s(s=1,2,…,S) is the corresponding reprojection data during CT reconstruction. S is the number of reprojections. The geometric calibration problem is solved by dimensionality reduction via LLE. Specifically, the LLE consists of three steps.Step 1.
Consider the following:(13)cr=p→-p→~rTp→-p→~r.Step 2.
Consider the following:(14)∑rcrwr=1.Step 3.
(15) D → = ∑ r = 1 R w r D → ~ r ,where C=cr is the local covariance vector, p→~r are the R nearest reprojection vectors associated with the corresponding R vectors of parameters D→~r(D→~r=(dr1,dr2,…,drR) is a densely sampled parametric range), and wr are weight coefficients. The R nearest neighbors are determined by Euclidean distance p→-p→~s22. The relationship between p→~r and p→ is p→=∑r=1Rwrp→~r. The weight coefficients here are the same at that for (15). Therefore, the real parameter estimation can be refined by searching for the R nearest reprojected projection vectors and updating the parameter vector with the weight coefficients and the corresponding sampled parameters.


## 2.4. Implementation of Proposed Algorithm

Specifically, our method is flowcharted in Figure1 and the implementation steps of our proposed algorithm which is shown in Algorithm 1 contain two loops; the outside loop operates ART which is labeled by n and the total number of outside iterations is Niter. The inside loop operates PISPTV which is labeled by k and the total number of inside iterations is K. f→PI is a prior image obtained by a conventional algorithm such as ART and ART-TV from previous normal-view projections. The prior images are registered via LLE, respectively (the estimated parameter vectors are obtained via LLE before). D→ is an estimated parameter vector obtained by LLE and it is used to register this reconstructed image.Algorithm 1:Implementation steps of PISPTV reconstruction.
% Initialization GivenM, A→m(m=2,…,M), pm(m=2,…,M), D→=d1,d2,…,dr, λ, μ, γ, α, σ, h, K, I, J, Niter, f → P I ( t )   ( t = 1 , … , T ) and f→0=0; % Main iteration loop % ART Updating forn=1,2,…,Niter do f→n,0=f→n-1 form=2,…,M do A→m-1=A→m-1(D→) f→n,m=f→n,m-1+λ⋅A→m-1pm-1-A→m-1⋅f→n,m-1A→m-1⋅A→m-1 end fi,jn=fi,jn,Mfi,jn,M≥00fi,jn,M<0 % PISPTV d(n)=f→n-1-f→n,b→0=0,d→0=∇f→n fort=1,…,T do wt=exp⁡-f→n-f→PI(t)22h2 end f→n,1,1=f→n fork=1,2,…,K do form=2,…,M do g→k,m=2λAm-1TAm-1f→n,k,m-1-p→m-1 +2μ∑twtf→n,k,m-1-f→PIt -2γ∇Td→k-∇f→n,k,m-1-b→k g⌢k,m=g→k,m/g→k,m2 f→n,k,m=f→n,k,m-1-αdng⌢k,m end fi,jn,k,1=fi,jn,k,Mfi,jn,k,M≥00fi,jn,k,M<0 d→k=shrink∇f→n,k,1+b→k-1,1γ b→k=b→k-1+∇f→n,k,1-d→k end % Image Updating f→n+1=f→n,K,1 % Exit Criterion ifAf→-p→22<σ2 then exit end endFigure 1
Flowchart for PISPTV reconstruction.


## 3. Simulation and Experiment

To evaluate the performance of our proposed algorithm, the numerical and experimental datasets were used. The ART-TV and our proposed algorithm (PISPTV) were used for comparison. For fairness, both of them were implemented using the Split-Bregman technique. In our study, we selectedα=0.15, λ=100, μ=50, and γ=800. Image quality was assessed with the relative Root Mean Square Errors (RMSE) and Structure Similarity (SSIM) [19].RMSE is the most widely way applied to evaluate image quality, and it is defined as(16)RMSE=1I×J∑0≤i<I∑0≤j<Jfi,j-fi,j∗2,where fi,j is the pixel value of original image f→ and fi,j∗ is the pixel value of reconstructed image f→∗.SSIM is defined as(17)SSIM=lf→,f→∗δ·cf→,f→∗ς·vf→,f→∗η,where(18)lf→,f→∗=2f→-×f→-∗+c1f→-2+f→-∗2+c1cf→,f→∗=2σf→σf→∗+c2σf→2+σf→∗2+c2vf→,f→∗=σf→f→∗+c3σf→σf→∗+c3,where f→- and f→-∗ are the mean of f→ and f→∗, respectively. σf→ and σf→∗ are the variance of f→ and f→∗, respectively. σf→f→∗ is the covariance of f→ and f→∗. c1, c2, and c3 are small positive constants which are included to avoid instability when denominator in (18) is very close to zero. δ, ς,  and η are used to adjust the weight of luminance l(f→,f→∗), contrast c(f→,f→∗), and structures v(f→,f→∗). In our study, we selected δ=ς=η=1, c1=2×10-8, c2=1×10-8, and c3=c2/2=5×10-7.The value of SSIM is between −1 and 1. When two images are the same, the SSIM between them is 1.


### 3.1. Simulation Study

In this study, an abdomen phantom as shown in Figure2 was used. The size of phantom image was 256 × 256. In order to reflect changes of projections in different scan, we added circular patches with different size in the phantom as shown in Figure 3 (their radii were 8 pixels, 10 pixels, and 12 pixels, resp.). The number of prior images was 2. In the first scanning, Figure 3(a) was reconstructed by ART-TV algorithm from 180 projections. In the second scanning, Figure 3(b) was reconstructed by ART-TV algorithm from 90 projections. In the current scanning, Figure 3(c) was reconstructed by PISPTV algorithm from 30 projections. We assumed they were registered in simulation study. The iteration numbers were 50; the reconstructed images are shown in Figure 4.Figure 2
Abdomen phantom.Figure 3
Different scanning abdomen phantoms.
(a)
First scanning abdomen phantom (b)
Second scanning abdomen phantom (c)
Current scanning abdomen phantomFigure 4
Reconstructed abdomen phantoms for comparison.It can be observed that the image reconstructed by PISPTV is visually much better than that by ART-TV. The differences between Figures4(a) and 4(d) are clearly identified, which means that PISPTV can produce high-quality image with much less streak artifacts than the ART-TV. Figures 4(c) and 4(f) are the difference images obtained by reconstructed image minus original image. We can see that the difference between f→PISPTV and f→original is much smaller than the difference between f→ART-TV and f→original.Furthermore, we zoom in one part of the reconstructed images as shown in Figure5. In order to enhance the contrast ratio, all images are shown in the window [0.3, 0.7] while the total grey value is between 0 and 1. We find f→PISPTV contains less artifacts, and the inner distribution near edge is more uniform than f→ART-TV.Figure 5
One magnified part of abdomen phantoms for comparison.
(a)
Original image (b)
ART-TV reconstruction (c)
PISPTV reconstructionTable1 lists the RMSE and SSIM calculated from reconstructed abdomen phantom with ART-TV and PISPTV. It is obvious that the RMSE of reconstructed image using PISPTV method is much smaller than that of reconstructed image using ART-TV method; the SSIM is much bigger. Thus PISPTV method can reconstruct image with higher quality.Table 1
RMSE and UQI of reconstruction images.
Methods Abdomen Real data ART-TV PISPTV ART-TV PISPTV RMSE 0.0303 0.0106 0.0414 0.0107 SSIM 0.9877 0.9985 0.9696 0.9971


### 3.2. Experimental Study

In this study, we tested our algorithms on a real dataset from a chip which was acquired by a Micro CT scanner (provided by Nuclear Technology Application Research Center, High Energy Physical Institute, Chinese Academy of Science). The tube was operated at 70 kV and 100 mA. Both the nominal source-object distance and object-detector distance were 38 cm, the number of detector elements was 1024, and the length of detector was 13.0048 cm. Both detector tilt angle and detector offset distance were zero. The calibrated rotation center offset was −0.3847 cm. The number of projection angles was 900 in the angular range[0,2π]. These parameters were used to register images. To demonstrate the performance of our proposed approach, we reduced the number of views to 100 which was about 1/9 of original projection number. And as shown in Figure 6(a), we evaluated the reconstructed image using ART-TV with 900-projection data as a standard image. The number of prior images was 3; they were images reconstructed previously by ART-TV algorithm from 900, 450, and 225 projections, respectively. The iteration numbers were 10, and the reconstructed images are shown in Figure 6.Figure 6
Reconstructed real images for comparison.
(a)
Standard image (b)
ART-TV reconstruction (c)
PISPTV reconstructionIn Figure6, it is clear that comparing to ART-TV, PISPTV has better performance. We zoom in one part of the reconstructed images as shown in Figure 7. In order to enhance the contrast ratio and see the artifacts problem, the images are shown in the window [0.01,0.1] while the total grey value is between 0 and 1. We find that the reconstructed image using ART-TV method contains more artifacts. The profiles of line 350 in different reconstructed real images are plotted in Figure 8. We can see that the ART-TV profile fluctuates larger than the PISPTV profile, which means that the PISPTV reconstruction is much closer to standard image. And as shown in Table 1, its RMSE is lower and SSIM is higher. These observations suggest that our method is powerful for sparse CT reconstruction data.Figure 7
One magnified part of reconstructed real images for comparison.
(a)
Standard image (b)
ART-TV reconstruction (c)
PISPTV reconstructionFigure 8
The profile of line 350 in different reconstructed real images.
(a)
ART-TV profile (b)
PISPTV profile


## 3.1. Simulation Study

In this study, an abdomen phantom as shown in Figure2 was used. The size of phantom image was 256 × 256. In order to reflect changes of projections in different scan, we added circular patches with different size in the phantom as shown in Figure 3 (their radii were 8 pixels, 10 pixels, and 12 pixels, resp.). The number of prior images was 2. In the first scanning, Figure 3(a) was reconstructed by ART-TV algorithm from 180 projections. In the second scanning, Figure 3(b) was reconstructed by ART-TV algorithm from 90 projections. In the current scanning, Figure 3(c) was reconstructed by PISPTV algorithm from 30 projections. We assumed they were registered in simulation study. The iteration numbers were 50; the reconstructed images are shown in Figure 4.Figure 2
Abdomen phantom.Figure 3
Different scanning abdomen phantoms.
(a)
First scanning abdomen phantom (b)
Second scanning abdomen phantom (c)
Current scanning abdomen phantomFigure 4
Reconstructed abdomen phantoms for comparison.It can be observed that the image reconstructed by PISPTV is visually much better than that by ART-TV. The differences between Figures4(a) and 4(d) are clearly identified, which means that PISPTV can produce high-quality image with much less streak artifacts than the ART-TV. Figures 4(c) and 4(f) are the difference images obtained by reconstructed image minus original image. We can see that the difference between f→PISPTV and f→original is much smaller than the difference between f→ART-TV and f→original.Furthermore, we zoom in one part of the reconstructed images as shown in Figure5. In order to enhance the contrast ratio, all images are shown in the window [0.3, 0.7] while the total grey value is between 0 and 1. We find f→PISPTV contains less artifacts, and the inner distribution near edge is more uniform than f→ART-TV.Figure 5
One magnified part of abdomen phantoms for comparison.
(a)
Original image (b)
ART-TV reconstruction (c)
PISPTV reconstructionTable1 lists the RMSE and SSIM calculated from reconstructed abdomen phantom with ART-TV and PISPTV. It is obvious that the RMSE of reconstructed image using PISPTV method is much smaller than that of reconstructed image using ART-TV method; the SSIM is much bigger. Thus PISPTV method can reconstruct image with higher quality.Table 1
RMSE and UQI of reconstruction images.
Methods Abdomen Real data ART-TV PISPTV ART-TV PISPTV RMSE 0.0303 0.0106 0.0414 0.0107 SSIM 0.9877 0.9985 0.9696 0.9971


## 3.2. Experimental Study

In this study, we tested our algorithms on a real dataset from a chip which was acquired by a Micro CT scanner (provided by Nuclear Technology Application Research Center, High Energy Physical Institute, Chinese Academy of Science). The tube was operated at 70 kV and 100 mA. Both the nominal source-object distance and object-detector distance were 38 cm, the number of detector elements was 1024, and the length of detector was 13.0048 cm. Both detector tilt angle and detector offset distance were zero. The calibrated rotation center offset was −0.3847 cm. The number of projection angles was 900 in the angular range[0,2π]. These parameters were used to register images. To demonstrate the performance of our proposed approach, we reduced the number of views to 100 which was about 1/9 of original projection number. And as shown in Figure 6(a), we evaluated the reconstructed image using ART-TV with 900-projection data as a standard image. The number of prior images was 3; they were images reconstructed previously by ART-TV algorithm from 900, 450, and 225 projections, respectively. The iteration numbers were 10, and the reconstructed images are shown in Figure 6.Figure 6
Reconstructed real images for comparison.
(a)
Standard image (b)
ART-TV reconstruction (c)
PISPTV reconstructionIn Figure6, it is clear that comparing to ART-TV, PISPTV has better performance. We zoom in one part of the reconstructed images as shown in Figure 7. In order to enhance the contrast ratio and see the artifacts problem, the images are shown in the window [0.01,0.1] while the total grey value is between 0 and 1. We find that the reconstructed image using ART-TV method contains more artifacts. The profiles of line 350 in different reconstructed real images are plotted in Figure 8. We can see that the ART-TV profile fluctuates larger than the PISPTV profile, which means that the PISPTV reconstruction is much closer to standard image. And as shown in Table 1, its RMSE is lower and SSIM is higher. These observations suggest that our method is powerful for sparse CT reconstruction data.Figure 7
One magnified part of reconstructed real images for comparison.
(a)
Standard image (b)
ART-TV reconstruction (c)
PISPTV reconstructionFigure 8
The profile of line 350 in different reconstructed real images.
(a)
ART-TV profile (b)
PISPTV profile


## 4. Conclusion

In conclusion, we propose an improved TV minimization method using prior images and Split-Bregman method which uses prior images to obtain valuable previous information and promote the subsequent imaging process. Split-Bregman method is used to solve the optimal problems. Simulated abdomen phantom and a real dataset are used to validate the method. In the simulation study, different sized circular patches were added to reflect the changes of projections in different scanning. Due to the difficulty of getting real data with these clinical and changes, this kind of comparison will be carried out in further study. For experimental research, X-ray CT Geometrical Calibration via LLE is used to register different reconstructed images. The results demonstrate that the proposed method can reconstruct high-quality images from few-views data and has a potential for reducing the radiation dose in clinical application.



---

*Source: 3094698-2016-08-25.xml*