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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Lv GUO, Yin LI, Jie YANG, Li LU, "Hole-Filling by Rank Sparsity Tensor Decomposition for Medical Imaging" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 2, pp. 396-399, February 2011, doi: 10.1587/transinf.E94.D.396.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.396/_p
Copy
@ARTICLE{e94-d_2_396,
author={Lv GUO, Yin LI, Jie YANG, Li LU, },
journal={IEICE TRANSACTIONS on Information},
title={Hole-Filling by Rank Sparsity Tensor Decomposition for Medical Imaging},
year={2011},
volume={E94-D},
number={2},
pages={396-399},
abstract={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.},
keywords={},
doi={10.1587/transinf.E94.D.396},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Hole-Filling by Rank Sparsity Tensor Decomposition for Medical Imaging
T2 - IEICE TRANSACTIONS on Information
SP - 396
EP - 399
AU - Lv GUO
AU - Yin LI
AU - Jie YANG
AU - Li LU
PY - 2011
DO - 10.1587/transinf.E94.D.396
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2011
AB - 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.
ER -