The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
MR Image Reconstruction From Highly Undersampled k-Space Data by Dictionary Learning
Abstract
Compressed sensing (CS) utilizes the sparsity of magnetic resonance (MR) images to enable accurate reconstruction from undersampled k-space data. Recent CS methods have employed analytical sparsifying transforms such as wavelets, curvelets, and finite differences. In this paper, we propose a novel framework for adaptively learning the sparsifying transform (dictionary), and reconstructing the image simultaneously from highly undersampled k-space data. The sparsity in this framework is enforced on overlapping image patches emphasizing local structure. Moreover, the dictionary is adapted to the particular image instance thereby favoring better sparsities and consequently much higher undersampling rates. The proposed alternating reconstruction algorithm learns the sparsifying dictionary, and uses it to remove aliasing and noise in one step, and subsequently restores and fills-in the k-space data in the other step. Numerical experiments are conducted on MR images and on real MR data of several anatomies with a variety of sampling schemes. The results demonstrate dramatic improvements on the order of 4-18 dB in reconstruction error and doubling of the acceptable undersampling factor using the proposed adaptive dictionary as compared to previous CS methods. These improvements persist over a wide range of practical data signal-to-noise ratios, without any parameter tuning.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694 · cited 2×
“Numerous algorithms have been proposed to solve such a dictionary learning problem [24], [25], [52], [ 53 ] (also see survey in [54]).”
MethodImage Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Sparse Representation for Color Image Restoration
Mairal, J., Elad, M., & Sapiro, G. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.911828 · Cited by 1,716
Dictionaries for Sparse Representation Modeling
Rubinstein, R., Bruckstein, A. M., & Elad, M. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2040551 · Cited by 1,306
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Method of optimal directions for frame design
Engan, K., Aase, S. O., & Hakon Husoy, J. (1999) · 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258) · doi:10.1109/icassp.1999.760624 · Cited by 1,253
Jackson, J. I., Meyer, C. H., Nishimura, D. G., & Macovski, A. (1991) · IEEE Transactions on Medical Imaging · doi:10.1109/42.97598 · Cited by 1,059
Principles of magnetic resonance imaging : a signal processing perspective
Liang, Z.-P., & Lauterbur, P. C. (2000) · Cited by 767
k‐t FOCUSS: A general compressed sensing framework for high resolution dynamic MRI
Jung, H., Sung, K., Nayak, K. S., Kim, E. Y., & Ye, J. C. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21757 · Cited by 669
Compressed sensing in dynamic MRI
Gamper, U., Boesiger, P., & Kozerke, S. (2008) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21477 · Cited by 569
Neuromagnetic source imaging with FOCUSS: a recursive weighted minimum norm algorithm
Gorodnitsky, I. F., George, J. S., & Rao, B. D. (1995) · Electroencephalography and Clinical Neurophysiology · doi:10.1016/0013-4694(95)00107-a · Cited by 567
Highly Undersampled Magnetic Resonance Image Reconstruction via Homotopic $\ell_{0}$-Minimization
Trzasko, J., & Manduca, A. (2009) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2008.927346 · Cited by 490
Learning Multiscale Sparse Representations for Image and Video Restoration
Mairal, J., Sapiro, G., & Elad, M. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070697653 · Cited by 460
Principles of Magnetic Resonance Imaging
Liang, Z.-P., & Lauterbur, P. C. (1999) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470545652 · Cited by 412
An efficient algorithm for compressed MR imaging using total variation and wavelets
Ma, S., Yin, W., Zhang, Y., & Chakraborty, A. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587391 · Cited by 334
Image Sequence Denoising via Sparse and Redundant Representations
Protter, M., & Elad, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2008065 · Cited by 323
k-t SPARSE: High frame rate dynamic MRI exploiting spatio-temporal sparsity
Lustig, M. S., Santos, J. M., Donoho, D. L., & Pauly, J. M. (2006) · Cited by 313
Fast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data
Chartrand, R. (2009) · 2009 IEEE International Symposium on Biomedical Imaging: From Nano to Macro · doi:10.1109/isbi.2009.5193034 · Cited by 312
Spectrum-blind minimum-rate sampling and reconstruction of multiband signals
Feng, P., & Bresler, Y. (2002) · 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings · doi:10.1109/icassp.1996.544131 · Cited by 273
Self-citationDictionary Learning for Sparse Approximations With the Majorization Method
Yaghoobi, M., Blumensath, T., & Davies, M. E. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016257 · Cited by 213
Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
Gribonval, R., & Schnass, K. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048466 · Cited by 191
Sparse and Redundant Modeling of Image Content Using an Image-Signature-Dictionary
Aharon, M., & Elad, M. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/07070156x · Cited by 166
Local Adaptivity to Variable Smoothness for Exemplar-Based Image Regularization and Representation
Kervrann, C., & Boulanger, J. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0096-2 · Cited by 161
Iterative thresholding compressed sensing MRI based on contourlet transform
Qu, X., Zhang, W., Guo, D., Cai, C., Cai, S., & Chen, Z. (2010) · Inverse Problems in Science and Engineering · doi:10.1080/17415977.2010.492509 · Cited by 152
A novel method and fast algorithm for MR image reconstruction with significantly under-sampled data
Chen, Y., Ye, X., & Huang, F. (2010) · Inverse Problems and Imaging · doi:10.3934/ipi.2010.4.223 · Cited by 87
Image modeling and enhancement via structured sparse model selection
Yu, G., Sapiro, G., & Mallat, S. (2010) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2010.5653853 · Cited by 78
Combined sparsifying transforms for compressed sensing MRI
Qu, X., Cao, X., Guo, D., Hu, C., & Chen, Z. (2010) · Electronics Letters · doi:10.1049/el.2010.1845 · Cited by 58
Real-time dynamic MR image reconstruction using Kalman Filtered Compressed Sensing
Qiu, C., Lu, W., & Vaswani, N. (2009) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2009.4959603 · Cited by 55
Patient-adapted reconstruction and acquisition dynamic imaging method (PARADIGM) for MRI
Aggarwal, N., & Bresler, Y. (2008) · Inverse Problems · doi:10.1088/0266-5611/24/4/045015 · Cited by 42
Self-citationWavelet-Based Compressed Sensing Using a Gaussian Scale Mixture Model
Kim, Y., Nadar, M. S., & Bilgin, A. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2188807 · Cited by 30
Compressed sensing MRI based on nonsubsampled contourlet transform
Qu, X., Guo, D., Chen, Z., & Cai, C. (2008) · International Conference on Information Technology in Medicine and Education · doi:10.1109/itme.2008.4743955 · Cited by 26
Sparse MRI Reconstruction via Multiscale L0-Continuation
Trzasko, J. D., Manduca, A., & Borisch, E. A. (2007) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2007.4301242 · Cited by 24
Evaluation of image quality using dual-tree complex wavelet transform and compressive sensing
Kim, D.-O., & Park, R. (2010) · Electronics Letters · doi:10.1049/el.2010.3452 · Cited by 15
Robust Kernel Methods for Sparse MR Image Reconstruction
Trzasko, J. D., Manduca, A., & Borisch, E. A. (2007) · Springer eBooks · doi:10.1007/978-3-540-75757-3_98 · Cited by 5
Cited by
Learning a variational network for reconstruction of accelerated MRI data
Hammernik, K., Klatzer, T., Kobler, E., Recht, M. P., Sodickson, D. K., Pock, T., & Knoll, F. (2018) · Magnetic Resonance in Medicine · doi:10.1002/mrm.26977 · Cited by 1,713
A deep cascade of convolutional neural networks for dynamic MR image reconstruction
Schlemper, J., Caballero, J., Hajnal, J. V., Price, A. N., & Rueckert, D. (2018) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2017.2760978 · Cited by 1,338
Plug-and-Play priors for model based reconstruction
Venkatakrishnan, S. V., Bouman, C. A., & Wohlberg, B. (2013) · 2013 IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2013.6737048 · Cited by 1,178
“Model-based reconstruction is a powerful framework for solving a variety of inverse problems in imaging including denoising, deblurring, tomographic reconstruction, and MRI reconstruction.”
Yang, G., Yu, S., Dong, H., Slabaugh, G., Dragotti, P. L., Ye, X., Liu, F., Arridge, S., Keegan, J., Guo, Y., et al. (2018) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2017.2785879 · Cited by 1,081
The Little Engine That Could: Regularization by Denoising (RED)
Romano, Y., Elad, M., & Milanfar, P. (2017) · SIAM Journal on Imaging Sciences · doi:10.1137/16m1102884 · Cited by 934
“This has been the logical path that has led to contributions such as [24, 25, 26, 27, 28, 29] and many others.”
Metadata
- Authors
- Ravishankar, S., & Bresler, Y.
- Venue
- IEEE Transactions on Medical Imaging
- Published
- 2011-05
- Volume
- 30
- Issue
- 5
- Pages
- 1028-1041
- ISSN
- 0278-0062 (ISSN-L)
- 1558-254X
- OpenAlex
- W2168668658
- Cited by
- 1,059
- References
- 43
- FWCI
- 21.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.