CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction
From MaRDI portal
Publication:5210429
DOI10.1088/1361-6420/AB4C9AzbMATH Open1485.92061arXiv1810.01967OpenAlexW2979472424MaRDI QIDQ5210429FDOQ5210429
Authors: Mohammad Golbabaee, Zhouye Chen, Y. Wiaux, M. E. Davies 
Publication date: 20 January 2020
Published in: Inverse Problems (Search for Journal in Brave)
Abstract: Current popular methods for Magnetic Resonance Fingerprint (MRF) recovery are bottlenecked by the heavy computations of a matched-filtering step due to the growing size and complexity of the fingerprint dictionaries in multi-parametric quantitative MRI applications. We address this shortcoming by arranging dictionary atoms in the form of cover tree structures and adopt the corresponding fast approximate nearest neighbour searches to accelerate matched-filtering. For datasets belonging to smooth low-dimensional manifolds cover trees offer search complexities logarithmic in terms of data population. With this motivation we propose an iterative reconstruction algorithm, named CoverBLIP, to address large-size MRF problems where the fingerprint dictionary i.e. discrete manifold of Bloch responses, encodes several intrinsic NMR parameters. We study different forms of convergence for this algorithm and we show that provided with a notion of embedding, the inexact and non-convex iterations of CoverBLIP linearly convergence toward a near-global solution with the same order of accuracy as using exact brute-force searches. Our further examinations on both synthetic and real-world datasets and using different sampling strategies, indicates between 2 to 3 orders of magnitude reduction in total search computations. Cover trees are robust against the curse-of-dimensionality and therefore CoverBLIP provides a notion of scalability -- a consistent gain in time-accuracy performance-- for searching high-dimensional atoms which may not be easily preprocessed (i.e. for dimensionality reduction) due to the increasing degrees of non-linearities appearing in the emerging multi-parametric MRF dictionaries.
Full work available at URL: https://arxiv.org/abs/1810.01967
Recommendations
- Multicompartment magnetic resonance fingerprinting
- A compressed sensing framework for magnetic resonance fingerprinting
- Greedy approximate projection for magnetic resonance fingerprinting with partial volumes
- An off-the-grid approach to multi-compartment magnetic resonance fingerprinting
- PF-FICOTA-SENSE: an MRI fast reconstruction method
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A simple proof of the restricted isometry property for random matrices
- Compressed sensing
- Iterative hard thresholding for compressed sensing
- Title not available (Why is that?)
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Random projections of smooth manifolds
- Fast Fourier Transforms for Nonequispaced Data
- Multidimensional binary search trees used for associative searching
- Model-Based Compressive Sensing
- Nonuniform fast fourier transforms using min-max interpolation
- Large-scale machine learning with stochastic gradient descent
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Title not available (Why is that?)
- Inexact Gradient Projection and Fast Data Driven Compressed Sensing
- Compressive Source Separation: Theory and Methods for Hyperspectral Imaging
- A compressed sensing framework for magnetic resonance fingerprinting
- Multicompartment magnetic resonance fingerprinting
Cited In (4)
This page was built for publication: CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210429)
