Compressed sampling in the application of magnetic resonance imaging compression requires high accuracy when reconstructing from a small number of samples. Sparsity in magnetic resonance images is a fundamental requirement in compressed sampling. In this paper, we proposed the lifting wavelet transform sparsity technique by taking wavelet coefficients on the low pass sub-band that contains meaningful information. The application of novel methods useful for compressing data with the highest compression ratio at the sender but still maintaining high accuracy at the receiver. These wavelet coefficient values are arranged to form a sparse vector. We explore the performance of the proposed method by testing at several levels of lifting wavelet transform decomposition, include Levels 2, 3, 4, 5, and 6. The second requirement for compressed sampling is the acquisition technique. The data sampled sparse vectors using a normal distributed random measurement matrix. This matrix is normalized to the average energy of the image pixel block. The last compressed sampling requirement is a reconstruction algorithm. In this study, we analyze three reconstruction algorithms, namely Level 1 magic, iteratively reweighted least squares, and orthogonal matching pursuit, based on structural similarity index measured and peak signal to noise ratio metrics. Experimental results show that magnetic resonance imaging can be reconstructed with higher structural similarity index measured and peak signal to noise ratio using the lifting wavelet transform sparsity technique at a minimum decomposition level of 4. The proposed lifting wavelet transforms and Level 1 magic reconstruction algorithm has the best performance compared to the others at the measurement rate range between 10 to 70. This method also outperforms the techniques in previous studies.