Background
Compressed Sensing (CS) is a theory with potential to reconstruct sparse images from a small number of random acquisitions. Particularly in MRI, CS aims to reconstruct the image from incomplete K-space data with minimum penalty on the image quality. The image is recovered from the sub-sampled K-space data, using image sparsity in a known sparse transform domain. Cardiac MRI has a sparse structure in both temporal and spatial domains; making CS a promising method for such application.
Methods
Experiments were performed on a data set acquired by Cagdas Bilen et al.[1]. Fully sampled data were acquired using a 128×128 matrix (FOV = 320 × 320 mm) and 23 temporal frames covering the cardiac cycle. In this study, we reconstructed eight (one in every three) frames through CS using Gradient Projection for Sparse Reconstruction (GPSR) algorithm. The remaining 15 frames were reconstructed through a combination of CS and temporal information (TI). Sampling rate for the CS and CS-TI frames was set to 0.5 and 0.3, respectively. Block Discrete Cosine Transform (BDCT), Block Walsh-Hadamard Transform (BWHT) and Gaussian Transform were used to create measurement matrix in CS. Discrete Wavelet Transform (DWT) was used as sparse basis. The fidelity term in cost function is modified as: g=0.9||Fu m-y||2+0.1||TE-m||2, where Fu represents the under-sampled Fourier operator, y represents the K-space under-sampled data, and TE (Temporal Estimation) represents the obtained frames from TI. In this study, we use interpolation (I), forward motion estimation (FME) and forward-backward motion estimation (F-B ME), respectively on previous and next CS frames to obtain TI.
Results
Figure 1 illustrates one frame from the original set along with the corresponding CS and CS-TI frames reconstructed with proposed methods for TI generation. Table 1 shows numerical results including SNR, PSNR, Structural SIMilarity (SSIM) and computational time for each proposed method.
Figure 1. From left to right, First row) original image, CS frame with BWHT, BDCT and Gaussian
measurement matrices. Second row) CS-TI using I method frame with BWHT, BDCT and Gaussian
measurement matrices. Third row) CS-TI using FME method frame with BWHT, BDCT and
Gaussian measurement matrices. Fourth row) CS-TI using (F-B) ME method frame with
BWHT, BDCT and Gaussian measurement matrices.
Table 1. Results Of Proposed Methods Show That BWHT Outperform Other Methods.
Conclusions
The proposed method increased under-sampling rate and expedited reconstruction time in CS theory. The results were quantified using SNR, PSNR and SSIM for the quality of the reconstruction and the computational time, concluding that BWHT outperforms other methods in both quality measures and computational time with 15% and 10%, respectively. In all aforementioned a derivative of the proposed method, the processing time was at least 4 times accelerated compared to the routine CS algorithm.
