Abstract
This paper explores the application of transform-domain sparsification and compressed sensing (CS) techniques to improve the efficiency and quality of magnetic resonance imaging (MRI). We implement and evaluate three sparsifying methods-discrete wavelet transform (DWT), fast Fourier transform (FFT), and discrete cosine transform (DCT)-which are used to simulate subsampled reconstruction via inverse transforms. Additionally, one accurate CS reconstruction algorithm, basis pursuit (BP), using the L(1)-MAGIC toolbox, is implemented as a benchmark based on convex optimization with L(1)-norm minimization. Emphasis is placed on basis pursuit (BP), which satisfies the formal requirements of CS theory, including incoherent sampling and sparse recovery via nonlinear reconstruction. Each method is assessed in MATLAB R2024b using standardized DICOM images and varying sampling rates. The evaluation metrics include peak signal-to-noise ratio (PSNR), root mean square error (RMSE), structural similarity index measure (SSIM), execution time, memory usage, and compression efficiency. The results show that although discrete cosine transform (DCT) outperforms the others under simulation in terms of PSNR and SSIM, it is inconsistent with the physics of MRI acquisition. Conversely, basis pursuit (BP) offers a theoretically grounded reconstruction approach with acceptable accuracy and clinical relevance. Despite the limitations of a controlled experimental setup, this study establishes a reproducible benchmarking framework and highlights the trade-offs between the quality of transform-based reconstruction and computational complexity. Future work will extend this study by incorporating clinically validated CS algorithms with L(0) and nonconvex Lp (0 < p < 1) regularization to align with state-of-the-art MRI reconstruction practices.