Auto-Calibration and Biconvex Compressive Sensing with Applications to Parallel MRI
Yuan Ni, Thomas Strohmer

TL;DR
This paper introduces a convex optimization approach for auto-calibrated parallel MRI, enabling simultaneous signal and sensor parameter recovery with theoretical guarantees, improving reconstruction accuracy in practical noisy conditions.
Contribution
It transforms the challenging biconvex calibration problem into a convex one using lifting, providing robust recovery guarantees for MRI applications.
Findings
Successful application to real and simulated MRI data
Stable recovery guarantees in noisy environments
Enhanced reconstruction accuracy over prior methods
Abstract
We study an auto-calibration problem in which a transform-sparse signal is acquired via compressive sensing by multiple sensors in parallel, but with unknown calibration parameters of the sensors. This inverse problem has an important application in pMRI reconstruction, where the calibration parameters of the receiver coils are often difficult and costly to obtain explicitly, but nonetheless are a fundamental requirement for high-precision reconstructions. Most auto-calibration strategies for this problem involve solving a challenging biconvex optimization problem, which lacks reconstruction guarantees. In this work, we transform the auto-calibrated parallel compressive sensing problem to a convex optimization problem using the idea of `lifting'. By exploiting sparsity structures in the signal and the redundancy introduced by multiple sensors, we solve a mixed-norm minimization problem…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Advanced MRI Techniques and Applications · Medical Imaging Techniques and Applications
