Compressed sensing magnetic resonance imaging based on dictionary updating and block‐matching and three‐dimensional filtering regularisation. Issue 1 (1st January 2016)

• Record Type: Journal Article
• Authors: Shi, Baoshun; Lian, Qiusheng; Chen, Shuzhen
• Is Part Of: IET image processing. Volume 10:Issue 1(2016)
• Page Start: 68
• Page End: 79
• Publication Date: 2016-01-01
• Subjects: medical image processing -- image reconstruction -- compressed sensing -- biomedical MRI; compressed sensing magnetic resonance imaging -- dictionary updating -- block matching -- 3D filtering regularisation -- image reconstruction -- dictionary–coefficient matrix product -- recursive method; Image processing -- Periodicals; 621.36705
• DOI: 10.1049/iet-ipr.2014.0870
• Languages: English
• ISSNs: 1751-9659

Abstract

Abstract : Compressed sensing (CS) enables that magnetic resonance (MR) images can be exactly reconstructed from undersampled k ‐space data by exploiting the sparsity of MR images in some analytical sparsifying transform or some dictionary. Recent methods are exploiting adaptive patch‐based dictionaries for image recovery by alternating between dictionary learning step and image reconstruction step. In this study, the authors propose a novel MR image reconstruction algorithm utilising dictionary updating, which consists of three steps: sparse coding, dictionary updating and image reconstruction. In the dictionary updating step, they perform a first‐order series expansion for dictionary–coefficient matrix product via recursive method, and propose an efficient method to solve the new dictionary updating problem. To improve the reconstruction quality, the proposed block‐matching and three‐dimensional (3D) filtering regularisation is incorporated into the authors' image CS recovery, which can combine the self‐similarities within the image, the 3D transform sparsity and the local sparsity into image recovery process. Experimental simulations demonstrate their proposed algorithms can obtain better reconstruction quality than the previous CS algorithms.