arXiv subjects

Silpa Babu

Publications and source records attributed to Silpa Babu.

4 recordsLinked to original sources

arXiv2025

Low Latency and Generalizable Dynamic MRI via L+S Alternating GD and Minimization

In this work, we develop novel MRI reconstruction approaches that are accurate, fast and low-latency for a large number of dynamic MRI applications, sampling schemes and sampling rates; without any problem-specific parameter tuning. We refer to this property of a single algorithm, without parameter tuning, being accurate and fast for many settings as generalizability. Generalizability is possible only for simple (few parameter) models such as low-rank (LR) or LR plus sparse (L plus S), and for simple few parameter algorithms based on these models, which is what we develop and evaluate in this work.

eess.IV↗

arXiv2025

Fast Low Rank column-wise Compressive Sensing for Accelerated Dynamic MRI

This work develops a fast, memory-efficient, and general algorithm for accelerated/undersampled dynamic MRI by assuming an approximate LR model on the matrix formed by the vectorized images of the sequence. By general, we mean that our algorithm can be used for multiple accelerated dynamic MRI applications and multiple sampling rates (acceleration rates) and patterns with a single choice of parameters (no parameter tuning). We show that our proposed algorithms, alternating Gradient Descent (GD) and minimization for MRI (altGDmin-MRI and altGDmin-MRI2), outperform many existing approaches while also being faster than all of them, on average. This claim is based on comparisons on 8 different retrospectively undersampled single- or multi-coil dynamic MRI applications, undersampled using either 1D Cartesian or 2D pseudo-radial undersampling at multiple sampling rates. All comparisons used the same set of algorithm parameters. Our second contribution is a mini-batch and a fully online extension that can process new measurements and return reconstructions either as soon as measurements of a new image frame arrive, or after a short delay.

eess.IV↗

arXiv2024

Fast Low Rank column-wise Compressive Sensing for Accelerated Dynamic MRI

This work develops a novel set of algorithms, alternating Gradient Descent (GD) and minimization for MRI (altGDmin-MRI1 and altGDmin-MRI2), for accelerated dynamic MRI by assuming an approximate low-rank (LR) model on the matrix formed by the vectorized images of the sequence. The LR model itself is well-known in the MRI literature; our contribution is the novel GD-based algorithms which are much faster, memory efficient, and general compared with existing work; and careful use of a 3-level hierarchical LR model. By general, we mean that, with a single choice of parameters, our method provides accurate reconstructions for multiple accelerated dynamic MRI applications, multiple sampling rates and sampling schemes. We show that our methods outperform many of the popular existing approaches while also being faster than all of them, on average. This claim is based on comparisons on 8 different retrospectively under sampled multi-coil dynamic MRI applications, sampled using either 1D Cartesian or 2D pseudo radial under sampling, at multiple sampling rates. Evaluations on some prospectively under sampled datasets are also provided. Our second contribution is a mini-batch subspace tracking extension that can process new measurements and return reconstructions within a short delay after they arrive. The recovery algorithm itself is also faster than its batch counterpart.

eess.IV↗

arXiv2023

A Fast Algorithm for Low Rank + Sparse column-wise Compressive Sensing

This paper focuses studies the following low rank + sparse (LR+S) column-wise compressive sensing problem. We aim to recover an $n \times q$ matrix, $\X^* =[ \x_1^*, \x_2^*, \cdots , \x_q^*]$ from $m$ independent linear projections of each of its $q$ columns, given by $\y_k :=\A_k\x_k^*$, $k \in [q]$. Here, $\y_k$ is an $m$-length vector with $m < n$. We assume that the matrix $\X^*$ can be decomposed as $\X^*=Ł^*+§^*$, where $Ł^*$ is a low rank matrix of rank $r << \min(n,q)$ and $§^*$ is a sparse matrix. Each column of $§$ contains $ρ$ non-zero entries. The matrices $\A_k$ are known and mutually independent for different $k$. To address this recovery problem, we propose a novel fast GD-based solution called AltGDmin-LR+S, which is memory and communication efficient. We numerically evaluate its performance by conducting a detailed simulation-based study.

eess.IV↗