1
|
Li L, Sun H, Yao Y, Chen Z. Noise characterization analysis of dynamic dual-energy CT and its advantage in suppressing statistical noise. Phys Med Biol 2024; 69:185004. [PMID: 39137803 DOI: 10.1088/1361-6560/ad6eda] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/19/2023] [Accepted: 08/13/2024] [Indexed: 08/15/2024]
Abstract
Objective.Multi-energy CT conducted by photon-counting detector has a wide range of applications, especially in multiple contrast agents imaging. However, static multi-energy (SME) CT imaging suffers from higher statistical noise because of increased energy bins with static energy thresholds. Our team has proposed a dynamic dual-energy (DDE) CT detector model and the corresponding iterative reconstruction algorithm to solve this problem. However, rigorous and detailed analysis of the statistical noise characterization in this DDE CT was lacked.Approach.Starting from the properties of the Poisson random variable, this paper analyzes the noise characterization of the DDE CT and compares it with the SME CT. It is proved that the multi-energy CT projections and reconstruction images calculated from the proposed DDE CT algorithm have less statistical noise than that of the SME CT.Main results.Simulations and experiments verify that the expectations of the multi-energy CT projections calculated from DDE CT are the same as those of the SME projections. Still, the variance of the former is smaller. We further analyze the convergence of the iterative DDE CT algorithm through simulations and prove that the derived noise characterization can be realized under different CT imaging configurations.Significance.The low statistical noise characteristics demonstrate the value of DDE CT imaging technology.
Collapse
Affiliation(s)
- Liang Li
- Department of Engineering Physics, Tsinghua University, Beijing 100084, People's Republic of China
- Key Laboratory of Particle and Radiation imaging (Tsinghua University), Ministry of Education, Beijing 100084, People's Republic of China
- Institute for Precision Medicine, Tsinghua University, Beijing 100084, People's Republic of China
| | - Huahai Sun
- Department of Engineering Physics, Tsinghua University, Beijing 100084, People's Republic of China
| | - Yidi Yao
- Department of Engineering Physics, Tsinghua University, Beijing 100084, People's Republic of China
- Key Laboratory of Particle and Radiation imaging (Tsinghua University), Ministry of Education, Beijing 100084, People's Republic of China
| | - Zhiqiang Chen
- Department of Engineering Physics, Tsinghua University, Beijing 100084, People's Republic of China
- Key Laboratory of Particle and Radiation imaging (Tsinghua University), Ministry of Education, Beijing 100084, People's Republic of China
| |
Collapse
|
2
|
Li X, Jing K, Yang Y, Wang Y, Ma J, Zheng H, Xu Z. Noise-Generating and Imaging Mechanism Inspired Implicit Regularization Learning Network for Low Dose CT Reconstrution. IEEE TRANSACTIONS ON MEDICAL IMAGING 2024; 43:1677-1689. [PMID: 38145543 DOI: 10.1109/tmi.2023.3347258] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/27/2023]
Abstract
Low-dose computed tomography (LDCT) helps to reduce radiation risks in CT scanning while maintaining image quality, which involves a consistent pursuit of lower incident rays and higher reconstruction performance. Although deep learning approaches have achieved encouraging success in LDCT reconstruction, most of them treat the task as a general inverse problem in either the image domain or the dual (sinogram and image) domains. Such frameworks have not considered the original noise generation of the projection data and suffer from limited performance improvement for the LDCT task. In this paper, we propose a novel reconstruction model based on noise-generating and imaging mechanism in full-domain, which fully considers the statistical properties of intrinsic noises in LDCT and prior information in sinogram and image domains. To solve the model, we propose an optimization algorithm based on the proximal gradient technique. Specifically, we derive the approximate solutions of the integer programming problem on the projection data theoretically. Instead of hand-crafting the sinogram and image regularizers, we propose to unroll the optimization algorithm to be a deep network. The network implicitly learns the proximal operators of sinogram and image regularizers with two deep neural networks, providing a more interpretable and effective reconstruction procedure. Numerical results demonstrate our proposed method improvements of > 2.9 dB in peak signal to noise ratio, > 1.4% promotion in structural similarity metric, and > 9 HU decrements in root mean square error over current state-of-the-art LDCT methods.
Collapse
|
3
|
Li XL, Chen MS, Wang CD, Lai JH. Refining Graph Structure for Incomplete Multi-View Clustering. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2024; 35:2300-2313. [PMID: 35839201 DOI: 10.1109/tnnls.2022.3189763] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/15/2023]
Abstract
As a challenging problem, incomplete multi-view clustering (MVC) has drawn much attention in recent years. Most of the existing methods contain the feature recovering step inevitably to obtain the clustering result of incomplete multi-view datasets. The extra target of recovering the missing feature in the original data space or common subspace is difficult for unsupervised clustering tasks and could accumulate mistakes during the optimization. Moreover, the biased error is not taken into consideration in the previous graph-based methods. The biased error represents the unexpected change of incomplete graph structure, such as the increase in the intra-class relation density and the missing local graph structure of boundary instances. It would mislead those graph-based methods and degrade their final performance. In order to overcome these drawbacks, we propose a new graph-based method named Graph Structure Refining for Incomplete MVC (GSRIMC). GSRIMC avoids recovering feature steps and just fully explores the existing subgraphs of each view to produce superior clustering results. To handle the biased error, the biased error separation is the core step of GSRIMC. In detail, GSRIMC first extracts basic information from the precomputed subgraph of each view and then separates refined graph structure from biased error with the help of tensor nuclear norm. Besides, cross-view graph learning is proposed to capture the missing local graph structure and complete the refined graph structure based on the complementary principle. Extensive experiments show that our method achieves better performance than other state-of-the-art baselines.
Collapse
|
4
|
Bousse A, Kandarpa VSS, Rit S, Perelli A, Li M, Wang G, Zhou J, Wang G. Systematic Review on Learning-based Spectral CT. IEEE TRANSACTIONS ON RADIATION AND PLASMA MEDICAL SCIENCES 2024; 8:113-137. [PMID: 38476981 PMCID: PMC10927029 DOI: 10.1109/trpms.2023.3314131] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 03/14/2024]
Abstract
Spectral computed tomography (CT) has recently emerged as an advanced version of medical CT and significantly improves conventional (single-energy) CT. Spectral CT has two main forms: dual-energy computed tomography (DECT) and photon-counting computed tomography (PCCT), which offer image improvement, material decomposition, and feature quantification relative to conventional CT. However, the inherent challenges of spectral CT, evidenced by data and image artifacts, remain a bottleneck for clinical applications. To address these problems, machine learning techniques have been widely applied to spectral CT. In this review, we present the state-of-the-art data-driven techniques for spectral CT.
Collapse
Affiliation(s)
- Alexandre Bousse
- LaTIM, Inserm UMR 1101, Université de Bretagne Occidentale, 29238 Brest, France
| | | | - Simon Rit
- Univ Lyon, INSA-Lyon, Université Claude Bernard Lyon 1, UJM-Saint Étienne, CNRS, Inserm, CREATIS UMR 5220, U1294, F-69373, Lyon, France
| | - Alessandro Perelli
- Department of Biomedical Engineering, School of Science and Engineering, University of Dundee, DD1 4HN, UK
| | - Mengzhou Li
- Biomedical Imaging Center, Rensselaer Polytechnic Institute, Troy, New York, USA
| | - Guobao Wang
- Department of Radiology, University of California Davis Health, Sacramento, USA
| | - Jian Zhou
- CTIQ, Canon Medical Research USA, Inc., Vernon Hills, 60061, USA
| | - Ge Wang
- Biomedical Imaging Center, Rensselaer Polytechnic Institute, Troy, New York, USA
| |
Collapse
|
5
|
He C, Wei Y, Guo K, Han H. Removal of Mixed Noise in Hyperspectral Images Based on Subspace Representation and Nonlocal Low-Rank Tensor Decomposition. SENSORS (BASEL, SWITZERLAND) 2024; 24:327. [PMID: 38257420 PMCID: PMC11154510 DOI: 10.3390/s24020327] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 11/16/2023] [Revised: 12/30/2023] [Accepted: 01/01/2024] [Indexed: 01/24/2024]
Abstract
Hyperspectral images (HSIs) contain abundant spectral and spatial structural information, but they are inevitably contaminated by a variety of noises during data reception and transmission, leading to image quality degradation and subsequent application hindrance. Hence, removing mixed noise from hyperspectral images is an important step in improving the performance of subsequent image processing. It is a well-established fact that the data information of hyperspectral images can be effectively represented by a global spectral low-rank subspace due to the high redundancy and correlation (RAC) in the spatial and spectral domains. Taking advantage of this property, a new algorithm based on subspace representation and nonlocal low-rank tensor decomposition is proposed to filter the mixed noise of hyperspectral images. The algorithm first obtains the subspace representation of the hyperspectral image by utilizing the spectral low-rank property and obtains the orthogonal basis and representation coefficient image (RCI). Then, the representation coefficient image is grouped and denoised using tensor decomposition and wavelet decomposition, respectively, according to the spatial nonlocal self-similarity. Afterward, the orthogonal basis and denoised representation coefficient image are optimized using the alternating direction method of multipliers (ADMM). Finally, iterative regularization is used to update the image to obtain the final denoised hyperspectral image. Experiments on both simulated and real datasets demonstrate that the algorithm proposed in this paper is superior to related mainstream methods in both quantitative metrics and intuitive vision. Because it is denoising for image subspace, the time complexity is greatly reduced and is lower than related denoising algorithms in terms of computational cost.
Collapse
Affiliation(s)
- Chun He
- College of Geophysics, Chengdu University of Technology, Chengdu 610059, China;
- Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Chengdu 610059, China;
- Education and Information Technology Center, China West Normal University, Nanchong 637009, China
| | - Youhua Wei
- Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Chengdu 610059, China;
- College of Mathematics and Physics, Chengdu University of Technology, Chengdu 610059, China
| | - Ke Guo
- Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Chengdu 610059, China;
- College of Mathematics and Physics, Chengdu University of Technology, Chengdu 610059, China
| | - Hongwei Han
- Engineering and Technical College, Chengdu University of Technology, Leshan 614000, China;
| |
Collapse
|
6
|
Gao YL, Qiao Q, Wang J, Yuan SS, Liu JX. BioSTD: A New Tensor Multi-View Framework via Combining Tensor Decomposition and Strong Complementarity Constraint for Analyzing Cancer Omics Data. IEEE J Biomed Health Inform 2023; 27:5187-5198. [PMID: 37498764 DOI: 10.1109/jbhi.2023.3299274] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 07/29/2023]
Abstract
Advances in omics technology have enriched the understanding of the biological mechanisms of diseases, which has provided a new approach for cancer research. Multi-omics data contain different levels of cancer information, and comprehensive analysis of them has attracted wide attention. However, limited by the dimensionality of matrix models, traditional methods cannot fully use the key high-dimensional global structure of multi-omics data. Moreover, besides global information, local features within each omics are also critical. It is necessary to consider the potential local information together with the high-dimensional global information, ensuring that the shared and complementary features of the omics data are comprehensively observed. In view of the above, this article proposes a new tensor integrative framework called the strong complementarity tensor decomposition model (BioSTD) for cancer multi-omics data. It is used to identify cancer subtype specific genes and cluster subtype samples. Different from the matrix framework, BioSTD utilizes multi-view tensors to coordinate each omics to maximize high-dimensional spatial relationships, which jointly considers the different characteristics of different omics data. Meanwhile, we propose the concept of strong complementarity constraint applicable to omics data and introduce it into BioSTD. Strong complementarity is used to explore the potential local information, which can enhance the separability of different subtypes, allowing consistency and complementarity in the omics data to be fully represented. Experimental results on real cancer datasets show that our model outperforms other advanced models, which confirms its validity.
Collapse
|
7
|
Yun Y, Li J, Gao Q, Yang M, Gao X. Low-rank discrete multi-view spectral clustering. Neural Netw 2023; 166:137-147. [PMID: 37494762 DOI: 10.1016/j.neunet.2023.06.038] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/25/2023] [Revised: 05/10/2023] [Accepted: 06/27/2023] [Indexed: 07/28/2023]
Abstract
Spectral clustering has attracted intensive attention in multimedia applications due to its good performance on arbitrary shaped clusters and well-defined mathematical framework. However, most existing multi-view spectral clustering methods still have the following demerits: (1) They ignore useful complementary information embedded in indicator matrices of different views. (2) The conventional post-processing methods based on the relax and discrete strategy inevitably result in the sub-optimal discrete solution. To tackle the aforementioned drawbacks, we propose a low-rank discrete multi-view spectral clustering model. Drawing inspiration from the fact that the difference between indicator matrices of different views provides useful complementary information for clustering, our model exploits the complementary information embedded in indicator matrices with tensor Schatten p-norm constraint. Further, we integrate low-rank tensor learning and discrete label recovering into a uniform framework, which avoids the uncertainty of the relaxed and discrete strategy. Extensive experiments on benchmark datasets have demonstrated the effectiveness and superiority of the proposed method.
Collapse
Affiliation(s)
- Yu Yun
- School of Telecommunications Engineering, Xidian University, Shaanxi 710071, China
| | - Jing Li
- School of Telecommunications Engineering, Xidian University, Shaanxi 710071, China
| | - Quanxue Gao
- School of Telecommunications Engineering, Xidian University, Shaanxi 710071, China.
| | - Ming Yang
- College of Mathematical Sciences, Harbin Engineering University, Heilongjiang 150001, China.
| | - Xinbo Gao
- Chongqing Key Laboratory of Image Cognition, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
| |
Collapse
|
8
|
Xie D, Gao Q, Yang M. Enhanced tensor low-rank representation learning for multi-view clustering. Neural Netw 2023; 161:93-104. [PMID: 36738492 DOI: 10.1016/j.neunet.2023.01.037] [Citation(s) in RCA: 6] [Impact Index Per Article: 6.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/24/2022] [Revised: 09/27/2022] [Accepted: 01/24/2023] [Indexed: 01/30/2023]
Abstract
Multi-view subspace clustering (MSC), assuming the multi-view data are generated from a latent subspace, has attracted considerable attention in multi-view clustering. To recover the underlying subspace structure, a successful approach adopted recently is subspace clustering based on tensor nuclear norm (TNN). But there are some limitations to this approach that the existing TNN-based methods usually fail to exploit the intrinsic cluster structure and high-order correlations well, which leads to limited clustering performance. To address this problem, the main purpose of this paper is to propose a novel tensor low-rank representation (TLRR) learning method to perform multi-view clustering. First, we construct a 3rd-order tensor by organizing the features from all views, and then use the t-product in the tensor space to obtain the self-representation tensor of the tensorial data. Second, we use the ℓ1,2 norm to constrain the self-representation tensor to make it capture the class-specificity distribution, that is important for depicting the intrinsic cluster structure. And simultaneously, we rotate the self-representation tensor, and use the tensor singular value decomposition-based weighted TNN as a tighter tensor rank approximation to constrain the rotated tensor. For the challenged mathematical optimization problem, we present an effective optimization algorithm with a theoretical convergence guarantee and relatively low computation complexity. The constructed convergent sequence to the Karush-Kuhn-Tucker (KKT) critical point solution is mathematically validated in detail. We perform extensive experiments on four datasets and demonstrate that TLRR outperforms state-of-the-art multi-view subspace clustering methods.
Collapse
Affiliation(s)
- Deyan Xie
- School of Science and Information Science, Qingdao Agricultural University, Qingdao, China.
| | - Quanxue Gao
- School of Telecommunications Engineering, Xidian University, Xi'an, China.
| | - Ming Yang
- Mathematics department of the University of Evansville, Evansville, IN 47722, United States of America.
| |
Collapse
|
9
|
Sun X, Zhang X, Xu C, Xiao M, Tang Y. Tensorial Multiview Representation for Saliency Detection via Nonconvex Approach. IEEE TRANSACTIONS ON CYBERNETICS 2023; 53:1816-1829. [PMID: 35025754 DOI: 10.1109/tcyb.2021.3139037] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
In the study of salient object detection, multiview features play an important role in identifying various underlying salient objects. As to current common patch-based methods, all different features are handled directly by stacking them into a high-dimensional vector to represent related image patches. These approaches ignore the correlations inhering in the original spatial structure, which may lead to the loss of certain underlying characterization such as view interaction. In this article, different from currently available approaches, a tensorial feature representation framework is developed for the salient object detection in order to better explore the complementary information of multiview features. Under the tensor framework, a tensor low-rank constraint is applied to the background to capture its intrinsic structure, a tensor group sparsity regularization is posed on the salient part, and a tensorial sliced Laplacian regularization is then introduced to enlarge the gap between the subspaces of the background and salient object. Moreover, a nonconvex tensor Log-determinant function, instead of the tensor nuclear norm, is adopted to approximate the tensor rank for effectively suppressing the confusing information resulted from underlying complex backgrounds. Further, we have deduced the closed-form solution of this nonconvex minimization problem and established a feasible algorithm whose convergence is mathematically proven. Experiments on five well-known public datasets are provided and the simulations demonstrate that our method outperforms the latest unsupervised handcrafted features-based methods in the literature. Furthermore, our model is flexible with various deep features and is competitive with the state-of-the-art approaches.
Collapse
|
10
|
Liu X, Tang G. Color Image Restoration Using Sub-Image Based Low-Rank Tensor Completion. SENSORS (BASEL, SWITZERLAND) 2023; 23:1706. [PMID: 36772745 PMCID: PMC9919421 DOI: 10.3390/s23031706] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 12/10/2022] [Revised: 01/18/2023] [Accepted: 01/19/2023] [Indexed: 06/18/2023]
Abstract
Many restoration methods use the low-rank constraint of high-dimensional image signals to recover corrupted images. These signals are usually represented by tensors, which can maintain their inherent relevance. The image of this simple tensor presentation has a certain low-rank property, but does not have a strong low-rank property. In order to enhance the low-rank property, we propose a novel method called sub-image based low-rank tensor completion (SLRTC) for image restoration. We first sample a color image to obtain sub-images, and adopt these sub-images instead of the original single image to form a tensor. Then we conduct the mode permutation on this tensor. Next, we exploit the tensor nuclear norm defined based on the tensor-singular value decomposition (t-SVD) to build the low-rank completion model. Finally, we perform the tensor-singular value thresholding (t-SVT) based the standard alternating direction method of multipliers (ADMM) algorithm to solve the aforementioned model. Experimental results have shown that compared with the state-of-the-art tensor completion techniques, the proposed method can provide superior results in terms of objective and subjective assessment.
Collapse
Affiliation(s)
- Xiaohua Liu
- College of Electronic and Optical Engineering & College of Flexible Electronics (Future Technology), Nanjing University of Posts and Telecommunications, Nanjing 210023, China
| | - Guijin Tang
- Jiangsu Key Laboratory of Image Processing and Image Communication, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
| |
Collapse
|
11
|
He Y, Zeng L, Xu Q, Wang Z, Yu H, Shen Z, Yang Z, Zhou R. Spectral CT reconstruction via low-rank representation and structure preserving regularization. Phys Med Biol 2023; 68. [PMID: 36595335 DOI: 10.1088/1361-6560/acabf9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/04/2022] [Accepted: 12/15/2022] [Indexed: 12/23/2022]
Abstract
Objective:With the development of computed tomography (CT) imaging technology, it is possible to acquire multi-energy data by spectral CT. Being different from conventional CT, the X-ray energy spectrum of spectral CT is cut into several narrow bins which leads to the result that only a part of photon can be collected in each individual energy channel.This can severely degrade the image qualities. To address this problem, we propose a spectral CT reconstruction algorithm based on low-rank representation and structure preserving regularization in this paper.Approach:To make full use of the prior knowledge about both the inter-channel correlation and the sparsity in gradient domain of inner-channel data, this paper combines a low-rank correlation descriptor with a structure extraction operator as priori regularization terms for spectral CT reconstruction. Furthermore, a split-Bregman based iterative algorithm is developed to solve the reconstruction model. Finally, we propose a multi-channel adaptive parameters generation strategy according to CT values of each individual energy channel.Main results: Experimental results on numerical simulations and real mouse data indicate that the proposed algorithm achieves higher accuracy on both reconstruction and material decomposition than the methods based on simultaneous algebraic reconstruction technique (SART), total variation minimization (TVM), total variation with low-rank (LRTV), and spatial-spectral cube matching frame (SSCMF). Compared with SART, our algorithm improves the feature similarity (FSIM) by 40.4% on average for numerical simulation reconstruction, whereas TVM, LRTV, and SSCMF correspond to 26.1%, 28.2%, and 29.5%, respectively.Significance: We outline a multi-channel reconstruction algorithm tailored for spectral CT. The qualitative and quantitative comparisons present a significant improvement of image quality, indicating its promising potential in spectral CT imaging.
Collapse
Affiliation(s)
- Yuanwei He
- College of Mathematics and Statistics, Chongqing University, Chongqing 401331, People's Republic of China.,Engineering Research Center of Industrial Computed Tomography Nondestructive Testing, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China
| | - Li Zeng
- College of Mathematics and Statistics, Chongqing University, Chongqing 401331, People's Republic of China.,Engineering Research Center of Industrial Computed Tomography Nondestructive Testing, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China
| | - Qiong Xu
- Beijing Engineering Research Center of Radiographic Techniques and Equipment, Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049, People's Republic of China.,Jinan Laboratory of Applied Nuclear Science, Jinan 250131, People's Republic of China
| | - Zhe Wang
- Beijing Engineering Research Center of Radiographic Techniques and Equipment, Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049, People's Republic of China.,Jinan Laboratory of Applied Nuclear Science, Jinan 250131, People's Republic of China
| | - Haijun Yu
- Engineering Research Center of Industrial Computed Tomography Nondestructive Testing, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China.,Key Lab of Optoelectronic Technology and Systems, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China
| | - Zhaoqiang Shen
- College of Mathematics and Statistics, Chongqing University, Chongqing 401331, People's Republic of China.,Engineering Research Center of Industrial Computed Tomography Nondestructive Testing, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China
| | - Zhaojun Yang
- College of Mathematics and Statistics, Chongqing University, Chongqing 401331, People's Republic of China.,Engineering Research Center of Industrial Computed Tomography Nondestructive Testing, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China
| | - Rifeng Zhou
- Engineering Research Center of Industrial Computed Tomography Nondestructive Testing, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China.,Key Lab of Optoelectronic Technology and Systems, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China.,State Key Laboratory of Mechanical Transmission, Chongqing University, Chongqing 400044, People's Republic of China
| |
Collapse
|
12
|
Wei P, Wang X, Wei Y. Neural Network Models for Time-Varying Tensor Complementarity Problems. Neurocomputing 2022. [DOI: 10.1016/j.neucom.2022.12.008] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/14/2022]
|
13
|
Wu W, Yu H, Liu F, Zhang J, Vardhanabhuti V, Chen J. Spectral CT reconstruction via Spectral-Image Tensor and Bidirectional Image-gradient minimization. Comput Biol Med 2022; 151:106080. [PMID: 36327881 DOI: 10.1016/j.compbiomed.2022.106080] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/11/2022] [Revised: 08/19/2022] [Accepted: 09/03/2022] [Indexed: 12/27/2022]
Abstract
It is challenging to obtain good image quality in spectral computed tomography (CT) as the photon-number for the photon-counting detectors is limited for each narrow energy bin. This results in a lower signal to noise ratio (SNR) for the projections. To handle this issue, we first formulate the weight bidirectional image gradient with L0-norm constraint of spectral CT image. Then, as a new regularizer, bidirectional image gradient with L0-norm constraint is introduced into the tensor decomposition model, generating the Spectral-Image Tensor and Bidirectional Image-gradient Minimization (SITBIM) algorithm. Finally, the split-Bregman method is employed to optimize the proposed SITBIM mathematical model. The experiments on the numerical mouse phantom and real mouse experiments are designed to validate and evaluate the SITBIM method. The results demonstrate that the SITBIM can outperform other state-of-the-art methods (including TVM, TV + LR, SSCMF and NLCTF). INDEX TERMS: -spectral CT, image reconstruction, tensor decomposition, unidirectional image gradient, image similarity.
Collapse
Affiliation(s)
- Weiwen Wu
- The School of Biomedical Engineering, Shenzhen Campus, Sun Yat-sen University, Shenzhen, Guangdong, 518107, China; The University of Hong Kong, Hong Kong, 999077, China
| | - Hengyong Yu
- Department of Electrical and Computer Engineering, University of Massachusetts Lowell, Lowell, MA, 01854, USA
| | - Fenglin Liu
- The Key Lab of Optoelectronic Technology and Systems, Ministry of Education, Chongqing University, Chongqing, 400044, China
| | - Jianjia Zhang
- The School of Biomedical Engineering, Shenzhen Campus, Sun Yat-sen University, Shenzhen, Guangdong, 518107, China.
| | | | | |
Collapse
|
14
|
Guo J, Sun Y, Gao J, Hu Y, Yin B. Multi-Attribute Subspace Clustering via Auto-Weighted Tensor Nuclear Norm Minimization. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2022; 31:7191-7205. [PMID: 36355733 DOI: 10.1109/tip.2022.3220949] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/16/2023]
Abstract
Self-expressiveness based subspace clustering methods have received wide attention for unsupervised learning tasks. However, most existing subspace clustering methods consider data features as a whole and then focus only on one single self-representation. These approaches ignore the intrinsic multi-attribute information embedded in the original data feature and result in one-attribute self-representation. This paper proposes a novel multi-attribute subspace clustering (MASC) model that understands data from multiple attributes. MASC simultaneously learns multiple subspace representations corresponding to each specific attribute by exploiting the intrinsic multi-attribute features drawn from original data. In order to better capture the high-order correlation among multi-attribute representations, we represent them as a tensor in low-rank structure and propose the auto-weighted tensor nuclear norm (AWTNN) as a superior low-rank tensor approximation. Especially, the non-convex AWTNN fully considers the difference between singular values through the implicit and adaptive weights splitting during the AWTNN optimization procedure. We further develop an efficient algorithm to optimize the non-convex and multi-block MASC model and establish the convergence guarantees. A more comprehensive subspace representation can be obtained via aggregating these multi-attribute representations, which can be used to construct a clustering-friendly affinity matrix. Extensive experiments on eight real-world databases reveal that the proposed MASC exhibits superior performance over other subspace clustering methods.
Collapse
|
15
|
One-step incomplete multiview clustering with low-rank tensor graph learning. Inf Sci (N Y) 2022. [DOI: 10.1016/j.ins.2022.10.026] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]
|
16
|
Tensor ring decomposition-based model with interpretable gradient factors regularization for tensor completion. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.110094] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022]
|
17
|
Shi Q, Cheung YM, Lou J. Robust Tensor SVD and Recovery With Rank Estimation. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:10667-10682. [PMID: 33872172 DOI: 10.1109/tcyb.2021.3067676] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
Tensor singular value decomposition (t-SVD) has recently become increasingly popular for tensor recovery under partial and/or corrupted observations. However, the existing t -SVD-based methods neither make use of a rank prior nor provide an accurate rank estimation (RE), which would limit their recovery performance. From the practical perspective, the tensor RE problem is nontrivial and difficult to solve. In this article, we, therefore, aim to determine the correct rank of an intrinsic low-rank tensor from corrupted observations based on t-SVD and further improve recovery results with the estimated rank. Specifically, we first induce the equivalence of the tensor nuclear norm (TNN) of a tensor and its f -diagonal tensor. We then simultaneously minimize the reconstruction error and TNN of the f -diagonal tensor, leading to RE. Subsequently, we relax our model by removing the TNN regularizer to improve the recovery performance. Furthermore, we consider more general cases in the presence of missing data and/or gross corruptions by proposing robust tensor principal component analysis and robust tensor completion with RE. The robust methods can achieve successful recovery by refining the models with correct estimated ranks. Experimental results show that the proposed methods outperform the state-of-the-art methods with significant improvements.
Collapse
|
18
|
Mai TTN, Lam EY, Lee C. Deep Unrolled Low-Rank Tensor Completion for High Dynamic Range Imaging. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2022; 31:5774-5787. [PMID: 36048976 DOI: 10.1109/tip.2022.3201708] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/15/2023]
Abstract
The major challenge in high dynamic range (HDR) imaging for dynamic scenes is suppressing ghosting artifacts caused by large object motions or poor exposures. Whereas recent deep learning-based approaches have shown significant synthesis performance, interpretation and analysis of their behaviors are difficult and their performance is affected by the diversity of training data. In contrast, traditional model-based approaches yield inferior synthesis performance to learning-based algorithms despite their theoretical thoroughness. In this paper, we propose an algorithm unrolling approach to ghost-free HDR image synthesis algorithm that unrolls an iterative low-rank tensor completion algorithm into deep neural networks to take advantage of the merits of both learning- and model-based approaches while overcoming their weaknesses. First, we formulate ghost-free HDR image synthesis as a low-rank tensor completion problem by assuming the low-rank structure of the tensor constructed from low dynamic range (LDR) images and linear dependency among LDR images. We also define two regularization functions to compensate for modeling inaccuracy by extracting hidden model information. Then, we solve the problem efficiently using an iterative optimization algorithm by reformulating it into a series of subproblems. Finally, we unroll the iterative algorithm into a series of blocks corresponding to each iteration, in which the optimization variables are updated by rigorous closed-form solutions and the regularizers are updated by learned deep neural networks. Experimental results on different datasets show that the proposed algorithm provides better HDR image synthesis performance with superior robustness compared with state-of-the-art algorithms, while using significantly fewer training samples.
Collapse
|
19
|
Tang Y, Xie Y, Zhang C, Zhang Z, Zhang W. One-Step Multiview Subspace Segmentation via Joint Skinny Tensor Learning and Latent Clustering. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:9179-9193. [PMID: 33661745 DOI: 10.1109/tcyb.2021.3053057] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
Multiview subspace clustering (MSC) has attracted growing attention due to the extensive value in various applications, such as natural language processing, face recognition, and time-series analysis. In this article, we are devoted to address two crucial issues in MSC: 1) high computational cost and 2) cumbersome multistage clustering. Existing MSC approaches, including tensor singular value decomposition (t-SVD)-MSC that has achieved promising performance, generally utilize the dataset itself as the dictionary and regard representation learning and clustering process as two separate parts, thus leading to the high computational overhead and unsatisfactory clustering performance. To remedy these two issues, we propose a novel MSC model called joint skinny tensor learning and latent clustering (JSTC), which can learn high-order skinny tensor representations and corresponding latent clustering assignments simultaneously. Through such a joint optimization strategy, the multiview complementary information and latent clustering structure can be exploited thoroughly to improve the clustering performance. An alternating direction minimization algorithm, which owns low computational complexity and can be run in parallel when solving several key subproblems, is carefully designed to optimize the JSTC model. Such a nice property makes our JSTC an appealing solution for large-scale MSC problems. We conduct extensive experiments on ten popular datasets and compare our JSTC with 12 competitors. Five commonly used metrics, including four external measures (NMI, ACC, F-score, and RI) and one internal metric (SI), are adopted to evaluate the clustering quality. The experimental results with the Wilcoxon statistical test demonstrate the superiority of the proposed method in both clustering performance and operational efficiency.
Collapse
|
20
|
Shu X, Zhang X, Wang Q. Self-weighted graph learning for multi-view clustering. Neurocomputing 2022. [DOI: 10.1016/j.neucom.2022.06.009] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/18/2022]
|
21
|
Hou J, Zhang F, Qiu H, Wang J, Wang Y, Meng D. Robust Low-Tubal-Rank Tensor Recovery From Binary Measurements. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2022; 44:4355-4373. [PMID: 33656988 DOI: 10.1109/tpami.2021.3063527] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
Low-rank tensor recovery (LRTR) is a natural extension of low-rank matrix recovery (LRMR) to high-dimensional arrays, which aims to reconstruct an underlying tensor X from incomplete linear measurements [Formula: see text]. However, LRTR ignores the error caused by quantization, limiting its application when the quantization is low-level. In this work, we take into account the impact of extreme quantization and suppose the quantizer degrades into a comparator that only acquires the signs of [Formula: see text]. We still hope to recover X from these binary measurements. Under the tensor Singular Value Decomposition (t-SVD) framework, two recovery methods are proposed-the first is a tensor hard singular tube thresholding method; the second is a constrained tensor nuclear norm minimization method. These methods can recover a real n1×n2×n3 tensor X with tubal rank r from m random Gaussian binary measurements with errors decaying at a polynomial speed of the oversampling factor λ:=m/((n1+n2)n3r). To improve the convergence rate, we develop a new quantization scheme under which the convergence rate can be accelerated to an exponential function of λ. Numerical experiments verify our results, and the applications to real-world data demonstrate the promising performance of the proposed methods.
Collapse
|
22
|
Zhang X, Ng MK. Low Rank Tensor Completion With Poisson Observations. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2022; 44:4239-4251. [PMID: 33587697 DOI: 10.1109/tpami.2021.3059299] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
Poisson observations for videos are important models in video processing and computer vision. In this paper, we study the third-order tensor completion problem with Poisson observations. The main aim is to recover a tensor based on a small number of its Poisson observation entries. A existing matrix-based method may be applied to this problem via the matricized version of the tensor. However, this method does not leverage on the global low-rankness of a tensor and may be substantially suboptimal. Our approach is to consider the maximum likelihood estimate of the Poisson distribution, and utilize the Kullback-Leibler divergence for the data-fitting term to measure the observations and the underlying tensor. Moreover, we propose to employ a transformed tensor nuclear norm ball constraint and a bounded constraint of each entry, where the transformed tensor nuclear norm is used to get a lower transformed multi-rank tensor with suitable unitary transformation matrices. We show that the upper bound of the error of the estimator of the proposed model is less than that of the existing matrix-based method. Also an information theoretic lower error bound is established. An alternating direction method of multipliers is developed to solve the resulting convex optimization model. Extensive numerical experiments on synthetic data and real-world datasets are presented to demonstrate the effectiveness of our proposed model compared with existing tensor completion methods.
Collapse
|
23
|
Lv Z, Gao Q, Zhang X, Li Q, Yang M. View-Consistency Learning for Incomplete Multiview Clustering. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2022; 31:4790-4802. [PMID: 35797312 DOI: 10.1109/tip.2022.3187562] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/15/2023]
Abstract
In this article, we present a novel general framework for incomplete multi-view clustering by integrating graph learning and spectral clustering. In our model, a tensor low-rank constraint are introduced to learn a stable low-dimensional representation, which encodes the complementary information and takes into account the cluster structure between different views. A corresponding algorithm associated with augmented Lagrangian multipliers is established. In particular, tensor Schatten p -norm is used as a tighter approximation to the tensor rank function. Besides, both consistency and specificity are jointly exploited for subspace representation learning. Extensive experiments on benchmark datasets demonstrate that our model outperforms several baseline methods in incomplete multi-view clustering.
Collapse
|
24
|
Mohaoui S, Hakim A, Raghay S. Parallel matrix factorization-based collaborative sparsity and smooth prior for estimating missing values in multidimensional data. Pattern Anal Appl 2022. [DOI: 10.1007/s10044-022-01082-3] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/18/2022]
|
25
|
Du S, Liu B, Shan G, Shi Y, Wang W. Enhanced tensor low-rank representation for clustering and denoising. Knowl Based Syst 2022. [DOI: 10.1016/j.knosys.2022.108468] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
26
|
Qin W, Wang H, Zhang F, Wang J, Luo X, Huang T. Low-Rank High-Order Tensor Completion With Applications in Visual Data. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2022; 31:2433-2448. [PMID: 35259105 DOI: 10.1109/tip.2022.3155949] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
Recently, tensor Singular Value Decomposition (t-SVD)-based low-rank tensor completion (LRTC) has achieved unprecedented success in addressing various pattern analysis issues. However, existing studies mostly focus on third-order tensors while order- d ( d ≥ 4 ) tensors are commonly encountered in real-world applications, like fourth-order color videos, fourth-order hyper-spectral videos, fifth-order light-field images, and sixth-order bidirectional texture functions. Aiming at addressing this critical issue, this paper establishes an order- d tensor recovery framework including the model, algorithm and theories by innovatively developing a novel algebraic foundation for order- d t-SVD, thereby achieving exact completion for any order- d low t-SVD rank tensors with missing values with an overwhelming probability. Emperical studies on synthetic data and real-world visual data illustrate that compared with other state-of-the-art recovery frameworks, the proposed one achieves highly competitive performance in terms of both qualitative and quantitative metrics. In particular, as the observed data density becomes low, i.e., about 10%, the proposed recovery framework is still significantly better than its peers. The code of our algorithm is released at https://github.com/Qinwenjinswu/TIP-Code.
Collapse
|
27
|
Chappard C, Abascal J, Olivier C, Si-Mohamed S, Boussel L, Piala JB, Douek P, Peyrin F. Virtual monoenergetic images from photon-counting spectral computed tomography to assess knee osteoarthritis. Eur Radiol Exp 2022; 6:10. [PMID: 35190914 PMCID: PMC8861235 DOI: 10.1186/s41747-021-00261-x] [Citation(s) in RCA: 13] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/27/2021] [Accepted: 12/30/2021] [Indexed: 12/28/2022] Open
Abstract
Background Dual-energy computed tomography has shown a great interest for musculoskeletal pathologies. Photon-counting spectral computed tomography (PCSCT) can acquire data in multiple energy bins with the potential to increase contrast, especially for soft tissues. Our objectives were to assess the value of PCSST to characterise cartilage and to extract quantitative measures of subchondral bone integrity. Methods Seven excised human knees (3 males and 4 females; 4 normal and 3 with osteoarthritis; age 80.6 ± 14 years, mean ± standard deviation) were scanned using a clinical PCSCT prototype scanner. Tomographic image reconstruction was performed after Compton/photoelectric decomposition. Virtual monoenergetic images were generated from 40 keV to 110 keV every 10 keV (cubic voxel size 250 × 250 × 250 μm3). After selecting an optimal virtual monoenergetic image, we analysed the grey level histograms of different tissues and extracted quantitative measurements on bone cysts. Results The optimal monoenergetic images were obtained for 60 keV and 70 keV. Visual inspection revealed that these images provide sufficient spatial resolution and soft-tissue contrast to characterise surfaces, disruption, calcification of cartilage, bone osteophytes, and bone cysts. Analysis of attenuation versus energy revealed different energy fingerprint according to tissues. The volumes and numbers of bone cyst were quantified. Conclusions Virtual monoenergetic images may provide direct visualisation of both cartilage and bone details. Thus, unenhanced PCSCT appears to be a new modality for characterising the knee joint with the potential to increase the diagnostic capability of computed tomography for joint diseases and osteoarthritis.
Collapse
|
28
|
Zhao XL, Yang JH, Ma TH, Jiang TX, Ng MK, Huang TZ. Tensor Completion via Complementary Global, Local, and Nonlocal Priors. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2022; 31:984-999. [PMID: 34971534 DOI: 10.1109/tip.2021.3138325] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
Completing missing entries in multidimensional visual data is a typical ill-posed problem that requires appropriate exploitation of prior information of the underlying data. Commonly used priors can be roughly categorized into three classes: global tensor low-rankness, local properties, and nonlocal self-similarity (NSS); most existing works utilize one or two of them to implement completion. Naturally, there arises an interesting question: can one concurrently make use of multiple priors in a unified way, such that they can collaborate with each other to achieve better performance? This work gives a positive answer by formulating a novel tensor completion framework which can simultaneously take advantage of the global-local-nonlocal priors. In the proposed framework, the tensor train (TT) rank is adopted to characterize the global correlation; meanwhile, two Plug-and-Play (PnP) denoisers, including a convolutional neural network (CNN) denoiser and the color block-matching and 3 D filtering (CBM3D) denoiser, are incorporated to preserve local details and exploit NSS, respectively. Then, we design a proximal alternating minimization algorithm to efficiently solve this model under the PnP framework. Under mild conditions, we establish the convergence guarantee of the proposed algorithm. Extensive experiments show that these priors organically benefit from each other to achieve state-of-the-art performance both quantitatively and qualitatively.
Collapse
|
29
|
Tensor Dictionary Learning with an Enhanced Sparsity Constraint for Sparse-View Spectral CT Reconstruction. PHOTONICS 2022. [DOI: 10.3390/photonics9010035] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/04/2023]
Abstract
Spectral computed tomography (CT) can divide collected photons into multi-energy channels and gain multi-channel projections synchronously by using photon-counting detectors. However, reconstructed images usually contain severe noise due to the limited number of photons in the corresponding energy channel. Tensor dictionary learning (TDL)-based methods have achieved better performance, but usually lose image edge information and details, especially from an under-sampling dataset. To address this problem, this paper proposes a method termed TDL with an enhanced sparsity constraint for spectral CT reconstruction. The proposed algorithm inherits the superiority of TDL by exploring the correlation of spectral CT images. Moreover, the method designs a regularization using the L0-norm of the image gradient to constrain images and the difference between images and a prior image in each energy channel simultaneously, further improving the ability to preserve edge information and subtle image details. The split-Bregman algorithm has been applied to address the proposed objective minimization model. Several numerical simulations and realistic preclinical mice are studied to assess the effectiveness of the proposed algorithm. The results demonstrate that the proposed method improves the quality of spectral CT images in terms of noise elimination, edge preservation, and image detail recovery compared to the several existing better methods.
Collapse
|
30
|
Yao Y, Li L, Chen Z. Iterative dynamic dual-energy CT algorithm in reducing statistical noise in multi-energy CT imaging. Phys Med Biol 2021; 67. [PMID: 34937002 DOI: 10.1088/1361-6560/ac459d] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/09/2021] [Accepted: 12/22/2021] [Indexed: 11/11/2022]
Abstract
Multi-energy spectral CT has a broader range of applications with the recent development of photon-counting detectors. However, the photons counted in each energy bin decrease when the number of energy bins increases, which causes a higher statistical noise level of the CT image. In this work, we propose a novel iterative dynamic dual-energy CT algorithm to reduce the statistical noise. In the proposed algorithm, the multi-energy projections are estimated from the dynamic dual-energy CT data during the iterative process. The proposed algorithm is verified on sufficient numerical simulations and a laboratory two-energy-threshold PCD system. By applying the same reconstruction algorithm, the dynamic dual-energy CT's final reconstruction results have a much lower statistical noise level than the conventional multi-energy CT. Moreover, based on the analysis of the simulation results, we explain why the dynamic dual-energy CT has a lower statistical noise level than the conventional multi-energy CT. The reason is that: the statistical noise level of multi-energy projection estimated with the proposed algorithm is much lower than that of the conventional multi-energy CT, which leads to less statistical noise of the dynamic dual-energy CT imaging.
Collapse
Affiliation(s)
- Yidi Yao
- Department of Engineering Physics, Tsinghua University, 30 Shuangqing Rd, Hai Dian Qu, Beijing, 100084, CHINA
| | - Liang Li
- Department of Engineering Physics, Tsinghua University, 30 Shuangqing Rd, Hai Dian Qu, Beijing, 100084, CHINA
| | - Zhiqiang Chen
- Department of Engineering Physics, Tsinghua University, 30 Shuangqing Rd, Hai Dian Qu, Beijing, 100084, CHINA
| |
Collapse
|
31
|
Unifying tensor factorization and tensor nuclear norm approaches for low-rank tensor completion. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.06.020] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|
32
|
Wu W, Hu D, Niu C, Broeke LV, Butler APH, Cao P, Atlas J, Chernoglazov A, Vardhanabhuti V, Wang G. Deep learning based spectral CT imaging. Neural Netw 2021; 144:342-358. [PMID: 34560584 DOI: 10.1016/j.neunet.2021.08.026] [Citation(s) in RCA: 17] [Impact Index Per Article: 5.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/27/2020] [Revised: 07/14/2021] [Accepted: 08/20/2021] [Indexed: 10/20/2022]
Abstract
Spectral computed tomography (CT) has attracted much attention in radiation dose reduction, metal artifacts removal, tissue quantification and material discrimination. The x-ray energy spectrum is divided into several bins, each energy-bin-specific projection has a low signal-noise-ratio (SNR) than the current-integrating counterpart, which makes image reconstruction a unique challenge. Traditional wisdom is to use prior knowledge based iterative methods. However, this kind of methods demands a great computational cost. Inspired by deep learning, here we first develop a deep learning based reconstruction method; i.e., U-net with Lpp-norm, Total variation, Residual learning, and Anisotropic adaption (ULTRA). Specifically, we emphasize the various multi-scale feature fusion and multichannel filtering enhancement with a denser connection encoding architecture for residual learning and feature fusion. To address the image deblurring problem associated with the L22- loss, we propose a general Lpp-loss, p>0. Furthermore, the images from different energy bins share similar structures of the same object, the regularization characterizing correlations of different energy bins is incorporated into the Lpp- loss function, which helps unify the deep learning based methods with traditional compressed sensing based methods. Finally, the anisotropically weighted total variation is employed to characterize the sparsity in the spatial-spectral domain to regularize the proposed network In particular, we validate our ULTRA networks on three large-scale spectral CT datasets, and obtain excellent results relative to the competing algorithms. In conclusion, our quantitative and qualitative results in numerical simulation and preclinical experiments demonstrate that our proposed approach is accurate, efficient and robust for high-quality spectral CT image reconstruction.
Collapse
Affiliation(s)
- Weiwen Wu
- Department of Diagnostic Radiology, Queen Mary Hospital, University of Hong Kong, Hong Kong, People's Republic of China; Biomedical Imaging Center, Center for Biotechnology and Interdisciplinary Studies, Department of Biomedical Engineering, School of Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA
| | - Dianlin Hu
- The Laboratory of Image Science and Technology, Southeast University, Nanjing, People's Republic of China
| | - Chuang Niu
- Biomedical Imaging Center, Center for Biotechnology and Interdisciplinary Studies, Department of Biomedical Engineering, School of Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA
| | - Lieza Vanden Broeke
- Department of Diagnostic Radiology, Queen Mary Hospital, University of Hong Kong, Hong Kong, People's Republic of China
| | | | - Peng Cao
- Department of Diagnostic Radiology, Queen Mary Hospital, University of Hong Kong, Hong Kong, People's Republic of China
| | - James Atlas
- Department of Radiology, University of Otago, Christchurch, New Zealand
| | | | - Varut Vardhanabhuti
- Department of Diagnostic Radiology, Queen Mary Hospital, University of Hong Kong, Hong Kong, People's Republic of China.
| | - Ge Wang
- Biomedical Imaging Center, Center for Biotechnology and Interdisciplinary Studies, Department of Biomedical Engineering, School of Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA
| |
Collapse
|
33
|
Webber JW, Miller EL. Compressed sensing two-dimensional Bragg scatter imaging. OPTICS EXPRESS 2021; 29:18139-18172. [PMID: 34154079 DOI: 10.1364/oe.420693] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 01/26/2021] [Accepted: 05/13/2021] [Indexed: 06/13/2023]
Abstract
Here we introduce a new reconstruction technique for two-dimensional Bragg scattering tomography (BST), based on the Radon transform models of Webber and Miller [Inverse Probl. Imaging15, 683 (2021).10.3934/ipi.2021010]. Our method uses a combination of ideas from multibang control and microlocal analysis to construct an objective function which can regularize the BST artifacts; specifically the boundary artifacts due to sharp cutoff in sinogram space (as observed in [arXiv preprint, arXiv:2007.00208 (2020)]), and artifacts arising from approximations made in constructing the model used for inversion. We then test our algorithm in a variety of Monte Carlo (MC) simulated examples of practical interest in airport baggage screening and threat detection. The data used in our studies is generated with a novel Monte-Carlo code presented here. The model, which is available from the authors upon request, captures both the Bragg scatter effects described by BST as well as beam attenuation and Compton scatter.
Collapse
|
34
|
Du S, Shi Y, Shan G, Wang W, Ma Y. Tensor low-rank sparse representation for tensor subspace learning. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.02.002] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
|
35
|
Zhang Y, Shao Y, Shen J, Lu Y, Zheng Z, Sidib Y, Yu B. Infrared image impulse noise suppression using tensor robust principal component analysis and truncated total variation. APPLIED OPTICS 2021; 60:4916-4929. [PMID: 34143054 DOI: 10.1364/ao.421081] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/01/2021] [Accepted: 04/25/2021] [Indexed: 06/12/2023]
Abstract
Infrared image denoising is an essential inverse problem that has been widely applied in many fields. However, when suppressing impulse noise, existing methods lead to blurred object details and loss of image information. Moreover, computational efficiency is another challenge for existing methods when processing infrared images with large resolution. An infrared image impulse-noise-suppression method is introduced based on tensor robust principal component analysis. Specifically, we propose a randomized tensor singular-value thresholding algorithm to solve the tensor kernel norm based on the matrix stochastic singular-value decomposition and tensor singular-value threshold. Combined with the image blocking, it can not only ensure the denoising performance but also greatly improve the algorithm's efficiency. Finally, truncated total variation is applied to improve the smoothness of the denoised image. Experimental results indicate that the proposed algorithm outperforms the state-of-the-art methods in computational efficiency, denoising effect, and detail feature preservation.
Collapse
|
36
|
Qiu D, Bai M, Ng MK, Zhang X. Robust low-rank tensor completion via transformed tensor nuclear norm with total variation regularization. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2020.12.110] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
|
37
|
Cai C, Li G, Chi Y, Poor HV, Chen Y. Subspace estimation from unbalanced and incomplete data matrices: ℓ2,∞ statistical guarantees. Ann Stat 2021. [DOI: 10.1214/20-aos1986] [Citation(s) in RCA: 7] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/10/2023]
Affiliation(s)
- Changxiao Cai
- Department of Electrical Engineering, Princeton University
| | - Gen Li
- Department of Electronic Engineering, Tsinghua University
| | - Yuejie Chi
- Department of Electrical and Computer Engineering, Carnegie Mellon University
| | | | - Yuxin Chen
- Department of Electrical Engineering, Princeton University
| |
Collapse
|
38
|
Zhang H, Liu B, Yu H, Dong B. MetaInv-Net: Meta Inversion Network for Sparse View CT Image Reconstruction. IEEE TRANSACTIONS ON MEDICAL IMAGING 2021; 40:621-634. [PMID: 33104506 DOI: 10.1109/tmi.2020.3033541] [Citation(s) in RCA: 24] [Impact Index Per Article: 8.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
X-ray Computed Tomography (CT) is widely used in clinical applications such as diagnosis and image-guided interventions. In this paper, we propose a new deep learning based model for CT image reconstruction with the backbone network architecture built by unrolling an iterative algorithm. However, unlike the existing strategy to include as many data-adaptive components in the unrolled dynamics model as possible, we find that it is enough to only learn the parts where traditional designs mostly rely on intuitions and experience. More specifically, we propose to learn an initializer for the conjugate gradient (CG) algorithm that involved in one of the subproblems of the backbone model. Other components, such as image priors and hyperparameters, are kept as the original design. Since a hypernetwork is introduced to inference on the initialization of the CG module, it makes the proposed model a certain meta-learning model. Therefore, we shall call the proposed model the meta-inversion network (MetaInv-Net). The proposed MetaInv-Net can be designed with much less trainable parameters while still preserves its superior image reconstruction performance than some state-of-the-art deep models in CT imaging. In simulated and real data experiments, MetaInv-Net performs very well and can be generalized beyond the training setting, i.e., to other scanning settings, noise levels, and data sets.
Collapse
|
39
|
Xia D, Yuan M, Zhang CH. Statistically optimal and computationally efficient low rank tensor completion from noisy entries. Ann Stat 2021. [DOI: 10.1214/20-aos1942] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
|
40
|
Xie Y, Liu J, Qu Y, Tao D, Zhang W, Dai L, Ma L. Robust Kernelized Multiview Self-Representation for Subspace Clustering. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2021; 32:868-881. [PMID: 32287010 DOI: 10.1109/tnnls.2020.2979685] [Citation(s) in RCA: 15] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
In this article, we propose a multiview self-representation model for nonlinear subspaces clustering. By assuming that the heterogeneous features lie within the union of multiple linear subspaces, the recent multiview subspace learning methods aim to capture the complementary and consensus from multiple views to boost the performance. However, in real-world applications, data feature usually resides in multiple nonlinear subspaces, leading to undesirable results. To this end, we propose a kernelized version of tensor-based multiview subspace clustering, which is referred to as Kt-SVD-MSC, to jointly learn self-representation coefficients in mapped high-dimensional spaces and multiple views correlation in unified tensor space. In view-specific feature space, a kernel-induced mapping is introduced for each view to ensure the separability of self-representation coefficients. In unified tensor space, a new kind of tensor low-rank regularizer is employed on the rotated self-representation coefficient tensor to preserve the global consistency across different views. We also derive an algorithm to efficiently solve the optimization problem with all the subproblems having closed-form solutions. Furthermore, by incorporating the nonnegative and sparsity constraints, the proposed method can be easily extended to a useful variant, meaning that several useful variants can be easily constructed in a similar way. Extensive experiments of the proposed method are tested on eight challenging data sets, in which a significant (even a breakthrough) advance over state-of-the-art multiview clustering is achieved.
Collapse
|
41
|
Wang Y, Zhang W, Cai A, Wang L, Tang C, Feng Z, Li L, Liang N, Yan B. An effective sinogram inpainting for complementary limited-angle dual-energy computed tomography imaging using generative adversarial networks. JOURNAL OF X-RAY SCIENCE AND TECHNOLOGY 2021; 29:37-61. [PMID: 33104055 DOI: 10.3233/xst-200736] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
Dual-energy computed tomography (DECT) provides more anatomical and functional information for image diagnosis. Presently, the popular DECT imaging systems need to scan at least full angle (i.e., 360°). In this study, we propose a DECT using complementary limited-angle scan (DECT-CL) technology to reduce the radiation dose and compress the spatial distribution of the imaging system. The dual-energy total scan is 180°, where the low- and high-energy scan range is the first 90° and last 90°, respectively. We describe this dual limited-angle problem as a complementary limited-angle problem, which is challenging to obtain high-quality images using traditional reconstruction algorithms. Furthermore, a complementary-sinogram-inpainting generative adversarial networks (CSI-GAN) with a sinogram loss is proposed to inpainting sinogram to suppress the singularity of truncated sinogram. The sinogram loss focuses on the data distribution of the generated sinogram while approaching the target sinogram. We use the simultaneous algebraic reconstruction technique namely, a total variable (SART-TV) algorithms for image reconstruction. Then, taking reconstructed CT images of pleural and cranial cavity slices as examples, we evaluate the performance of our method and numerically compare different methods based on root mean square error (RMSE), peak signal-to-noise ratio (PSNR) and structural similarity (SSIM). Compared with traditional algorithms, the proposed network shows advantages in numerical terms. Compared with Patch-GAN, the proposed network can also reduce the RMSE of the reconstruction results by an average of 40% and increase the PSNR by an average of 26%. In conclusion, both qualitative and quantitative comparison and analysis demonstrate that our proposed method achieves a good artifact suppression effect and can suitably solve the complementary limited-angle problem.
Collapse
Affiliation(s)
- Yizhong Wang
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Wenkun Zhang
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Ailong Cai
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Linyuan Wang
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Chao Tang
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Zhiwei Feng
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Lei Li
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Ningning Liang
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| | - Bin Yan
- Henan Key Laboratory of Imaging and Intelligent Processing, PLA Strategic Support Force Information Engineering University, Zhengzhou, Henan, China
| |
Collapse
|
42
|
Zhou Y, Cheung YM. Bayesian Low-Tubal-Rank Robust Tensor Factorization with Multi-Rank Determination. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2021; 43:62-76. [PMID: 31226066 DOI: 10.1109/tpami.2019.2923240] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/09/2023]
Abstract
Robust tensor factorization is a fundamental problem in machine learning and computer vision, which aims at decomposing tensors into low-rank and sparse components. However, existing methods either suffer from limited modeling power in preserving low-rank structures, or have difficulties in determining the target tensor rank and the trade-off between the low-rank and sparse components. To address these problems, we propose a fully Bayesian treatment of robust tensor factorization along with a generalized sparsity-inducing prior. By adapting the recently proposed low-tubal-rank model in a generative manner, our method is effective in preserving low-rank structures. Moreover, benefiting from the proposed prior and the Bayesian framework, the proposed method can automatically determine the tensor rank while inferring the trade-off between the low-rank and sparse components. For model estimation, we develop a variational inference algorithm, and further improve its efficiency by reformulating the variational updates in the frequency domain. Experimental results on both synthetic and real-world datasets demonstrate the effectiveness of the proposed method in multi-rank determination as well as its superiority in image denoising and background modeling over state-of-the-art approaches.
Collapse
|
43
|
Wang S, Wu W, Feng J, Liu F, Yu H. Low-dose spectral CT reconstruction based on image-gradient L 0-norm and adaptive spectral PICCS. Phys Med Biol 2020; 65:245005. [PMID: 32693399 DOI: 10.1088/1361-6560/aba7cf] [Citation(s) in RCA: 15] [Impact Index Per Article: 3.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/31/2022]
Abstract
The photon-counting detector based spectral computed tomography (CT) is promising for lesion detection, tissue characterization, and material decomposition. However, the lower signal-to-noise ratio within multi-energy projection dataset can result in poorly reconstructed image quality. Recently, as prior information, a high-quality spectral mean image was introduced into the prior image constrained compressed sensing (PICCS) framework to suppress noise, leading to spectral PICCS (SPICCS). In the original SPICCS model, the image gradient L1-norm is employed, and it can cause blurred edge structures in the reconstructed images. Encouraged by the advantages in edge preservation and finer structure recovering, the image gradient L0-norm was incorporated into the PICCS model. Furthermore, due to the difference of energy spectrum in different channels, a weighting factor is introduced and adaptively adjusted for different channel-wise images, leading to an L0-norm based adaptive SPICCS (L0-ASPICCS) algorithm for low-dose spectral CT reconstruction. The split-Bregman method is employed to minimize the objective function. Extensive numerical simulations and physical phantom experiments are performed to evaluate the proposed method. By comparing with the state-of-the-art algorithms, such as the simultaneous algebraic reconstruction technique, total variation minimization, and SPICCS, the advantages of our proposed method are demonstrated in terms of both qualitative and quantitative evaluation results.
Collapse
Affiliation(s)
- Shaoyu Wang
- Key Lab of Optoelectronic Technology and Systems, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China. Department of Electrical and Computer Engineering, University of Massachusetts Lowell, Lowell, MA 01854, United States of America. Engineering Research Center of Industrial Computed Tomography Nondestructive Testing, Ministry of Education, Chongqing University, Chongqing 400044, People's Republic of China
| | | | | | | | | |
Collapse
|
44
|
Xiao X, Chen Y, Gong YJ, Zhou Y. Low-Rank Preserving t-Linear Projection for Robust Image Feature Extraction. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2020; 30:108-120. [PMID: 33090953 DOI: 10.1109/tip.2020.3031813] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
As the cornerstone for joint dimension reduction and feature extraction, extensive linear projection algorithms were proposed to fit various requirements. When being applied to image data, however, existing methods suffer from representation deficiency since the multi-way structure of the data is (partially) neglected. To solve this problem, we propose a novel Low-Rank Preserving t-Linear Projection (LRP-tP) model that preserves the intrinsic structure of the image data using t-product-based operations. The proposed model advances in four aspects: 1) LRP-tP learns the t-linear projection directly from the tensorial dataset so as to exploit the correlation among the multi-way data structure simultaneously; 2) to cope with the widely spread data errors, e.g., noise and corruptions, the robustness of LRP-tP is enhanced via self-representation learning; 3) LRP-tP is endowed with good discriminative ability by integrating the empirical classification error into the learning procedure; 4) an adaptive graph considering the similarity and locality of the data is jointly learned to precisely portray the data affinity. We devise an efficient algorithm to solve the proposed LRP-tP model using the alternating direction method of multipliers. Extensive experiments on image feature extraction have demonstrated the superiority of LRP-tP compared to the state-of-the-arts.
Collapse
|
45
|
Singh R, Wu W, Wang G, Kalra MK. Artificial intelligence in image reconstruction: The change is here. Phys Med 2020; 79:113-125. [DOI: 10.1016/j.ejmp.2020.11.012] [Citation(s) in RCA: 41] [Impact Index Per Article: 10.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Submit a Manuscript] [Subscribe] [Scholar Register] [Received: 07/02/2020] [Revised: 11/06/2020] [Accepted: 11/07/2020] [Indexed: 12/19/2022] Open
|
46
|
Zhang W, Liang N, Wang Z, Cai A, Wang L, Tang C, Zheng Z, Li L, Yan B, Hu G. Multi-energy CT reconstruction using tensor nonlocal similarity and spatial sparsity regularization. Quant Imaging Med Surg 2020; 10:1940-1960. [PMID: 33014727 DOI: 10.21037/qims-20-594] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
Abstract
Background Multi-energy computed tomography (MECT) based on a photon-counting detector is an emerging imaging modality that collects projections at several energy bins with a single scan. However, the limited number of photons collected into the divided, narrow energy bins results in high quantum noise levels in reconstructed images. This study aims to improve MECT image quality by minimizing noise levels while retaining image details. Methods A novel MECT reconstruction method was proposed by exploiting the nonlocal tensor similarity among interchannel images and spatial sparsity in single-channel images. Similar patches were initially extracted from the interchannel images in spectral and spatial domains, then stacked into a new three-order tensor. Intrinsic tensor sparsity regularization that combined the Tuker and canonical polyadic (CP) low-rank decomposition techniques were applied to exploit the nonlocal similarity of the formulated tensor. Spatial sparsity in single-channel images was modeled by total variation (TV) regularization that utilizes the compressibility of gradient image. A new MECT reconstruction model was established by simultaneously incorporating the intrinsic tensor sparsity and TV regularizations. The iterative alternating minimization method was utilized to solve the reconstruction model based on a flexible framework. Results The proposed method was applied to the digital phantom and real mouse data to assess its feasibility and reliability. The reconstruction and decomposition results in the mouse data were encouraging and demonstrated the ability of the proposed method in noise suppression while preserving image details, not observed with other methods. Imaging data from the digital phantom illustrated this method as achieving the best intuitive reconstruction and decomposition results among all compared methods. They reduced the root mean square error (RMSE) by 89.75%, 50.75%, and 36.54% on the reconstructed images compared with analytic, TV-based, and tensor-based methods, respectively. This phenomenon was also observed with decomposition results, where the RMSE was also reduced by 97.96%, 67.74%, 72.05%, respectively. Conclusions In this study, we proposed a reconstruction method for photon counting detector-based MECT, using the intrinsic tensor sparsity and TV regularizations. Improvements in noise suppression and detail preservation in the digital phantom and real mouse data were validated by the qualitative and quantitative evaluations on the reconstruction and decomposition results, verifying the potential of the proposed method in MECT reconstruction.
Collapse
Affiliation(s)
- Wenkun Zhang
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Ningning Liang
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Zhe Wang
- Beijing Engineering Research Center of Radiographic Techniques and Equipment, Institute of High Energy Physics, Chinese Academy of Sciences, Beijing, China
| | - Ailong Cai
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Linyuan Wang
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Chao Tang
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Zhizhong Zheng
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Lei Li
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Bin Yan
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| | - Guoen Hu
- Key Laboratory of Imaging and Intelligent Processing of Henan Province, PLA Strategic Support Force Information Engineering University, Zhengzhou, China
| |
Collapse
|
47
|
|
48
|
Zeng D, Yao L, Ge Y, Li S, Xie Q, Zhang H, Bian Z, Zhao Q, Li Y, Xu Z, Meng D, Ma J. Full-Spectrum-Knowledge-Aware Tensor Model for Energy-Resolved CT Iterative Reconstruction. IEEE TRANSACTIONS ON MEDICAL IMAGING 2020; 39:2831-2843. [PMID: 32112677 DOI: 10.1109/tmi.2020.2976692] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
Energy-resolved computed tomography (ErCT) with a photon counting detector concurrently produces multiple CT images corresponding to different photon energy ranges. It has the potential to generate energy-dependent images with improved contrast-to-noise ratio and sufficient material-specific information. Since the number of detected photons in one energy bin in ErCT is smaller than that in conventional energy-integrating CT (EiCT), ErCT images are inherently more noisy than EiCT images, which leads to increased noise and bias in the subsequent material estimation. In this work, we first deeply analyze the intrinsic tensor properties of two-dimensional (2D) ErCT images acquired in different energy bins and then present a F ull- S pectrum-knowledge-aware Tensor analysis and processing (FSTensor) method for ErCT reconstruction to suppress noise-induced artifacts to obtain high-quality ErCT images and high-accuracy material images. The presented method is based on three considerations: (1) 2D ErCT images obtained in different energy bins can be treated as a 3-order tensor with three modes, i.e., width, height and energy bin, and a rich global correlation exists among the three modes, which can be characterized by tensor decomposition. (2) There is a locally piecewise smooth property in the 3-order ErCT images, and it can be captured by a tensor total variation regularization. (3) The images from the full spectrum are much better than the ErCT images with respect to noise variance and structural details and serve as external information to improve the reconstruction performance. We then develop an alternating direction method of multipliers algorithm to numerically solve the presented FSTensor method. We further utilize a genetic algorithm to tackle the parameter selection in ErCT reconstruction, instead of manually determining parameters. Simulation, preclinical and synthesized clinical ErCT results demonstrate that the presented FSTensor method leads to significant improvements over the filtered back-projection, robust principal component analysis, tensor-based dictionary learning and low-rank tensor decomposition with spatial-temporal total variation methods.
Collapse
|
49
|
Infrared Small Target Detection via Non-Convex Tensor Rank Surrogate Joint Local Contrast Energy. REMOTE SENSING 2020. [DOI: 10.3390/rs12091520] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
Small target detection is a crucial technique that restricts the performance of many infrared imaging systems. In this paper, a novel detection model of infrared small target via non-convex tensor rank surrogate joint local contrast energy (NTRS) is proposed. To improve the latest infrared patch-tensor (IPT) model, a non-convex tensor rank surrogate merging tensor nuclear norm (TNN) and the Laplace function, is utilized for low rank background patch-tensor constraint, which has a useful property of adaptively allocating weight for every singular value and can better approximate l 0 -norm. Considering that the local prior map can be equivalent to the saliency map, we introduce a local contrast energy feature into IPT detection framework to weight target tensor, which can efficiently suppress the background and preserve the target simultaneously. Besides, to remove the structured edges more thoroughly, we suggest an additional structured sparse regularization term using the l 1 , 1 , 2 -norm of third-order tensor. To solve the proposed model, a high-efficiency optimization way based on alternating direction method of multipliers with the fast computing of tensor singular value decomposition is designed. Finally, an adaptive threshold is utilized to extract real targets of the reconstructed target image. A series of experimental results show that the proposed method has robust detection performance and outperforms the other advanced methods.
Collapse
|
50
|
Lu C, Feng J, Chen Y, Liu W, Lin Z, Yan S. Tensor Robust Principal Component Analysis with a New Tensor Nuclear Norm. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2020; 42:925-938. [PMID: 30629495 DOI: 10.1109/tpami.2019.2891760] [Citation(s) in RCA: 109] [Impact Index Per Article: 27.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/09/2023]
Abstract
In this paper, we consider the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is based on the recently proposed tensor-tensor product (or t-product) [14]. Induced by the t-product, we first rigorously deduce the tensor spectral norm, tensor nuclear norm, and tensor average rank, and show that the tensor nuclear norm is the convex envelope of the tensor average rank within the unit ball of the tensor spectral norm. These definitions, their relationships and properties are consistent with matrix cases. Equipped with the new tensor nuclear norm, we then solve the TRPCA problem by solving a convex program and provide the theoretical guarantee for the exact recovery. Our TRPCA model and recovery guarantee include matrix RPCA as a special case. Numerical experiments verify our results, and the applications to image recovery and background modeling problems demonstrate the effectiveness of our method.
Collapse
|