Can a random weighted deep network structure encode informative cues to solve the MR reconstruction problem from highly under-sampled k-space measurements? Trained networks update the weights at training time, while untrained networks optimize the weights at inference time. In contrast, our proposed methodology selects an optimal subnetwork from a randomly weighted dense network to perform MR reconstruction without updating the weights - neither at training time nor at inference time. The methodology does not require ground truth data and shows excellent performance across domains in T1-weighted (head, knee) images from highly under-sampled multi-coil k-space measurements.
How to access this content:
For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.
After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.
After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.
Keywords