Weighted two-level Bregman method with graph regularized sparse coding for MRI reconstruction

DOI10.3724/SP.J.1249.2016.02119MaRDI QIDQ2824325zbMATH OpenFDO

Authors Minghui Zhang, Kai Xiao, Hongyang Lu, Xiaoling Xu

Publication date 6 October 2016

Published in Journal of Shenzhen University. Science \& Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1249.2016.02119

zbMATH Keywords

alternating direction methodcompressed sensingdictionary learningimage processingmagnetic resonance imaging

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Biomedical imaging and signal processing (92C55)

Recommendations

• A novel method and fast algorithm for MR image reconstruction with significantly under-sampled data
• Efficient dual ADMMs for sparse compressive sensing MRI reconstruction
• MR image reconstruction based on iterative split Bregman algorithm and nonlocal total variation
• Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
• Convolutional Sparse Coding in Gradient Domain for MRI Reconstruction

Cited in

(5)

• Sparse-representation-based direct minimum \(L^p\)-norm algorithm for MRI phase unwrapping
• A two-level Bregmanized method for image interpolation with graph regularized sparse coding
• Convolutional Sparse Coding in Gradient Domain for MRI Reconstruction
• Fast reconstruction algorithm of magnetic resonance imaging based on wavelet tree sparsity structure
• An improved GRAPPA algorithm based on the correlation between multi-coil images

This page was built for publication: Weighted two-level Bregman method with graph regularized sparse coding for MRI reconstruction

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