Online Robust Projective Dictionary Learning: Shape Modeling for MR-TRUS Registration

被引:14
作者
Wang, Yi [1 ]
Zheng, Qingqing [2 ]
Heng, Pheng Ann [2 ]
机构
[1] Shenzhen Univ, Natl Reg Key Technol Engn Lab Med Ultrasound, Guangdong Prov Key Lab Biomed Measurements & Ultr, Sch Biomed Engn,Hlth Sci Ctr, Shenzhen 518060, Peoples R China
[2] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Dictionary learning; dimension reduction; MR-TRUS registration; online; prostate segmentation; shape modelling; PROSTATE-CANCER; SPARSE REPRESENTATION; FUSION; SEGMENTATION; BIOPSY; ALGORITHM; ACCURACY;
D O I
10.1109/TMI.2017.2777870
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Robust and effective shape prior modeling from a set of training data remains a challenging task, since the shape variation is complicated, and shape models should preserve local details as well as handle shape noises. To address these challenges, a novel robust projective dictionary learning (RPDL) scheme is proposed in this paper. Specifically, the RPDL method integrates the dimension reduction and dictionary learning into a unified framework for shape prior modeling, which can not only learn a robust and representative dictionary with the energy preservation of the training data, but also reduce the dimensionality and computational cost via the subspace learning. In addition, the proposed RPDL algorithm is regularized by using the l(1) norm to handle the outliers and noises, and is embedded in an online framework so that of memory and time efficiency. The proposed method is employed to model prostate shape prior for the application of magnetic resonance transrectal ultrasound registration. The experimental results demonstrate that our method provides more accurate and robust shape modeling than the state-of-the-art methods do. The proposed RPDL method is applicable for modeling other organs, and hence, a general solution for the problem of shape prior modeling.
引用
收藏
页码:1067 / 1078
页数:12
相关论文
共 45 条
[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], 2002, Principal components analysis
[3]  
[Anonymous], MED IMAGE COMPUTING
[4]  
[Anonymous], 2008, STAT METHODS MED RES
[5]   Properties of sufficiency and statistical tests [J].
Bartlett, MS .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL AND PHYSICAL SCIENCES, 1937, 160 (A901) :0268-0282
[7]   Large-Scale Machine Learning with Stochastic Gradient Descent [J].
Bottou, Leon .
COMPSTAT'2010: 19TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STATISTICS, 2010, :177-186
[8]   A new point matching algorithm for non-rigid registration [J].
Chui, HL ;
Rangarajan, A .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2003, 89 (2-3) :114-141
[9]   Iteratively Reweighted Least Squares Minimization for Sparse Recovery [J].
Daubechies, Ingrid ;
Devore, Ronald ;
Fornasier, Massimo ;
Guentuerk, C. Sinan .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2010, 63 (01) :1-38
[10]   Predicting error in rigid-body point-based registration [J].
Fitzpatrick, JM ;
West, JB ;
Maurer, CR .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 1998, 17 (05) :694-702