Fast reconstruction algorithm of magnetic resonance imaging based on wavelet tree sparsity structure

DOI10.15983/J.CNKI.JSNU.2020.02.030MaRDI QIDQ4984529zbMATH OpenFDO

Authors Zhongwen Bao, Jizhong Duan, Jundong Yang

Publication date 26 April 2021

Full work available at URL https://doi.org/10.15983/J.CNKI.JSNU.2020.02.030

zbMATH Keywords

alternating direction method of multiplierscompressed sensingmagnetic resonance imagingwavelet tree sparsity

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Efficient dual ADMMs for sparse compressive sensing MRI reconstruction
• A novel method and fast algorithm for MR image reconstruction with significantly under-sampled data
• Weighted two-level Bregman method with graph regularized sparse coding for MRI reconstruction
• MR image reconstruction based on iterative split Bregman algorithm and nonlocal total variation
• An efficient Peaceman-Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction

Cited in

(1)

• PF-FICOTA-SENSE: an MRI fast reconstruction method

This page was built for publication: Fast reconstruction algorithm of magnetic resonance imaging based on wavelet tree sparsity structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4984529)