The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
SVD Compression for Magnetic Resonance Fingerprinting in the Time Domain
Open accessAbstract
Magnetic resonance (MR) fingerprinting is a technique for acquiring and processing MR data that simultaneously provides quantitative maps of different tissue parameters through a pattern recognition algorithm. A predefined dictionary models the possible signal evolutions simulated using the Bloch equations with different combinations of various MR parameters and pattern recognition is completed by computing the inner product between the observed signal and each of the predicted signals within the dictionary. Though this matching algorithm has been shown to accurately predict the MR parameters of interest, one desires a more efficient method to obtain the quantitative images. We propose to compress the dictionary using the singular value decomposition, which will provide a low-rank approximation. By compressing the size of the dictionary in the time domain, we are able to speed up the pattern recognition algorithm, by a factor of between 3.4-4.8, without sacrificing the high signal-to-noise ratio of the original scheme presented previously.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
Hansen, P. C. (1992) · SIAM Review · doi:10.1137/1034115 · Cited by 3,903
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929 · cited 1×
“The singular value decomposition (SVD) [2] of a matrix is a useful tool that can provide information about the properties of a matrix and can be applied to a variety of problems, including the solution of linear least squares problems [3] and dimensionality reduction through principal component analysis (PCA) [4], [5].”
BackgroundRank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion
Hansen, P. C. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719697 · Cited by 2,909
Singular value decomposition for genome-wide expression data processing and modeling
Alter, O., Brown, P. O., & Botstein, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.18.10101 · Cited by 1,971
Magnetic resonance fingerprinting
Ma, D., Gulani, V., Seiberlich, N., Liu, K., Sunshine, J. L., Duerk, J. L., & Griswold, M. A. (2013) · Nature · doi:10.1038/nature11971 · Cited by 1,577
ESPIRiT—an eigenvalue approach to autocalibrating parallel MRI: Where SENSE meets GRAPPA
Uecker, M., Lai, P., Murphy, M. J., Virtue, P., Elad, M., Pauly, J. M., Vasanawala, S. S., & Lustig, M. (2014) · Magnetic Resonance in Medicine · doi:10.1002/mrm.24751 · Cited by 1,392
Nonuniform fast fourier transforms using min-max interpolation
Fessler, J. A., & Sutton, B. P. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.807005 · Cited by 1,337
Jolliffe, I. (2014) · Wiley StatsRef: Statistics Reference Online · doi:10.1002/9781118445112.stat06472 · Cited by 1,221
Wackernagel, H. (2003) · Multivariate Geostatistics · doi:10.1007/978-3-662-05294-5_17 · Cited by 1,155
An SVD-based watermarking scheme for protecting rightful ownership
Liu, R., & Tan, T. (2002) · IEEE Transactions on Multimedia · doi:10.1109/6046.985560 · Cited by 995
(2002) · Springer Series in Statistics · doi:10.1007/b98835 · Cited by 919
Digital Image Watermarking Using Discrete Wavelet Transform and Singular Value Decomposition
Lai, C., & Tsai, C.-C. (2010) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2010.2066770 · Cited by 612
Randomized algorithms for the low-rank approximation of matrices
Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709640104 · Cited by 559
Singular Value Decomposition (SVD) Image Coding
Andrews, H., & Patterson, C. (1976) · IEEE Transactions on Communications · doi:10.1109/tcom.1976.1093309 · Cited by 304
An Algorithm for the Principal Component Analysis of Large Data Sets
Halko, N., Martinsson, P.-G., Shkolnisky, Y., & Tygert, M. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/100804139 · Cited by 291
Large-scale information retrieval with latent semantic indexing
Letsche, T. A., & Berry, M. W. (1997) · Information Sciences · doi:10.1016/s0020-0255(97)00044-3 · Cited by 183
Dynamically adaptive MRI with encoding by singular value decomposition
Zientara, G. P., Panych, L. P., & Jolesz, F. A. (1994) · Magnetic Resonance in Medicine · doi:10.1002/mrm.1910320219 · Cited by 108
Alter, O., & Golub, G. H. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0604756103 · Cited by 55
ON RELATIONSHIPS BETWEEN UNCENTRED AND COLUMN-CENTRED PRINCIPAL COMPONENT ANALYSIS
Cadima, J. F. C. L., & Jolliffe, I. T. (2009) · Cited by 52
A simple geometrical description of the TrueFISP ideal transient and steady‐state signal
Schmitt, P., Griswold, M. A., Gulani, V., Haase, A., Flentje, M. P., & Jakob, P. M. (2005) · Magnetic Resonance in Medicine · doi:10.1002/mrm.20738 · Cited by 41
Self-citationRandomized SVD Methods in Hyperspectral Imaging
Zhang, J., Erway, J. B., Hu, X., Zhang, Q., & Plemmons, R. J. (2012) · Journal of Electrical and Computer Engineering · doi:10.1155/2012/409357 · Cited by 34
Cited by
MR fingerprinting Deep RecOnstruction NEtwork (DRONE)
Cohen, O., Zhu, B., & Rosen, M. S. (2018) · Magnetic Resonance in Medicine · doi:10.1002/mrm.27198 · Cited by 306
Fast 3D magnetic resonance fingerprinting for a whole‐brain coverage
Ma, D., Jiang, Y., Chen, Y., McGivney, D., Mehta, B., Gulani, V., & Griswold, M. (2018) · Magnetic Resonance in Medicine · doi:10.1002/mrm.26886 · Cited by 158
“In addition, because the 3D MRF scan acquired over 1000 undersampled volumes, a singular value decomposition (SVD) compression (7) was applied in k-space before reconstruction, to substantially reduce the computing memory and accelerate the postprocessing time.”
Self-citationRieger, B., Akçakaya, M., Pariente, J. C., Llufriu, S., Martinez-Heras, E., Weingärtner, S., & Schad, L. R. (2018) · Scientific Reports · doi:10.1038/s41598-018-24920-z · Cited by 39
Amortized Neural Networks for Low-Latency Speech Recognition
Macoskey, J., Strimel, G. P., Su, J., & Rastrow, A. (2021) · Interspeech 2021 · doi:10.21437/interspeech.2021-712 · Cited by 12
Metadata
- Authors
- McGivney, D. F., Pierre, E., Ma, D., Jiang, Y., Saybasili, H., Gulani, V., & Griswold, M. A.
- Venue
- IEEE Transactions on Medical Imaging
- Published
- 2014-12
- Volume
- 33
- Issue
- 12
- Pages
- 2311-2322
- ISSN
- 0278-0062 (ISSN-L)
- 1558-254X
- OpenAlex
- W2061708033
- Cited by
- 314
- References
- 26
- FWCI
- 6.49
- 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.