SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2403.10064 · CVPR · 2024

Progressive Divide-and-Conquer via Subsampling Decomposition for Accelerated MRI

Yufei Wang, Hao Cheng, Chong Wang, Yi Yu, Lanqing Guo, Bihan Wen

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 6 functions out of this paper's own repositories and ran 6 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
ChongWang1024/PDAC canonical 6 of 6
FunctionStatusWhere it lives
batched_mask_center Ran ChongWang1024/PDAC/models/humus_net_pdac.py
pointer only (licence: NONE) · get_code("f8ec18034e33feb4")
load_args_from_config Ran ChongWang1024/PDAC/pdac_examples/utils.py
pointer only (licence: NONE) · get_code("1b315f2b67a89eab")
mask_center Ran ChongWang1024/PDAC/models/humus_net_pdac.py
pointer only (licence: NONE) · get_code("bdf81e063710a085")
modulate Ran ChongWang1024/PDAC/models/humus_pdac_block.py
pointer only (licence: NONE) · get_code("03310bba324ae4fb")
window_partition Ran ChongWang1024/PDAC/models/humus_pdac_block.py
pointer only (licence: NONE) · get_code("f9fd6241d935f07b")
window_reverse Ran ChongWang1024/PDAC/models/humus_pdac_block.py
pointer only (licence: NONE) · get_code("fb32094c6dbece71")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Deep unfolding networks (DUN) have emerged as a popular iterative framework for accelerated magnetic resonance imaging (MRI) reconstruction. However, conventional DUN aims to reconstruct all the missing information within the entire null space in each iteration. Thus it could be challenging when dealing with highly ill-posed degradation, often resulting in subpar reconstruction. In this work, we propose a Progressive Divide-And-Conquer (PDAC) strategy, aiming to break down the subsampling process in the actual severe degradation and thus perform reconstruction sequentially. Starting from decomposing the original maximum-a-posteriori problem of accelerated MRI, we present a rigorous derivation of the proposed PDAC framework, which could be further unfolded into an end-to-end trainable network. Each PDAC iteration specifically targets a distinct segment of moderate degradation, based on the decomposition. Furthermore, as part of the PDAC iteration, such decomposition is adaptively learned as an auxiliary task through a degradation predictor which provides an estimation of the decomposed sampling mask. Following this prediction, the sampling mask is further integrated via a severity conditioning module to ensure awareness of the degradation severity at each stage. Extensive experiments demonstrate that our proposed method achieves superior performance on the publicly available fastMRI and Stanford2D FSE datasets in both multi-coil and single-coil settings. Code is available at https://github.com/ChongWang1024/PDAC.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2403.10064")
get_code_for_paper("2403.10064")
have("2403.10064")

Connect an agent — have() is free.