k-t CLAIR: Self-Consistency Guided Multi-Prior Learning for Dynamic Parallel MR Image Reconstruction

Liping Zhang, Weitian Chen
10/17/2023
eess.IVcs.CVphysics.med-ph

No official code found. Best implementation: lpzhang/ktCLAIR (11 stars, MIT, last commit 2025-01-30).

Abstract

Cardiac magnetic resonance imaging (CMR) has been widely used in clinical practice for the medical diagnosis of cardiac diseases. However, the long acquisition time hinders its development in real-time applications. Here, we propose a novel self-consistency guided multi-prior learning framework named $k$-$t$ CLAIR to exploit spatiotemporal correlations from highly undersampled data for accelerated dynamic parallel MRI reconstruction. The $k$-$t$ CLAIR progressively reconstructs faithful images by leveraging multiple complementary priors learned in the $x$-$t$, $x$-$f$, and $k$-$t$ domains in an iterative fashion, as dynamic MRI exhibits high spatiotemporal redundancy. Additionally, $k$-$t$ CLAIR incorporates calibration information for prior learning, resulting in a more consistent reconstruction. Experimental results on cardiac cine and T1W/T2W images demonstrate that $k$-$t$ CLAIR achieves high-quality dynamic MR reconstruction in terms of both quantitative and qualitative performance.

View on arXivView PDF

Code Implementations(1)

lpzhang/ktCLAIRCommunity100%
MIT

k-t CLAIR: Self-Consistency Guided Multi-Prior Learning for Dynamic Parallel MR Image Reconstruction

110Shell, PythonOct 17, 20231 years agoMIT

Similar Papers

Cite this paper

@article{zhang2023clair,
  title  = {k-t CLAIR: Self-Consistency Guided Multi-Prior Learning for Dynamic Parallel MR Image Reconstruction},
  author = {Liping Zhang and Weitian Chen},
  year   = {2023},
  eprint = {2310.11050},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.11050v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.11050.svg)](https://codeofpaper.com/paper/2310.11050)

Discussion