Robust principal component analysis-based four-dimensional computed tomography

被引:157
作者
Gao, Hao [1 ]
Cai, Jian-Feng [1 ]
Shen, Zuowei [2 ]
Zhao, Hongkai [3 ]
机构
[1] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
[2] Natl Univ Singapore, Dept Math, Singapore 117543, Singapore
[3] Univ Calif Irvine, Dept Math, Irvine, CA 92697 USA
关键词
RADIATION-THERAPY; IMAGE-RESTORATION; DOSE REDUCTION; DATA-FIDELITY; CT; ALGORITHM; RECONSTRUCTION; REGULARIZATION; REGISTRATION; METHODOLOGY;
D O I
10.1088/0031-9155/56/11/002
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
The purpose of this paper for four-dimensional (4D) computed tomography (CT) is threefold. (1) A new spatiotemporal model is presented from the matrix perspective with the row dimension in space and the column dimension in time, namely the robust PCA (principal component analysis)-based 4D CT model. That is, instead of viewing the 4D object as a temporal collection of three-dimensional (3D) images and looking for local coherence in time or space independently, we perceive it as a mixture of low-rank matrix and sparse matrix to explore the maximum temporal coherence of the spatial structure among phases. Here the low-rank matrix corresponds to the 'background' or reference state, which is stationary over time or similar in structure; the sparse matrix stands for the 'motion' or time-varying component, e. g., heart motion in cardiac imaging, which is often either approximately sparse itself or can be sparsified in the proper basis. Besides 4D CT, this robust PCA-based 4D CT model should be applicable in other imaging problems for motion reduction or/and change detection with the least amount of data, such as multi-energy CT, cardiac MRI, and hyperspectral imaging. (2) A dynamic strategy for data acquisition, i.e. a temporally spiral scheme, is proposed that can potentially maintain similar reconstruction accuracy with far fewer projections of the data. The key point of this dynamic scheme is to reduce the total number of measurements, and hence the radiation dose, by acquiring complementary data in different phases while reducing redundant measurements of the common background structure. (3) An accurate, efficient, yet simple-to-implement algorithm based on the split Bregman method is developed for solving the model problem with sparse representation in tight frames.
引用
收藏
页码:3181 / 3198
页数:18
相关论文
共 49 条
  • [1] DIGITAL-FILTERS AS ABSOLUTE NORM REGULARIZERS
    ALLINEY, S
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1992, 40 (06) : 1548 - 1562
  • [2] [Anonymous], IEEE C COMP VIS PATT
  • [3] [Anonymous], 2008, Computed tomography: from photonstatistics to modern cone-beam CT
  • [4] [Anonymous], 0903 UCLA CAM
  • [5] [Anonymous], 2010, P 26 INT C MACH LEAR
  • [6] [Anonymous], P AS C COMP VIS QUEE
  • [7] [Anonymous], IEEE C COMP VIS PATT
  • [8] Cai J., 2010, 1024 UCLA CAM
  • [9] A framelet-based image inpainting algorithm
    Cai, Jian-Feng
    Chan, Raymond H.
    Shen, Zuowei
    [J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2008, 24 (02) : 131 - 149
  • [10] A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION
    Cai, Jian-Feng
    Candes, Emmanuel J.
    Shen, Zuowei
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) : 1956 - 1982