首页> 外文会议>International Conference on E-Product E-Service and E-Entertainment >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 11-31. Considering that medical image, e.g. CT or MRI, has the natural form of tensor, we recognize the problem of medical hole-filling as the extension of PCP problem from matrix case to tensor case. Since the new problem in tensor case is much more difficult than the matrix case, we design an efficient algorithm for the extension 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 to 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 result.
机译:3D医疗数据的表面完整性对于手术模拟或虚拟诊断至关重要。然而,由于对扫描仪对体内的外部损坏或可访问性限制,通常存在不良孔。为了弥补差距,近年来,医学成像的孔填充是一个流行的研究主题11-31。考虑到医学图像,例如医学图像。 CT或MRI,具有张量的自然形式,我们认识到医疗孔填充的问题作为从矩阵案例到张量案例的PCP问题的延伸。由于张量案例中的新问题比矩阵箱更困难,因此我们通过放松技术设计了一个高效的延伸算法。我们的算法中最重要的特点是,与遵循严格本地方法的传统方法不同,我们的方法通过特定医疗数据的全局结构来修复孔。对先前算法[4]的另一个重要差异是我们的算法能够以隐式方式自动将已完成的数据与孔分离。我们的实验表明,所提出的方法可以导致令人满意的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号