...
首页> 外文期刊>IEICE Transactions on Information and Systems >Hole-Filling by Rank Sparsity Tensor Decomposition for Medical Imaging
【24h】

Hole-Filling by Rank Sparsity Tensor Decomposition for Medical Imaging

机译:基于秩稀疏张量分解的医学成像空穴填充

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Surface integrity of 3D medical data is crucial for surgery simulation or virtual diagnoses. However, undesirable holes often exist due to external damage on bodies or accessibility limitation on scanners. To bridge the gap, hole-filling for medical imaging is a popular research topic in recent years [1]-[3]. Considering that a medical image, e.g. CT or MRI, has the natural form of a tensor, we recognize the problem of medical hole-filling as the extension of Principal Component Pursuit (PCP) problem from matrix case to tensor case. Since the new problem in the tensor case is much more difficult than the matrix case, an efficient algorithm for the extension is presented by relaxation technique. The most significant feature of our algorithm is that unlike traditional methods which follow a strictly local approach, our method fixes the hole by the global structure in the specific medical data. Another important difference from the previous algorithm [4] is that our algorithm is able to automatically separate the completed data from the hole in an implicit manner. Our experiments demonstrate that the proposed method can lead to satisfactory results.
机译:3D医学数据的表面完整性对于手术模拟或虚拟诊断至关重要。但是,由于机身的外部损坏或扫描仪的可及性限制,经常会出现不希望的孔。为了弥合差距,近年来医学成像中的孔填充是一个热门的研究课题[1]-[3]。考虑到医学图像,例如CT或MRI具有张量的自然形式,我们认识到医疗空洞填充问题是主成分追踪(PCP)问题从矩阵到张量的扩展。由于张量情况下的新问题比矩阵情况下困难得多,因此通过松弛技术提出了一种有效的扩展算法。我们算法的最大特点是,与遵循严格局部方法的传统方法不同,我们的方法通过特定医学数据中的全局结构来修复漏洞。与先前算法[4]的另一个重要区别是我们的算法能够以隐式方式自动将完成的数据与孔分离。我们的实验表明,提出的方法可以产生令人满意的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号