Multiple Low-Ranks plus Sparsity based Tensor Reconstruction for Dynamic MRI

Shan Wu, Yipeng Liu, Tengteng Liu, Fei Wen, Sayuan Liang, Xiang Zhang, Shuai Wang, Ce Zhu
{"title":"Multiple Low-Ranks plus Sparsity based Tensor Reconstruction for Dynamic MRI","authors":"Shan Wu, Yipeng Liu, Tengteng Liu, Fei Wen, Sayuan Liang, Xiang Zhang, Shuai Wang, Ce Zhu","doi":"10.1109/ICDSP.2018.8631646","DOIUrl":null,"url":null,"abstract":"Dynamic magnetic resonance imaging (DMRI) sequence can be represented as the sum of a low-rank component and a sparse tensor component. To exploit the low rank structure in multi-way data, the current works use either the Tucker rank or the CANDECOMP/PARAFAC (CP) rank for the low rank tensor component. In fact, these two kinds of tensor ranks represent different structures in high-dimensional data. In this paper, We propose a multiple low ranks plus sparsity based tensor reconstruction method for DMRI. The simultaneous minimization of both CP and Tucker ranks can better exploit multi-dimensional coherence in the low rank component of DMRI data, and the sparse component is regularized by the tensor total variation minimization. The reconstruction optimization model can be divided into two sub-problems to iteratively calculate the low rank and sparse components. For the sub-problem about low rank tensor component, the rank-one tensor updating and sum of nuclear norm minimization methods are used to solve it. To obtain the sparse tensor component, the primal dual method is used. We compare the proposed method with four state-of-the-art ones, and experimental results show that the proposed method can achieve better reconstruction quality than state-of-the-art ones.","PeriodicalId":218806,"journal":{"name":"2018 IEEE 23rd International Conference on Digital Signal Processing (DSP)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 23rd International Conference on Digital Signal Processing (DSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2018.8631646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Dynamic magnetic resonance imaging (DMRI) sequence can be represented as the sum of a low-rank component and a sparse tensor component. To exploit the low rank structure in multi-way data, the current works use either the Tucker rank or the CANDECOMP/PARAFAC (CP) rank for the low rank tensor component. In fact, these two kinds of tensor ranks represent different structures in high-dimensional data. In this paper, We propose a multiple low ranks plus sparsity based tensor reconstruction method for DMRI. The simultaneous minimization of both CP and Tucker ranks can better exploit multi-dimensional coherence in the low rank component of DMRI data, and the sparse component is regularized by the tensor total variation minimization. The reconstruction optimization model can be divided into two sub-problems to iteratively calculate the low rank and sparse components. For the sub-problem about low rank tensor component, the rank-one tensor updating and sum of nuclear norm minimization methods are used to solve it. To obtain the sparse tensor component, the primal dual method is used. We compare the proposed method with four state-of-the-art ones, and experimental results show that the proposed method can achieve better reconstruction quality than state-of-the-art ones.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多低秩和稀疏度的动态MRI张量重建
动态磁共振成像序列可以表示为一个低秩分量和一个稀疏张量分量的和。为了利用多路数据中的低秩结构,目前的工作使用Tucker秩或CANDECOMP/PARAFAC (CP)秩作为低秩张量分量。实际上,这两种张量秩在高维数据中代表了不同的结构。本文提出了一种基于多低秩和稀疏度的DMRI张量重建方法。同时最小化CP秩和Tucker秩可以更好地利用DMRI数据低秩分量的多维相干性,稀疏分量通过张量总变差最小化进行正则化。重构优化模型可分为两个子问题,迭代计算低秩稀疏分量。对于低秩张量分量的子问题,采用秩一张量更新法和核范数最小化求和法求解。为了获得稀疏张量分量,采用了原始对偶方法。将该方法与现有的四种方法进行了比较,实验结果表明,该方法比现有方法具有更好的重建质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A High-Throughput QC-LDPC Decoder for Near-Earth Application Face Recognition Based on Stacked Convolutional Autoencoder and Sparse Representation Internet of Remote Things: A Communication Scheme for Air-to-Ground Information Dissemination Deep Learning for Automatic IC Image Analysis A 4-D Sparse FIR Hyperfan Filter for Volumetric Refocusing of Light Fields by Hard Thresholding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1