The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Compressed-Sensing MRI With Random Encoding
Open accessAbstract
Compressed sensing (CS) has the potential to reduce magnetic resonance (MR) data acquisition time. In order for CS-based imaging schemes to be effective, the signal of interest should be sparse or compressible in a known representation, and the measurement scheme should have good mathematical properties with respect to this representation. While MR images are often compressible, the second requirement is often only weakly satisfied with respect to commonly used Fourier encoding schemes. This paper investigates the use of random encoding for CS-MRI, in an effort to emulate the "universal" encoding schemes suggested by the theoretical CS literature. This random encoding is achieved experimentally with tailored spatially-selective radio-frequency (RF) pulses. Both simulation and experimental studies were conducted to investigate the imaging properties of this new scheme with respect to Fourier schemes. Results indicate that random encoding has the potential to outperform conventional encoding in certain scenarios. However, our study also indicates that random encoding fails to satisfy theoretical sufficient conditions for stable and accurate CS reconstruction in many scenarios of interest. Therefore, there is still no general theoretical performance guarantee for CS-MRI, with or without random encoding, and CS-based methods should be developed and validated carefully in the context of specific applications.
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
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
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
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
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
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
Single-pixel imaging via compressive sampling
Duarte, M. F., Davenport, M. A., Takhar, D., Laska, J. N., Sun, T., Kelly, K. F., & Baraniuk, R. G. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914730 · Cited by 3,575
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
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
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
Uncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
Advances in sensitivity encoding with arbitrary k‐space trajectories
Pruessmann, K. P., Weiger, M., Börnert, P., & Boesiger, P. (2001) · Magnetic Resonance in Medicine · doi:10.1002/mrm.1241 · Cited by 1,211
Compressed sensing and best 𝑘-term approximation
Cohen, A., Dahmen, W., & DeVore, R. (2008) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-08-00610-3 · Cited by 1,002
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
Optimized Projections for Compressed Sensing
Elad, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.900760 · Cited by 835
Block, K. T., Uecker, M., & Frahm, J. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21236 · Cited by 824
Pan, X., Sidky, E. Y., & Vannier, M. (2009) · Inverse Problems · doi:10.1088/0266-5611/25/12/123009 · Cited by 572
Compressed sensing in dynamic MRI
Gamper, U., Boesiger, P., & Kozerke, S. (2008) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21477 · Cited by 569
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
Accelerating SENSE using compressed sensing
Liang, D., Liu, B., Wang, J., & Ying, L. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22161 · Cited by 474
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
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
Improved k–t BLAST and k–t SENSE using FOCUSS
Jung, H., Ye, J. C., & Kim, E. Y. (2007) · Physics in Medicine and Biology · doi:10.1088/0031-9155/52/11/018 · Cited by 250
Compressed sensing for resolution enhancement of hyperpolarized 13C flyback 3D-MRSI
Hu, S., Lustig, M., Chen, A. P., Crane, J., Kerr, A., Kelley, D. A. C., Hurd, R., Kurhanewicz, J., Nelson, S. J., Pauly, J. M., et al. (2008) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2008.03.003 · Cited by 186
Variable Density Compressed Image Sampling
Wang, Z., & Arce, G. R. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2032889 · Cited by 173
Optimization ofk‐space trajectories for compressed sensing by Bayesian experimental design
Seeger, M., Nickisch, H., Pohmann, R., & Schölkopf, B. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22180 · Cited by 145
Projection reconstruction MR imaging using FOCUSS
Ye, J. C., Tak, S., Han, Y., & Park, H. W. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21202 · Cited by 115
Accelerated three‐dimensional upper airway MRI using compressed sensing
Kim, Y., Narayanan, S. S., & Nayak, K. S. (2009) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21953 · Cited by 74
Compressed sensing in hyperpolarized3He Lung MRI
Ajraoui, S., Lee, K. J., Deppe, M. H., Parnell, S. R., Parra‐Robles, J., & Wild, J. M. (2010) · Magnetic Resonance in Medicine · doi:10.1002/mrm.22302 · Cited by 61
Cited by
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
“Randomized sampling patterns have also been used previously to aid in the separation of spatiotemporal signals in moving objects or substances with different resonance frequencies 18-20 .”
Principles and prospects for single-pixel imaging
Edgar, M. P., Gibson, G. M., & Padgett, M. J. (2019) · Nature Photonics · doi:10.1038/s41566-018-0300-7 · Cited by 1,029
Eo, T., Jun, Y., Kim, T., Jang, J., Lee, H., & Hwang, D. (2018) · Magnetic Resonance in Medicine · doi:10.1002/mrm.27201 · Cited by 455
“One of the most representative algorithms is compressed sensing (CS), which uses sparsity in specific transform domains.(4-8) As more advanced algorithms, CS algorithms have been combined with parallel imaging(9-11) and low-rank constraint terms.”
MethodQu, X., Hou, Y., Lam, F., Guo, D., Zhong, J., & Chen, Z. (2014) · Medical Image Analysis · doi:10.1016/j.media.2013.09.007 · Cited by 340
Yaman, B., Hosseini, S. A. H., Moeller, S., Ellermann, J., Uğurbil, K., & Akçakaya, M. (2020) · Magnetic Resonance in Medicine · doi:10.1002/mrm.28378 · Cited by 327
Metadata
- Authors
- Haldar, J. P., Hernando, D., & Liang, Z.-P.
- Venue
- IEEE Transactions on Medical Imaging
- Published
- 2011-04
- Volume
- 30
- Issue
- 4
- Pages
- 893-903
- ISSN
- 0278-0062 (ISSN-L)
- 1558-254X
- OpenAlex
- W2107906890
- Cited by
- 308
- References
- 35
- FWCI
- 10.12
- 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.