Compressed sensing magnetic resonance imaging based on dictionary updating and block-matching and three-dimensional filtering regularisation

Compressed sensing magnetic resonance imaging based on dictionary updating and block-matching and three-dimensional filtering regularisation

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Image Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.


    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
      • 10. Chen, C., Huang, J.Z.: ‘Compressive sensing MRI with wavelet tree sparsity’. Proc. Advances in Neural Information Processing Systems, 25 December 2012, pp. 11241132.
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
      • 15. Egiazarian, K., Foi, A., Katkovnik, V.: ‘Compressed sensing image reconstruction via recursive spatially adaptive filtering’. Proc. IEEE Int. Conf. Image Processing, San Antonio, TX, October 2007, pp. I549I552.
    16. 16)
      • 16. Metzler, C.A., Maleki, A., Baraniuk, R.G.: ‘From denoising to compressed sensing’,, accessed 21 July 2014.
    17. 17)
      • 17. Venkatakrishnan, S.V., Bouman, C.A., Wohlberg, B.: ‘Plug-and-play priors for model based reconstruction’. Proc. IEEE Global Conf. Signal and Information Processing, Austin, TX, December 2013, pp. 945948.
    18. 18)
    19. 19)
      • 19. Aghagolzadeh, M., Radha, H.: ‘Compressive dictionary learning for image recovery’. Proc. IEEE Int. Conf. Image Processing, Orlando, FL, September 2012, pp. 661664.
    20. 20)
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
    26. 26)
    27. 27)

Related content

This is a required field
Please enter a valid email address