Dynamic 3D PET reconstruction for kinetic analysis using patch-based low-rank penalty

Citations

SCOPUS

1

초록

Dynamic positron emission tomography (PET) is widely used to identify metabolism over time. However, conventional reconstruction algorithm provides a noisy reconstruction due to the lack of photon counts in each frame. Therefore, the main goal of this paper is to develop a novel spatio-temporal regularization approach that exploits inherent similarities within intra- and inter- frames. One of the main contributions of this paper is to demonstrate that such correlations can be exploited using a low rank constraint of overlapping similarity blocks. The resulting optimization framework is, however, non-smooth and non Lipschitz due to the low-rank penalty terms and Poisson log-likelihood. Therefore, we propose a novel globally convergent optimization method using the concave-convex procedure (CCCP) by exploiting Legendre-Fenchel transform. We confirm that the proposed algorithm can provide significantly improved image quality. © 2012 IEEE.

키워드

Concave-convex procedure; Globally convergent; Legendre-Fenchel transforms; Optimization framework; Optimization method; Positron emission tomography (PET); Reconstruction algorithms; Spatio-temporal regularizations; Algorithms; Medical imaging; Nuclear physics; Positron emission tomography
제목
Dynamic 3D PET reconstruction for kinetic analysis using patch-based low-rank penalty
저자
Kim, K.S.; Son, Y.D.; Cho, Z.H.; Ra, J.B.; Ye, J.C.
DOI
10.1109/NSSMIC.2012.6551782
발행일
2012-11
유형
Conference Paper
저널명
IEEE Nuclear Science Symposium Conference Record
페이지
3430 ~ 3433