Dynamic SPECT reconstruction from few projections: a sparsity enforced matrix factorization approach

被引:9
作者
Ding, Qiaoqiao [1 ]
Zan, Yunlong [2 ,3 ]
Huang, Qiu [2 ,3 ]
Zhang, Xiaoqun [1 ,4 ]
机构
[1] Shanghai Jiao Tong Univ, LSC, Dept Math, MOE, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Biomed Engn, Shanghai 200030, Peoples R China
[3] Shanghai Jiao Tong Univ, Rui Jin Hosp, Sch Med, Shanghai 200030, Peoples R China
[4] Shanghai Jiao Tong Univ, Inst Nat Sci, Shanghai 200240, Peoples R China
关键词
dynamic SPECT; low rank matrix factorization; Kurdyka-Lojasiewicz property; sparsity; total variation; OF-INTEREST EVALUATION; COMPUTED-TOMOGRAPHY; INPUT FUNCTION; KINETIC-PARAMETERS; ALGORITHM; IMAGE; PET; REGULARIZATION; MINIMIZATION; NONCONVEX;
D O I
10.1088/0266-5611/31/2/025004
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The reconstruction of dynamic images from few projection data is a challenging problem, especially when noise is present and when the dynamic images are vary fast. In this paper, we propose a variational model, sparsity enforced matrix factorization (SEMF), based on low rank matrix factorization of unknown images and enforced sparsity constraints for representing both coefficients and bases. The proposed model is solved via an alternating iterative scheme for which each subproblem is convex and involves the efficient alternating direction method of multipliers (ADMM). The convergence of the overall alternating scheme for the nonconvex problem relies upon the Kurdyka-Lojasiewicz property, recently studied by Attouch et al (2010 Math. Oper. Res. 35 438) and Attouch et al (2013 Math. Program. 137 91). Finally our proof-of-concept simulation on 2D dynamic images shows the advantage of the proposed method compared to conventional methods.
引用
收藏
页数:26
相关论文
共 67 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], 2006, VARIATIONAL ANAL GEN
[3]  
[Anonymous], 1999, CONVEX ANAL VARIATIO
[4]  
[Anonymous], ARXIV12043595
[5]  
[Anonymous], 1989, AUGMENTED LAGRANGIAN
[6]  
Antonelli L, 2002, LECT NOTES COMPUT SC, V2330, P171
[7]  
Arnold V, 1989, MATH METHODS CLASSIC, V60
[8]   Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods [J].
Attouch, Hedy ;
Bolte, Jerome ;
Svaiter, Benar Fux .
MATHEMATICAL PROGRAMMING, 2013, 137 (1-2) :91-129
[9]   Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality [J].
Attouch, Hedy ;
Bolte, Jerome ;
Redont, Patrick ;
Soubeyran, Antoine .
MATHEMATICS OF OPERATIONS RESEARCH, 2010, 35 (02) :438-457
[10]  
Bao C, 2014, APPL COMPUT IN PRESS