New Theory and Faster Computations for Subspace-Based Sensitivity Map Estimation in Multichannel MRI.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 37478037.
- Also identified by DOI 10.1109/TMI.2023.3297851 and PMC identifier 10848144.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
Sensitivity map estimation is important in many multichannel MRI applications. Subspace-based sensitivity map estimation methods like ESPIRiT are popular and perform well, though can be computationally expensive and their theoretical principles can be nontrivial to understand. In the first part of this work, we present a novel theoretical derivation of subspace-based sensitivity map estimation based on a linear-predictability/structured low-rank modeling perspective. This results in an estimation approach that is equivalent to ESPIRiT, but with distinct theory that may be more intuitive for some readers. In the second part of this work, we propose and evaluate a set of computational acceleration approaches (collectively known as PISCO) that can enable substantial improvements in computation time (up to ∼ 100× in the examples we show) and memory for subspace-based sensitivity map estimation.
Medical subject headings
- Algorithms
- Magnetic Resonance Imaging