Searcharxiv⌕ Search

arXiv subjects

Efe Ilıcak

Publications and source records attributed to Efe Ilıcak.

8 recordsLinked to original sources

Data-Efficient Networks for Multi-Contrast MRI Reconstruction based on a Generalized Content/Style Prior

Multi-contrast MR scans contain redundant structural information that can be leveraged during reconstruction and potentially accelerate acquisition times. This idea has inspired end-to-end guided reconstruction models, leveraging one or more contrasts to guide the reconstruction of a different contrast. However, these models require large paired multi-contrast raw datasets for training, limiting their application in low-data regimes. In this work, we propose a modular framework, namely CoSMo-RecNet, for learning guided reconstruction models in the low-data regime. At its core is a reusable multi-contrast representation based on a content/style model, which can be learned from large-scale, publicly accessible, unpaired multi-contrast image datasets, without available k-space data. Using this frozen model as a multi-contrast prior and using a set of reference contrasts, the reconstruction problem reduces to a much simpler refinement problem that can be solved by a lightweight unrolled network and thus learned from small, task-specific reconstruction datasets. We demonstrate the efficacy of CoSMo-RecNet by evaluating it on the low-field 0.3 T M4Raw dataset, showing stable reconstruction quality on decreasing the raw training data budget. CoSMo-RecNet achieved higher reconstruction quality with 5 training subjects or lower compared to a parameter-count-matched MoDL trained on 100 subjects. On a data-limited and severely out-of-distribution ultra-low-field 47 mT Halbach scanner dataset, CoSMo-RecNet was superior to other viable strategies, including classical reconstruction, transfer learning, and zero-shot reconstruction.

eess.IV↗

Deep Unrolled Networks in Representation Space Applied to MRI Reconstruction

Deep unrolled networks (DUNs) integrate physical forward models with learned regularization in cascaded network architectures, achieving exceptional performance in inverse problems while maintaining interpretability. While most DUNs operate in the object domain (e.g., image space), recent variants explored representation spaces for improved information flow. However, these methods rely on heuristic methods for data consistency (DC), sacrificing fidelity with measurements. In this work, we introduce DUNE (Deep Unrolled Networks in rEpresentation space), a framework that maintains exact adherence to physical measurements while operating in learned representation spaces. By deriving the DC gradient via the chain rule and implementing it through the Vector-Jacobian Product (VJP), we enable exact backpropagation of measurement residuals into the representation space. This formulation supports diverse architectural backbones, including pre-trained encoders to guide the iterative process. We assess DUNE against state-of-the-art baselines on accelerated MRI reconstruction tasks, demonstrating that exact VJP-based gradients yield superior reconstruction quality and structural fidelity across both single-channel portable low-field and multi-channel clinical high-field MRI acquisitions. The code will be available upon publication at https://github.com/EfeIlicak/DUNE.

eess.IV↗

Physics-Guided Dual-Domain Network with Attention-Based Fusion for Portable MRI Reconstruction

Portable low-field magnetic resonance imaging (MRI) systems have gained renewed interest owing to their cost effectiveness and point-of-care imaging capabilities. Yet, portable MRI systems suffer from relatively low signal-to-noise ratio and limited hardware capabilities. While previous works have proposed the use of deep learning based reconstruction methods to improve low-field image quality, these operated only in the image-domain. Unlike other imaging modalities, MRI directly acquires data in the Fourier-domain (k-space), and exploiting both k-space and image-domain information can improve reconstruction quality. Here, we introduce DUN-DD, a novel physics-guided 3D network for portable MRI reconstruction, with parallel dual-domain branches whose outputs are combined together via an attention-based fusion network. To demonstrate the performance of the proposed method, we present \textit{in vivo} reconstructions obtained from both emulated datasets as well as images acquired with a 47mT Halbach-based portable MRI system. Our results show that DUN-DD outperforms state-of-the-art classical, data-driven, and physics-guided methods on both emulated and real portable MRI acquisitions.

physics.med-ph↗

Physics-Informed Deep Unrolled Network for Portable MR Image Reconstruction

Magnetic resonance imaging (MRI) is the gold standard imaging modality for numerous diagnostic tasks, yet its usefulness is tempered due to its high cost and infrastructural requirements. Low-cost very-low-field portable scanners offer new opportunities, while enabling imaging outside conventional MRI suites. However, achieving diagnostic-quality images in clinically acceptable scan times remains challenging with these systems. Therefore methods for improving the image quality while reducing the scan duration are highly desirable. Here, we investigate a physics-informed 3D deep unrolled network for the reconstruction of portable MR acquisitions. Our approach includes a novel network architecture that utilizes momentum-based acceleration and leverages complex conjugate symmetry of k-space for improved reconstruction performance. Comprehensive evaluations on emulated datasets as well as 47mT portable MRI acquisitions demonstrate the improved reconstruction quality of the proposed method compared to existing methods.

physics.med-ph↗

An imageless magnetic resonance framework for fast and cost-effective decision-making

Magnetic Resonance Imaging (MRI) is the gold standard in countless diagnostic procedures, yet hardware complexity, long scans, and cost preclude rapid screening and point-of-care use. We introduce Imageless Magnetic Resonance Diagnosis (IMRD), a framework that bypasses k-space sampling and image reconstruction by analyzing raw one-dimensional MR signals. We identify potentially impactful embodiments where IMRD requires only optimized pulse sequences for time-domain contrast, minimal low-field hardware, and pattern recognition algorithms to answer clinical closed queries and quantify lesion burden. As a proof of concept, we simulate multiple sclerosis lesions in silico within brain phantoms and deploy two extremely fast protocols (approximately 3 s), with and without spatial information. A 1D convolutional neural network achieves AUC close to 0.95 for lesion detection and R2 close to 0.99 for volume estimation. We also perform robustness tests under reduced signal-to-noise ratio, partial signal omission, and relaxation-time variability. By reframing MR signals as direct diagnostic metrics, IMRD paves the way for fast, low-cost MR screening and monitoring in resource-limited environments.

physics.med-ph↗

Scalable Learning-Based Sampling Optimization for Compressive Dynamic MRI

Compressed sensing applied to magnetic resonance imaging (MRI) allows to reduce the scanning time by enabling images to be reconstructed from highly undersampled data. In this paper, we tackle the problem of designing a sampling mask for an arbitrary reconstruction method and a limited acquisition budget. Namely, we look for an optimal probability distribution from which a mask with a fixed cardinality is drawn. We demonstrate that this problem admits a compactly supported solution, which leads to a deterministic optimal sampling mask. We then propose a stochastic greedy algorithm that (i) provides an approximate solution to this problem, and (ii) resolves the scaling issues of [1,2]. We validate its performance on in vivo dynamic MRI with retrospective undersampling, showing that our method preserves the performance of [1,2] while reducing the computational burden by a factor close to 200.

eess.IV↗

Learning-Based Compressive MRI

In the area of magnetic resonance imaging (MRI), an extensive range of non-linear reconstruction algorithms have been proposed that can be used with general Fourier subsampling patterns. However, the design of these subsampling patterns has typically been considered in isolation from the reconstruction rule and the anatomy under consideration. In this paper, we propose a learning-based framework for optimizing MRI subsampling patterns for a specific reconstruction rule and anatomy, considering both the noiseless and noisy settings. Our learning algorithm has access to a representative set of training signals, and searches for a sampling pattern that performs well on average for the signals in this set. We present a novel parameter-free greedy mask selection method, and show it to be effective for a variety of reconstruction rules and performance metrics. Moreover we also support our numerical findings by providing a rigorous justification of our framework via statistical learning theory.

eess.IV↗

Fast 3D Variable-FOV Reconstruction for Parallel Imaging with Localized Sensitivities

Several successful iterative approaches have recently been proposed for parallel-imaging reconstructions of variable-density (VD) acquisitions, but they often induce substantial computational burden for non-Cartesian data. Here we propose a generalized variable-FOV PILS reconstruction 3D VD Cartesian and non-Cartesian data. The proposed method separates k-space into non-intersecting annuli based on sampling density, and sets the 3D reconstruction FOV for each annulus based on the respective sampling density. The variable-FOV method is compared against conventional gridding, PILS, and ESPIRiT reconstructions. Results indicate that the proposed method yields better artifact suppression compared to gridding and PILS, and improves noise conditioning relative to ESPIRiT, enabling fast and high-quality reconstructions of 3D datasets.

physics.med-ph↗