基于紧凑小波帧变换的GPGPU加速压缩感知磁共振成像重建技术

B. Hu, X. Ma, M. Joyce, P. Glover, B. Naleem
{"title":"基于紧凑小波帧变换的GPGPU加速压缩感知磁共振成像重建技术","authors":"B. Hu, X. Ma, M. Joyce, P. Glover, B. Naleem","doi":"10.1109/IST.2012.6295566","DOIUrl":null,"url":null,"abstract":"High resolution Magnetic Resonance Imaging (MRI) requires long acquisition time to obtain the fully sampled k-space data for image reconstruction. Compressed Sensing (CS) theory has recently been utilized to accelerate the image reconstruction speed by sparsely sampling the k-space. In this work, the CS framework was combined with the Tight Wavelet Frame (TWF) transform to further enhance edges/boundaries of MR images and reduce their noise levels. Because the TWF coefficients at finer scale correspond to important image boundary features, the proposed algorithm is able to effectively enhance the signal to noise ratio of MR images without blurring their edges or create artifacts. The resulting constrained minimization problem is then solved iteratively and requires extensive computational resources. To accelerate the reconstruction for real-time medical image processing purpose, the algorithm is implemented on the General Purpose Graphic Processing Units (GPGPU). The effects of various factors, including the register counts and block size, on the GPU occupancy have been investigated to tune the hardware for the optimum performance. The proposed algorithm demonstrates great potential to accelerate the MR imaging acquisition by 8-fold without noticeable artifacts. Comparisons with other two l1 minimization methods with traditional wavelet transforms further confirm the competitiveness of the proposed algorithm. Moreover, a speedup of 45 times was achieved by the GPGPU implementation compared with the CPU version, and therefore making this algorithm suitable for applications in a clinical MRI setting.","PeriodicalId":213330,"journal":{"name":"2012 IEEE International Conference on Imaging Systems and Techniques Proceedings","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A GPGPU accelerated compressed sensing with tight wavelet frame transform technique for MR imaging reconstruction\",\"authors\":\"B. Hu, X. Ma, M. Joyce, P. Glover, B. Naleem\",\"doi\":\"10.1109/IST.2012.6295566\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"High resolution Magnetic Resonance Imaging (MRI) requires long acquisition time to obtain the fully sampled k-space data for image reconstruction. Compressed Sensing (CS) theory has recently been utilized to accelerate the image reconstruction speed by sparsely sampling the k-space. In this work, the CS framework was combined with the Tight Wavelet Frame (TWF) transform to further enhance edges/boundaries of MR images and reduce their noise levels. Because the TWF coefficients at finer scale correspond to important image boundary features, the proposed algorithm is able to effectively enhance the signal to noise ratio of MR images without blurring their edges or create artifacts. The resulting constrained minimization problem is then solved iteratively and requires extensive computational resources. To accelerate the reconstruction for real-time medical image processing purpose, the algorithm is implemented on the General Purpose Graphic Processing Units (GPGPU). The effects of various factors, including the register counts and block size, on the GPU occupancy have been investigated to tune the hardware for the optimum performance. The proposed algorithm demonstrates great potential to accelerate the MR imaging acquisition by 8-fold without noticeable artifacts. Comparisons with other two l1 minimization methods with traditional wavelet transforms further confirm the competitiveness of the proposed algorithm. Moreover, a speedup of 45 times was achieved by the GPGPU implementation compared with the CPU version, and therefore making this algorithm suitable for applications in a clinical MRI setting.\",\"PeriodicalId\":213330,\"journal\":{\"name\":\"2012 IEEE International Conference on Imaging Systems and Techniques Proceedings\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Imaging Systems and Techniques Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IST.2012.6295566\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Imaging Systems and Techniques Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IST.2012.6295566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

高分辨率核磁共振成像(MRI)需要长时间收购获得完全k-space采样数据进行图像重建。压缩感知(CS)理论最近利用加速k-space稀疏采样的图像重建速度。在这项工作中,CS框架与紧密小波框架(TWF)变换相结合,进一步增强MR图像的边缘/边界并降低其噪声水平。由于较小尺度下的TWF系数对应于重要的图像边界特征,因此该算法能够有效地提高MR图像的信噪比,而不会模糊图像边缘或产生伪影。由此产生的约束最小化问题需要迭代求解,并且需要大量的计算资源。为了加速医学图像的实时重建,该算法在通用图形处理单元(GPGPU)上实现。研究了各种因素(包括寄存器计数和块大小)对GPU占用的影响,以调整硬件以获得最佳性能。该算法在不产生明显伪影的情况下,将磁共振成像采集速度提高了8倍。比较与其他两个l1最小化方法与传统的小波变换进一步证实该算法的竞争力。此外,与CPU版本相比,GPGPU实现的速度提高了45倍,因此使该算法适用于临床MRI设置的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A GPGPU accelerated compressed sensing with tight wavelet frame transform technique for MR imaging reconstruction
High resolution Magnetic Resonance Imaging (MRI) requires long acquisition time to obtain the fully sampled k-space data for image reconstruction. Compressed Sensing (CS) theory has recently been utilized to accelerate the image reconstruction speed by sparsely sampling the k-space. In this work, the CS framework was combined with the Tight Wavelet Frame (TWF) transform to further enhance edges/boundaries of MR images and reduce their noise levels. Because the TWF coefficients at finer scale correspond to important image boundary features, the proposed algorithm is able to effectively enhance the signal to noise ratio of MR images without blurring their edges or create artifacts. The resulting constrained minimization problem is then solved iteratively and requires extensive computational resources. To accelerate the reconstruction for real-time medical image processing purpose, the algorithm is implemented on the General Purpose Graphic Processing Units (GPGPU). The effects of various factors, including the register counts and block size, on the GPU occupancy have been investigated to tune the hardware for the optimum performance. The proposed algorithm demonstrates great potential to accelerate the MR imaging acquisition by 8-fold without noticeable artifacts. Comparisons with other two l1 minimization methods with traditional wavelet transforms further confirm the competitiveness of the proposed algorithm. Moreover, a speedup of 45 times was achieved by the GPGPU implementation compared with the CPU version, and therefore making this algorithm suitable for applications in a clinical MRI setting.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信