{"title":"An accelerated alternating direction method of multiplier for MRI with TV regularisation","authors":"ZhiBin Zhu , YueHong Ding , Ying Liu , JiaQi Huang","doi":"10.1016/j.mri.2024.110249","DOIUrl":null,"url":null,"abstract":"<div><div>Compressed Sensing (CS) is important in the field of image processing and signal processing, and CS-Magnetic Resonance Imaging (MRI) is used to reconstruct image from undersampled k-space data. Total Variation (TV) regularisation is a common technique to improve the sparsity of image, and the Alternating Direction Multiplier Method (ADMM) plays a key role in the variational image processing problem. This paper aims to improve the quality of MRI and shorten the reconstruction time. We consider MRI to solve a linear inverse problem, we convert it into a constrained optimization problem based on TV regularisation, then an accelerated ADMM is established. Through a series of theoretical derivations, we verify that the algorithm satisfies the convergence rate of <span><math><mi>O</mi><mfenced><mrow><mn>1</mn><mo>/</mo><msup><mi>k</mi><mn>2</mn></msup></mrow></mfenced></math></span> under the condition that one objective function is quadratically convex and the other is strongly convex. We select five undersampled templates for testing in MRI experiment and compare it with other algorithms, experimental results show that our proposed method not only improves the running speed but also gives better reconstruction results.</div></div>","PeriodicalId":18165,"journal":{"name":"Magnetic resonance imaging","volume":"114 ","pages":"Article 110249"},"PeriodicalIF":2.1000,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Magnetic resonance imaging","FirstCategoryId":"3","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0730725X24002303","RegionNum":4,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"RADIOLOGY, NUCLEAR MEDICINE & MEDICAL IMAGING","Score":null,"Total":0}
引用次数: 0
Abstract
Compressed Sensing (CS) is important in the field of image processing and signal processing, and CS-Magnetic Resonance Imaging (MRI) is used to reconstruct image from undersampled k-space data. Total Variation (TV) regularisation is a common technique to improve the sparsity of image, and the Alternating Direction Multiplier Method (ADMM) plays a key role in the variational image processing problem. This paper aims to improve the quality of MRI and shorten the reconstruction time. We consider MRI to solve a linear inverse problem, we convert it into a constrained optimization problem based on TV regularisation, then an accelerated ADMM is established. Through a series of theoretical derivations, we verify that the algorithm satisfies the convergence rate of under the condition that one objective function is quadratically convex and the other is strongly convex. We select five undersampled templates for testing in MRI experiment and compare it with other algorithms, experimental results show that our proposed method not only improves the running speed but also gives better reconstruction results.
压缩传感(CS)在图像处理和信号处理领域非常重要,CS-磁共振成像(MRI)用于从欠采样 k 空间数据重建图像。总变异(TV)正则化是改善图像稀疏性的常用技术,而交替方向乘法器法(ADMM)在变异图像处理问题中发挥着关键作用。本文旨在提高核磁共振成像的质量并缩短重建时间。我们认为核磁共振成像求解的是一个线性逆问题,我们将其转换为一个基于 TV 正则化的约束优化问题,然后建立了一个加速 ADMM。通过一系列理论推导,我们验证了在一个目标函数为二次凸函数,另一个目标函数为强凸函数的条件下,算法的收敛速度满足 O1/k2。在核磁共振成像实验中,我们选择了五个欠采样模板进行测试,并与其他算法进行了比较,实验结果表明,我们提出的方法不仅提高了运行速度,而且得到了更好的重建结果。
期刊介绍:
Magnetic Resonance Imaging (MRI) is the first international multidisciplinary journal encompassing physical, life, and clinical science investigations as they relate to the development and use of magnetic resonance imaging. MRI is dedicated to both basic research, technological innovation and applications, providing a single forum for communication among radiologists, physicists, chemists, biochemists, biologists, engineers, internists, pathologists, physiologists, computer scientists, and mathematicians.