Metraipolis › archive › dc_ae9f2075bf7d
Hankel Subspace Self-Supervised Learning for Parallel MRI Reconstruction — arXiv:2610.11560
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11560
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:30:34.712Z
- SHA-256 of the archived text
4f363d9c769e1cf55847e0c103398d1f67dca28532a545d2eee0b0e2a04d5b24- Stable URL of this page
https://metraipolis.com/documento/dc_ae9f2075bf7d
How to cite
Hankel Subspace Self-Supervised Learning for Parallel MRI Reconstruction — arXiv:2610.11560 — arXiv (en), https://arxiv.org/abs/2610.11560 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ae9f2075bf7d (Metraipolis archive dc_ae9f2075bf7d, sha256 4f363d9c769e1cf55847e0c103398d1f67dca28532a545d2eee0b0e2a04d5b24)
BibTeX
@misc{dcae9f2075bf7d,
title = {Hankel Subspace Self-Supervised Learning for Parallel MRI Reconstruction — arXiv:2610.11560},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11560},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ae9f2075bf7d; sha256 4f363d9c769e1cf55847e0c103398d1f67dca28532a545d2eee0b0e2a04d5b24},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11560. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Parallel magnetic resonance imaging reconstruction is an ill-posed inverse problem under undersampling. Multi-coil acquisition and Hankel lifting expose complementary repeated information: observations of the same anatomy across coils and repeated local k-space neighborhoods in overlapping windows. These dependencies guide recovery of missing k-space data. However, splitting lifted Hankel entries for self-supervision can place the original sample in both input and target, causing data leakage. We propose Hankel Subspace Self-Supervised Reconstruction (HSSRecon), a scan-specific reconstruction framework for parallel magnetic resonance imaging. HSSRecon partitions data by physical acquisition units before Hankel lifting and applies multiplicity normalization to repeated Hankel copies in overlapping windows. Rather than learning a mapping that directly predicts missing data, the network learns a compact complex-valued Hankel subspace operator. Reconstruction is performed over the original k-space variables using a conjugategradient solver with hard data consistency. This design separates structural learning in the Hankel domain from data consistency in the physical domain: the former exploits multi-coil and local Hankel correlations, while the latter solves over unacquired degrees of freedom. We provide theoretical analyses of physicalgroup splitting and multiplicity normalization, and establish positive definiteness, uniqueness, hard data consistency, and a finite-step conjugate-gradient error bound for the system. On fastMRI brain data with three contrasts and three sampling masks, HSSRecon achieves competitive peak signal-to-noise ratio, structural similarity, and normalized mean squared error across six aggregated conditions. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.CV, nuovi lavori del giorno). Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV). Pagina del lavoro: https://arxiv.org/abs/2610.11560 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:55:07.405Z dalla pagina https://arxiv.org/list/cs.CV/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).