The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Accelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR
Open accessAbstract
We introduce a novel algorithm to reconstruct dynamic magnetic resonance imaging (MRI) data from under-sampled k-t space data. In contrast to classical model based cine MRI schemes that rely on the sparsity or banded structure in Fourier space, we use the compact representation of the data in the Karhunen Louve transform (KLT) domain to exploit the correlations in the dataset. The use of the data-dependent KL transform makes our approach ideally suited to a range of dynamic imaging problems, even when the motion is not periodic. In comparison to current KLT-based methods that rely on a two-step approach to first estimate the basis functions and then use it for reconstruction, we pose the problem as a spectrally regularized matrix recovery problem. By simultaneously determining the temporal basis functions and its spatial weights from the entire measured data, the proposed scheme is capable of providing high quality reconstructions at a range of accelerations. In addition to using the compact representation in the KLT domain, we also exploit the sparsity of the data to further improve the recovery rate. Validations using numerical phantoms and in vivo cardiac perfusion MRI data demonstrate the significant improvement in performance offered by the proposed scheme over existing methods.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(2006) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-0-387-40065-5 · Cited by 9,008
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975 · cited 3×
“proofs in [24], it can be shown that the three-step scheme converges to the global minimum of for any fixed .”
Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
Image recovery via total variation minimization and related problems
Chambolle, A., & Lions, P.-L. (1997) · Numerische Mathematik · doi:10.1007/s002110050258 · Cited by 1,569
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
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
Afonso, M. V., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2076294 · Cited by 938
Toh, K.-C., & Yun, S. (2009) · National University of Singapore · Cited by 923
k‐t BLAST and k‐t SENSE: Dynamic MRI with high frame rate exploiting spatiotemporal correlations
Tsao, J., Boesiger, P., & Pruessmann, K. P. (2003) · Magnetic Resonance in Medicine · doi:10.1002/mrm.10611 · Cited by 794
Afonso, M. V., Bioucas‐Dias, J. M., & Figueiredo, M. A. T. (2011) · Cited by 783
A Fast Alternating Direction Method for TVL1-L2 Signal Reconstruction From Partial Fourier Data
Yang, J., Zhang, Y., & Yin, W. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042333 · Cited by 571
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
Ramani, S., Blu, T., & Unser, M. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2001404 · Cited by 397
SPATIOTEMPORAL IMAGINGWITH PARTIALLY SEPARABLE FUNCTIONS
Liang, Z.-P. (2007) · 2007 4th IEEE International Symposium on Biomedical Imaging: From Nano to Macro · doi:10.1109/isbi.2007.357020 · Cited by 369
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
k‐t PCA: Temporally constrained k‐t BLAST reconstruction using principal component analysis
Pedersen, H., Kozerke, S., Ringgaard, S., Nehrke, K., & Kim, W. Y. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22052 · Cited by 294
ADMiRA: Atomic Decomposition for Minimum Rank Approximation
Lee, K., & Bresler, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054251 · Cited by 267
Spatiotemporal Imaging with Partially Separable Functions
Liang, Z.-P. (2007) · 2007 Joint Meeting of the 6th International Symposium on Noninvasive Functional Source Imaging of the Brain and Heart and the International Conference on Functional Biomedical Imaging · doi:10.1109/nfsi-icfbi.2007.4387720 · Cited by 204
Adluru, G., McGann, C. J., Speier, P., Kholmovski, E. G., Shaaban, A. M., & DiBella, E. (2009) · Journal of Magnetic Resonance Imaging · doi:10.1002/jmri.21585 · Cited by 155
Self-citationRadial k‐t FOCUSS for high‐resolution cardiac cine MRI
Jung, H., Park, J., Yoo, J., & Ye, J. C. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22172 · Cited by 110
An algorithm for sparse MRI reconstruction by Schatten p-norm minimization
Majumdar, A., & Ward, R. K. (2010) · Magnetic Resonance Imaging · doi:10.1016/j.mri.2010.09.001 · Cited by 102
Relaxed Conditions for Sparse Signal Recovery With General Concave Priors
Trzasko, J. D., & Manduca, A. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2025979 · Cited by 41
Real-time cardiac MRI using prior spatial-spectral information
Brinegar, C., Zhang, H., Wu, Y., Foley, L. M., Hitchens, T. K., Ye, Q., Pocci, D., Lam, F., Ho, C., & Liang, Z. (2009) · Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC) · doi:10.1109/iembs.2009.5333482 · Cited by 28
Cited by
Deep Convolutional Neural Network for Inverse Problems in Imaging
Jin, K. H., McCann, M. T., Froustey, E., & Unser, M. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2713099 · Cited by 2,529
“el.unser@epfl.ch). November 14, 2016 DRAFT arXiv:1611.03679v1 [cs.CV] 11 Nov 2016 2 have been particularly influential in the field of biomedical imaging, e.g., in magnetic resonance imaging (MRI) [10], [11] and X-ray computed tomography (CT) [12], [13]. These devices face an unfavorable trade-off between noise and acqui…”
BackgroundA 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
MoDL: Model-Based Deep Learning Architecture for Inverse Problems
Aggarwal, H. K., Mani, M. P., & Jacob, M. (2019) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2018.2865356 · Cited by 1,069
Self-citationDemene, C., Deffieux, T., Pernot, M., Osmanski, B.-F., Biran, V., Gennisson, J.-L., Sieu, L.-A., Bergel, A., Franqui, S., Correas, J.-M., et al. (2015) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2015.2428634 · Cited by 983
Accelerating magnetic resonance imaging via deep learning
Wang, S., Su, Z., Ying, L., Peng, X., Zhu, S., Liang, F., Feng, D., & Liang, D. (2016) · 2016 IEEE 13th International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2016.7493320 · Cited by 800
Metadata
- Authors
- Lingala, S. G., Hu, Y., DiBella, E., & Jacob, M.
- Venue
- IEEE Transactions on Medical Imaging
- Published
- 2011-05
- Volume
- 30
- Issue
- 5
- Pages
- 1042-1054
- ISSN
- 0278-0062 (ISSN-L)
- 1558-254X
- OpenAlex
- W2156739854
- Cited by
- 664
- References
- 32
- FWCI
- 23.21
- Type
- journal article
- Language
- en
- Open access
- green
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.