<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Total Variation Regularization Method for 3D Rotational Coronary Angiography</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Haibo Wu</string-name>
          <email>haibo.wu@informatik.uni-erlangen.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christopher Rohkohl</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Joachim Hornegger</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Graduate School in Advanced Optical Technologies (SAOT), Friedrich-Alexander-University Erlangen-Nuremberg</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Pattern Recognition Lab (LME), Department of Computer Science, Friedrich-Alexander-University Erlangen-Nuremberg</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Siemens AG</institution>
          ,
          <addr-line>Healthcare Sector, Forchheim</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>434</fpage>
      <lpage>438</lpage>
      <abstract>
        <p>3D rotational coronary angiography plays an important role in the field of diagnosis and treatment planning of coronary artery disease. Due to the cardiac motion, only limited number of projections can be used to reconstruct coronary arteries for each heart phase, which makes the reconstruction problem ill-posed. To reduce the under-sampling artifacts, we apply an iterative method that makes use of total variation regularization. Some different reconstruction algorithms are compared and our method outperforms the others in the experiments.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Coronary X-ray angiography is a very important imaging method in the field
of diagnosis and treatment planning of coronary artery disease. 3D image
information offers great advantage for quantitative analysis of vessel properties.
Moreover, the successive 3D reconstructions can be used to determine the
temporal dynamics of the arteries [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        The projection data for 3D reconstruction of the coronary arteries
reconstruction is acquired on an X-ray C-arm system. Simultaneously, the
electrocardiogram (ECG) is recorded. After the ECG gating only few number of
projections are available for each cardiac phase, which leads to severe angular
under-sampling and renders the reconstruction problem ill-posed. In addition,
several heart beats occur during the data acquisition which causes the data
inconsistency. As a result, the standard reconstruction methods like filtered back
projection yield unsatisfactory results with many artifacts. One way of tackling
this problem is to first estimate the motion of the arteries and then perform a
motion-compensated reconstruction. But it is still a challenging problem to get
an accurate motion model, especially for the non-periodic case [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        According to the theory of compressed sensing [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ], one can solve the
illposed problem by first finding a sparse representation for the images and then
applying the L1 norm minimization method in the transformed domain. Pan’s
group [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] adopted total variation as the sparsifying transform for reconstruction
of static objects. Their method can reduce the under-sampling artifacts but
they did not investigate the performance of the algorithm for moving objects,
e.g. coronary arteries. We apply the total variation regularization method for
3D rotational coronary angiography. The scheme appears to be robust against
both under-sampling artifacts and motion artifacts.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Materials and Methods</title>
      <p>In tomography, the goal is to reconstruct an object from line-integral projection
data. A discrete version of the projection process can be represented as
Ax = b</p>
      <p>
        A = (aij )
where
is a real mn system matrix representing the projection operator, x = (x1; :::; xn)
is a real vector representing the object, and b = (b1, ..., bm) is the corresponding
projection data. Then the optimization problem can be described as
mxin jjxjjT V s:t: jjAx
bjj22 &lt;
The inequality constrain is used to describe the data inconsistency which can
come from many factors, including the heart motion, system noise, X-ray
scatting. Thus, it is impossible to always find an image that is perfectly consistency
with the data. As a result, we only require that the image yields the projection
data that are within the L2 distance of the actual projection data. jj jjT V is
the total variation norm, which is the L1 norm of the image gradient [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. It is
well known that the constrained problem (2) can be transformed to an easier
unconstrained optimization problem
(1)
(2)
(3)
mxin jjxjjT V + jjAx
bjj22
      </p>
      <p>
        The unconstrained problem (3) is still hard to solve due to the high
dimensions. The size of the system matrix A is usually very large. Large memory
should be used to store the matrix and a lot of time is needed for
computation. To overcome these problems, we apply the forward backward splitting
method [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The objective function of (3) consists of two convex functions. The
idea of the forward backward splitting method is to optimize the two parts of
the objective function individually. The algorithm can be described as
{ Step 1: Do NART iteration steps of the standard ART.
{ Step 2: Do NT V iteration steps of the gradient descent update for minimizing
min jjxjjT V + jjx vjj22; (v is calculated from step 1)
      </p>
      <p>
        x
{ Step 3: Repeat step1 and step 2 until jjx(t) x(t+1)jj22 is less than a certain
value or the maximum iteration number is reached.
In order to do a reproducible scientific research, we adopted a dataset with
periodic cardiac motion from CAVAREV [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] in our experiments. The dataset
can be downloaded for free. CAVAREV offers an evaluation method but does
not provide the ground truth. Thus classical evaluation schemes like MSE (mean
squared error) can not be used to evaluate the results. But since the main
goal of C-arm CT imaging of highly contrasted cardiac vasculature is to find
the size and location of vessels, the evaluation method offered by CAVAREV
seems to be more suitable. The method is based on the spatial overlap of the
vasculature reconstruction with the ground truth. The Dice similarity coefficient
(DSC) is calculated at each projection image with different parameter for the
quality assessment [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The measure for the reconstruction is the max value of
DSC at all projection images. The DSC value ranges from 0 to 1. The value
0 stands for no spatial overlap while the value 1 stands for a perfect match.
To further evaluate, we compared our method to some other reconstruction
algorithms: standard ART, ECG-gated FDK, PICCS [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and L1 minimization
methods [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In the experiments, we set the gating window to 0.06 s that only
15 projection images were used to do the reconstruction. NART and NT V was 4
and 10 respectively. was chosen as 0:005 and the maximum iteration number
was 200. The parameters for the other methods were set as in the referenced
paper.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>The reconstructed transaxial slices from different methods are listed in Fig. 1.
The max DSC values of the reconstructions from different methods at different
heart phases are in Table 1. Due to the angular undersampling, the
reconstructions from standard ART and ECG-gated FDK include many streak artifacts.
PICCS and L1 minimization method reduce the artifacts dramatically. The
streak artifacts are nearly invisible in the results of TVR. Table 1 shows that
TVR outperforms the other methods at all three different heart phases, since
the max DSC value of TVR is larger than the one of the others.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Discussion</title>
      <p>The PICCS, L1 minimization and TVR are optimization based reconstruction
methods. The differences between those methods are the regularization terms.
From the view of compressed sensing, the regularization terms can be seen as a
sparsifying transform. The algorithms just apply the L1 minimization method
in different domains. A more sparse representation can reduce the number of
unknowns (more coefficients are zero or very small.), making the ill-posed problem
easier to solve. For coronary arteries, the total variation norm can give a more
sparse representation than L1 norm. In the experiments, the reconstruction
results from ECG-gated FDK are used as the prior image which contain many
streak artifacts. Thus PICCS may not offer a more sparse representation than
total variation norm. As total variation norm gives the most sparse
representation for coronary arteries in the experiments, our method outperforms the others.
Since a more sparse representation of the image can increase the reconstruction
quality. Some other representations (wavelet, DCT) will be investigated.
Acknowledgement. The first and third authors gratefully acknowledge
funding of the Erlangen Graduate School in Advanced Optical Technologies (SAOT)
by the German Research Foundation (DFG) in the framework of the German
excellence initiative. The first author is financed by Chinese Scholarship Council
(CSC).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Hansis</surname>
            <given-names>E</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schaefer</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Doessel</surname>
            <given-names>O</given-names>
          </string-name>
          , et al.
          <article-title>Evaluation of iterative sparse object reconstruction from few projections for 3-D rotational coronary angiography</article-title>
          .
          <source>IEEE Trans Med Imag</source>
          .
          <year>2008</year>
          ;
          <volume>27</volume>
          (
          <issue>11</issue>
          ):
          <fpage>1548</fpage>
          -
          <lpage>55</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Schaefer</surname>
            <given-names>D</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borgert</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rasche</surname>
            <given-names>V</given-names>
          </string-name>
          , et al.
          <article-title>Motion-compensated and gated cone beam filtered back-projection for 3-D rotational X-ray angiography</article-title>
          .
          <source>IEEE Trans Med Imag</source>
          .
          <year>2006</year>
          ;
          <volume>25</volume>
          (
          <issue>7</issue>
          ):
          <fpage>890</fpage>
          -
          <lpage>906</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Donoho</surname>
            <given-names>D.</given-names>
          </string-name>
          <article-title>Compressed sensing</article-title>
          .
          <source>IEEE Trans Inf Theory</source>
          .
          <year>2006</year>
          ;
          <volume>52</volume>
          :
          <fpage>1289</fpage>
          -
          <lpage>306</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Candes</surname>
            <given-names>E</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romberg</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            <given-names>T.</given-names>
          </string-name>
          <article-title>Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information</article-title>
          .
          <source>IEEE Trans Inf Theory</source>
          .
          <year>2006</year>
          ;
          <volume>52</volume>
          :
          <fpage>489</fpage>
          -
          <lpage>509</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Sidky</surname>
            <given-names>EY</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pan</surname>
            <given-names>X</given-names>
          </string-name>
          .
          <article-title>Image reconstruction in circular cone-beam computed tomography by constrained, total-variation minimization</article-title>
          .
          <source>Phys Med Bio</source>
          .
          <year>2008</year>
          ;
          <volume>53</volume>
          :
          <fpage>4777</fpage>
          -
          <lpage>807</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Jia</surname>
            <given-names>X</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lou</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            <given-names>R</given-names>
          </string-name>
          , et al.
          <article-title>GPU-based fast cone beam CT reconstruction from undersampled and noisy projection data via total variation</article-title>
          .
          <source>Med Phys</source>
          .
          <year>2010</year>
          ;
          <volume>37</volume>
          :
          <fpage>3441</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Rohkohl</surname>
            <given-names>C</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lauritsch</surname>
            <given-names>G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keil</surname>
            <given-names>A</given-names>
          </string-name>
          , et al.
          <article-title>CAVAREV: an open platform for evaluating 3D and 4D cardiac vasculature reconstruction</article-title>
          .
          <source>Med Phys</source>
          .
          <year>2010</year>
          ;
          <volume>55</volume>
          :
          <fpage>2905</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Chen</surname>
            <given-names>G</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tang</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leng</surname>
            <given-names>S.</given-names>
          </string-name>
          <article-title>Prior image constrained compressed sensing (PICCS): a method to accurately reconstruct dynamic CT images from highly undersampled projection data sets</article-title>
          .
          <source>Phys Med Biol</source>
          .
          <year>2008</year>
          ;
          <volume>55</volume>
          :
          <fpage>660</fpage>
          -
          <lpage>3</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Li</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kudo</surname>
            <given-names>H</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hu</surname>
            <given-names>J</given-names>
          </string-name>
          , et al.
          <article-title>Improved iterative algorithm for sparse object reconstruction and its performance evaluation with micro-CT data</article-title>
          .
          <source>IEEE Trans Nucl Sci</source>
          .
          <year>2004</year>
          ;
          <volume>51</volume>
          :
          <fpage>659</fpage>
          -
          <lpage>66</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>