Search Results for author:
Found 5 papers, 1 papers with code
CoverBLIP: accelerated and scalable iterative matched-filtering for Magnetic Resonance Fingerprint reconstruction
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.
CoverBLIP: scalable iterative matched filtering for MR Fingerprint recovery
Current proposed solutions for the high dimensionality of the MRF reconstruction problem rely on a linear compression step to reduce the matching computations and boost the efficiency of fast but non-scalable searching schemes such as the KD-trees.
Cover Tree Compressed Sensing for Fast MR Fingerprint Recovery
We adopt data structure in the form of cover trees and iteratively apply approximate nearest neighbour (ANN) searches for fast compressed sensing reconstruction of signals living on discrete smooth manifolds.
Reconstruction of Enhanced Ultrasound Images From Compressed Measurements Using Simultaneous Direction Method of Multipliers
Through this model, the resolution of reconstructed ultrasound images from compressed measurements mainly depends on three aspects: the acquisition setup, i. e. the incoherence of the sampling matrix, the image regularization, i. e. the sparsity prior, and the optimization technique.
Compressive Deconvolution in Medical Ultrasound Imaging
The interest of compressive sampling in ultrasound imaging has been recently extensively evaluated by several research teams.
