DPFNet: Fast Reconstruction of Multi-Coil MRI Based on Dual Domain Parallel Fusion Network
Bibliographic record
Abstract
There are relatively few studies on the multi-coil reconstruction task of existing Magnetic Resonance Imaging (MRI) methods, as there are problems with insufficient reconstruction details, high memory occupation during training, etc. Therefore, a new Dual-domain Parallel Fusion Reconstruction Network (DPFNet) is proposed in this paper. The whole network consists of coil sensitivity graph estimation module, dual domain feature extraction module, dual domain dynamic error correction module, and dual domain dynamic fusion module. A U-Net has been used as the backbone network. The network reconstructs under-sampled MRI images and K-space data simultaneously in two branches of the image domain and K-space domain, and the fusion module realizes the reconstruction information interaction between the two branches. In addition, a new dual domain consistency loss is also proposed, which reduces the error between the same MRI slice image and K-space data with dual domain output, and achieves high quality reconstruction. In this paper, a series of comparative experiments and ablation experiments are conducted in the open Calgary-Campinas-359 brain MRI data set. The results of the experiments show that the proposed DPFNet achieves the most advanced level at present and is superior to other traditional algorithms and reconstruction methods based on deep learning. In particular, the reconstruction results from Cartesian sampling are very good.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".