The valuable structure features in full-dose computed tomography (FdCT) scans can be exploited as prior knowledge for low-dose CT (LdCT) imaging. However, lacking the capability to represent local characteristics of interested structures of the LdCT image adaptively may result in poor preservation of details/textures in LdCT image. This paper aims to explore a novel prior knowledge retrieval and representation paradigm, called adaptive prior features assisted restoration algorithm, for the purpose of better restoration of the low-dose lung CT images by capturing local features from FdCT scans adaptively. The innovation lies in the construction of an offline training database and the online patch-search scheme integrated with the principal components analysis (PCA). Specifically, the offline training database is composed of 3-D patch samples extracted from existing full-dose lung scans. For online patch-search, 3-D patches with structure similar to the noisy target patch are first selected from the database as the training samples. Then, PCA is applied on the training samples to retrieve their local prior principal features adaptively. By employing the principal features to decompose the noisy target patch and using an adaptive coefficient shrinkage technique for inverse transformation, the noise of the target patch can be efficiently removed and the detailed texture can be well preserved. The effectiveness of the proposed algorithm was validated by CT scans of patients with lung cancer. The results show that it can achieve a noticeable gain over some state-of-the-art methods in terms of noise suppression and details/textures preservation.

Photoacoustic computed tomography (PACT) has emerged as a unique and promising technology for multiscale biomedical imaging. To fully realize its potential for various preclinical and clinical applications, development of systems with high imaging speed, reasonable cost, and manageable data flow are needed. Sparse-sampling PACT with advanced reconstruction algorithms, such as compressed-sensing reconstruction, has shown potential as a solution to this challenge. However, most such algorithms require iterative reconstruction and thus intense computation, which may lead to excessively long image reconstruction times. Here, we developed a principal component analysis (PCA)-based PACT (PCA-PACT) that can rapidly reconstruct high-quality, three-dimensional (3-D) PACT images with sparsely sampled data without requiring an iterative process. In vivo images of the vasculature of a human hand were obtained, thus validating the PCA-PACT method. The results showed that, compared with the back-projection (BP) method, PCA-PACT required $∼50%$ fewer measurements and $∼40%$ less time for image reconstruction, and the imaging quality was almost the same as that for BP with full sampling. In addition, compared with compressed sensing-based PACT, PCA-PACT had approximately sevenfold faster imaging speed with higher imaging accuracy. This work suggests a promising approach for low-cost, 3-D, rapid PACT for various biomedical applications.

Detecting genomes with similar expression patterns using clustering techniques plays an important role in gene expression data analysis. Non-negative matrix factorization (NMF) is an effective method for clustering the analysis of gene expression data. However, the NMF-based method is performed within the Euclidean space, and it is usually inappropriate for revealing the intrinsic geometric structure of data space. In order to overcome this shortcoming, Cai et al. proposed a novel algorithm, called graph regularized non-negative matrices factorization (GNMF). Motivated by the topological structure of the GNMF-based method, we propose improved graph regularized non-negative matrix factorization (GNMF) to facilitate the display of geometric structure of data space. Robust manifold non-negative matrix factorization (RM-GNMF) is designed for cancer gene clustering, leading to an enhancement of the GNMF-based algorithm in terms of robustness. We combine the $l_{2,1}$ -norm NMF with spectral clustering to conduct the wide-ranging experiments on the three known datasets. Clustering results indicate that the proposed method outperforms the previous methods, which displays the latest application of the RM-GNMF-based method in cancer gene clustering.

Cone-beam X-ray luminescence computed tomography (CB-XLCT) has been proposed as a new molecular imaging modality recently. It can obtain both anatomical and functional tomographic images of an object efficiently, with the excitation of nanophosphors in vivo or in vitro by cone-beam X-rays. However, the ill-posedness of the CB-XLCT inverse problem degrades the image quality and makes it difficult to resolve adjacent luminescent targets with different concentrations, which is essential in the monitoring of nanoparticle metabolism and drug delivery. To address this problem, a multi-voltage excitation imaging scheme combined with principal component analysis is proposed in this study. Imaging experiments performed on physical phantoms by a custom-made CB-XLCT system demonstrate that two adjacent targets, with different concentrations and an edge-to-edge distance of 0 mm, can be effectively resolved.

Background: Low-dose computed tomography (LDCT) scans can effectively reduce the radiation damage to patients, but this is highly detrimental to CT image quality. Deep convolutional neural networks (CNNs) have shown their potential in improving LDCT image quality. However, the conventional CNN-based approaches rely fundamentally on the convolution operations, which are ineffective for modeling the correlations among nonlocal similar structures and the regionally distinct statistical properties in CT images. This modeling deficiency hampers the denoising performance for CT images derived in this manner. Methods: In this paper, we propose an adaptive global context (AGC) modeling scheme to describe the nonlocal correlations and the regionally distinct statistics in CT images with negligible computation load. We further propose an AGC-based long-short residual encoder-decoder (AGC-LSRED) network for efficient LDCT image noise artifact-suppression tasks. Specifically, stacks of residual AGC attention blocks (RAGCBs) with long and short skip connections are constructed in the AGC-LSRED network, which allows valuable structural and positional information to be bypassed through these identity-based skip connections and thus eases the training of the deep denoising network. For training the AGC-LSRED network, we propose a compound loss that combines the L₁ loss, adversarial loss, and self-supervised multi-scale perceptual loss. Results: Quantitative and qualitative experimental studies were performed to verify and validate the effectiveness of the proposed method. The simulation experiments demonstrated the proposed method exhibits the best result in terms of noise suppression [root-mean-square error (RMSE) =9.02; peak signal-to-noise ratio (PSNR) =33.17] and fine structure preservation [structural similarity index (SSIM) =0.925] compared with other competitive CNN-based methods. The experiments on real data illustrated that the proposed method has advantages over other methods in terms of radiologists’ subjective assessment scores (averaged scores =4.34). Conclusions: With the use of the AGC modeling scheme to characterize the structural information in CT images and of residual AGC-attention blocks with long and short skip connections to ease the network training, the proposed AGC-LSRED method achieves satisfactory results in preserving fine anatomical structures and suppressing noise in LDCT images.

Perfusion computed tomography (PCT) is critical in detecting cerebral ischemic lesions. PCT examination with low-dose scans can effectively reduce radiation exposure to patients at the cost of degraded images with severe noise, and artifacts. Tensor total variation (TTV) models are powerful tools that can encode the regional continuous structures underlying a PCT object. In a TTV model, the sparsity structures of the contrast-medium concentration (CMC) across PCT frames are assumed to be isotropic with identical, and independent distribution. However, this assumption is inconsistent with practical PCT tasks wherein the sparsity has evident variations, and correlations. Such modeling deviation hampers the performance of TTV-based PCT reconstructions. To address this issue, we developed a novel c ontrast- m edium a nisotropy- a ware t ensor t otal v ariation (CMAA-TTV) model to describe the intrinsic anisotropy sparsity of the CMC in PCT imaging tasks. Instead of directly on the difference matrices, the CMAA-TTV model characterizes sparsity on a low-rank subspace of the difference matrices which are calculated from the input data adaptively, thus naturally encoding the intrinsic variant, and correlated anisotropy sparsity structures of the CMC. We further proposed a robust, and efficient PCT reconstruction algorithm to improve low-dose PCT reconstruction performance using the CMAA-TTV model. Experimental studies using a digital brain perfusion phantom, patient data with low-dose simulation, and clinical patient data were performed to validate the effectiveness of the presented algorithm. The results demonstrate that the CMAA-TTV algorithm can achieve noticeable improvements over state-of-the-art methods in low-dose PCT reconstruction tasks.