paper-with-me

홈 › Papers

Data-Consistent Non-Cartesian Deep Subspace Learning for Efficient Dynamic MR Image Reconstruction

2022-05-03 · Zihao Chen, Yuhua Chen, Yibin Xie, Debiao Li, Anthony G. Christodoulou

Non-Cartesian sampling with subspace-constrained image reconstruction is a popular approach to dynamic MRI, but slow iterative reconstruction limits its clinical application. Data-consistent (DC) deep learning can accelerate reconstruction with good image quality, but has not been formulated for non-Cartesian subspace imaging. In this study, we propose a DC non-Cartesian deep subspace learning framework for fast, accurate dynamic MR image reconstruction. Four novel DC formulations are developed and evaluated: two gradient decent approaches, a directly solved approach, and a conjugate gradient approach. We applied a U-Net model with and without DC layers to reconstruct T1-weighted images for cardiac MR Multitasking (an advanced multidimensional imaging method), comparing our results to the iteratively reconstructed reference. Experimental results show that the proposed framework significantly improves reconstruction accuracy over the U-Net model without DC, while significantly accelerating the reconstruction over conventional iterative reconstruction.

📄 PDF Abstract BibTeX arXiv:2205.01770

Code (0)

등록된 구현이 없습니다.

Tasks

Image Reconstruction

Methods 이 논문이 사용한 방법론

Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Concatenated Skip Connection A Concatenated Skip Connection is a type of skip connection that seeks to reuse features by concatenating them to new layers, allowing more information to be retained from…
U-Net 설명 없음

Similar Papers 제목 키워드 기반

Optimized Cartesian $K$-Means

2014-05-16 · Jianfeng Wang, Jingdong Wang, Jingkuan Song, Xin-Shun Xu 외

Product quantization-based approaches are effective to encode high-dimensional data points for approximate nearest neighbor search. The space is decomposed into a Cartesian product of low-dimensional subspaces, each of w…

Quantization

Domain-conditioned and Temporal-guided Diffusion Modeling for Accelerated Dynamic MRI Reconstruction

2025-01-16 · Liping Zhang, Iris Yuwen Zhou, Sydney B. Montesi, Li Feng 외

Purpose: To propose a domain-conditioned and temporal-guided diffusion modeling method, termed dynamic Diffusion Modeling (dDiMo), for accelerated dynamic MRI reconstruction, enabling diffusion process to characterize sp…

MRI Reconstruction

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

2022-12-19 · Silpa Babu, Sajan Goud Lingala, Namrata Vaswani

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 th…

Compressive Sensing

Adaptive Learning in Cartesian Product of Reproducing Kernel Hilbert Spaces

2014-08-05 · Masahiro Yukawa

We propose a novel adaptive learning algorithm based on iterative orthogonal projections in the Cartesian product of multiple reproducing kernel Hilbert spaces (RKHSs). The task is estimating/tracking nonlinear functions…

Correlation uncertainty: a decision-theoretic approach

2025-03-17 · Gerrit Bauch, Lorenz Hartmann

We provide a decision-theoretic foundation for uncertainty about the correlation structure on a Cartesian product of probability spaces. Our contribution is two-fold: we first provide a full characterization of the set o…