Block matching sparsity regularization-based image reconstruction for incomplete projection data in computed tomography

• Published in: Physics in medicine & biology Vol. 63; no. 3; pp. 35045 - 35063
• Main Authors: Cai, Ailong, Li, Lei, Zheng, Zhizhong, Zhang, Hanming, Wang, Linyuan, Hu, Guoen, Yan, Bin
• Format: Journal Article
• Language: English
• Published: England IOP Publishing 06.02.2018
• Subjects: block matching sparsity regularization; computed tomography; image reconstruction; projection onto convex set; proximal point algorithm
• ISSN: 0031-9155; 1361-6560; 1361-6560
• DOI: 10.1088/1361-6560/aa9e63

In medical imaging many conventional regularization methods, such as total variation or total generalized variation, impose strong prior assumptions which can only account for very limited classes of images. A more reasonable sparse representation frame for images is still badly needed. Visually understandable images contain meaningful patterns, and combinations or collections of these patterns can be utilized to form some sparse and redundant representations which promise to facilitate image reconstructions. In this work, we propose and study block matching sparsity regularization (BMSR) and devise an optimization program using BMSR for computed tomography (CT) image reconstruction for an incomplete projection set. The program is built as a constrained optimization, minimizing the L1-norm of the coefficients of the image in the transformed domain subject to data observation and positivity of the image itself. To solve the program efficiently, a practical method based on the proximal point algorithm is developed and analyzed. In order to accelerate the convergence rate, a practical strategy for tuning the BMSR parameter is proposed and applied. The experimental results for various settings, including real CT scanning, have verified the proposed reconstruction method showing promising capabilities over conventional regularization.