Sparse Principal Component Analysis With Preserved Sparsity Pattern

A novel method for sparse dynamic functional connectivity analysis from resting-state fMRI

BACKGROUND

There is growing interest in understanding the dynamic functional connectivity (DFC) between distributed brain regions. However, it remains challenging to reliably estimate the temporal dynamics from resting-state functional magnetic resonance imaging (rs-fMRI) due to the limitations of current methods.

NEW METHODS

We propose a new model called HDP-HSMM-BPCA for sparse DFC analysis of high-dimensional rs-fMRI data, which is a temporal extension of probabilistic principal component analysis using Bayesian nonparametric hidden semi-Markov model (HSMM). Specifically, we utilize a hierarchical Dirichlet process (HDP) prior to remove the parametric assumption of the HMM framework, overcoming the limitations of the standard HMM. An attractive superiority is its ability to automatically infer the state-specific latent space dimensionality within the Bayesian formulation.

RESULTS

The experiment results of synthetic data show that our model outperforms the competitive models with relatively higher estimation accuracy. In addition, the proposed framework is applied to real rs-fMRI data to explore sparse DFC patterns. The findings indicate that there is a time-varying underlying structure and sparse DFC patterns in high-dimensional rs-fMRI data.

COMPARISON WITH EXISTING METHODS

Compared with the existing DFC approaches based on HMM, our method overcomes the limitations of standard HMM. The observation model of HDP-HSMM-BPCA can discover the underlying temporal structure of rs-fMRI data. Furthermore, the relevant sparse DFC construction algorithm provides a scheme for estimating sparse DFC.

CONCLUSION

We describe a new computational framework for sparse DFC analysis to discover the underlying temporal structure of rs-fMRI data, which will facilitate the study of brain functional connectivity.

Learning Robust and Sparse Principal Components With the α-Divergence

In this paper, novel robust principal component analysis (RPCA) methods are proposed to exploit the local structure of datasets. The proposed methods are derived by minimizing the α -divergence between the sample distribution and the Gaussian density model. The α- divergence is used in different frameworks to represent variants of RPCA approaches including orthogonal, non-orthogonal, and sparse methods. We show that the classical PCA is a special case of our proposed methods where the α- divergence is reduced to the Kullback-Leibler (KL) divergence. It is shown in simulations that the proposed approaches recover the underlying principal components (PCs) by down-weighting the importance of structured and unstructured outliers. Furthermore, using simulated data, it is shown that the proposed methods can be applied to fMRI signal recovery and Foreground-Background (FB) separation in video analysis. Results on real world problems of FB separation as well as image reconstruction are also provided.

Improved sparse domain super-resolution reconstruction algorithm based on CMUT

A novel breast ultrasound tomography system based on a circular array of capacitive micromechanical ultrasound transducers (CMUT) has broad application prospects. However, the images produced by this system are not suitable as input for the training phase of the super-resolution (SR) reconstruction algorithm. To solve the problem, this paper proposes an improved medical image super-resolution (MeSR) method based on the sparse domain. First, we use the simultaneous algebraic reconstruction technique (SART) with high imaging accuracy to reconstruct the image into a training image in a sparse domain model. Secondly, we denoise and enhance the contrast of the SART images to obtain improved detail images before training the dictionary. Then, we use the original detail image as the guide image to further process the improved detail image. Therefore, a high-precision dictionary was obtained during the testing phase and applied to filtered back projection SR reconstruction. We compared the proposed algorithm with previously reported algorithms in the Shepp Logan model and the model based on the CMUT background. The results showed significant improvements in peak signal-to-noise ratio, entropy, and average gradient compared to previously reported algorithms. The experimental results demonstrated that the proposed MeSR method can use noisy reconstructed images as input for the training phase of the SR algorithm and produce excellent visual effects.

Adaptive Feature Selection With Augmented Attributes

In many dynamic environment applications, with the evolution of data collection ways, the data attributes are incremental and the samples are stored with accumulated feature spaces gradually. For instance, in the neuroimaging-based diagnosis of neuropsychiatric disorders, with emerging of diverse testing ways, we get more brain image features over time. The accumulation of different types of features will unavoidably bring difficulties in manipulating the high-dimensional data. It is challenging to design an algorithm to select valuable features in this feature incremental scenario. To address this important but rarely studied problem, we propose a novel Adaptive Feature Selection method (AFS). It enables the reusability of the feature selection model trained on previous features and adapts it to fit the feature selection requirements on all features automatically. Besides, an ideal l0-norm sparse constraint for feature selection is imposed with a proposed effective solving strategy. We present the theoretical analyses about the generalization bound and convergence behavior. After tackling this problem in a one-shot case, we extend it to the multi-shot scenario. Plenty of experimental results demonstrate the effectiveness of reusing previous features and the superior of l0-norm constraint in various aspects, together with its effectiveness in discriminating schizophrenic patients from healthy controls.

Sperm physiology and in vitro fertilising ability rely on basal metabolic activity: insights from the pig model

Whether basal metabolic activity in sperm has any influence on their fertilising capacity has not been explored. Using the pig as a model, the present study investigated the relationship of energetic metabolism with sperm quality and function (assessed through computer-assisted sperm analysis and flow cytometry), and fertility (in vitro fertilisation (IVF) outcomes). In semen samples from 16 boars, levels of metabolites related to glycolysis, ketogenesis and Krebs cycle were determined through a targeted metabolomics approach using liquid chromatography-tandem mass spectrometry. High-quality sperm are associated to greater levels of glycolysis-derived metabolites, and oocyte fertilisation and embryo development are conditioned by the sperm metabolic status. Interestingly, glycolysis appears to be the preferred catabolic pathway of the sperm giving rise to greater percentages of embryos at day 6. In conclusion, this study shows that the basal metabolic activity of sperm influences their function, even beyond fertilisation.

Exploring the mechanism of C473D mutation on CDC25B causing weak binding affinity with CDK2/CyclinA by molecular dynamics study

CDC25B belongs to the CDC25 family, and it plays an important part in regulating the activity of CDK/CyclinA. Studies have shown that CDC25B is closely related to cancer development. When CYS473 on CDC25B is mutated into ASP, the affinity between CDC25B and CDK2/CyclinA weakens, and their dissociation speed is greatly improved. However, the mechanism by which the CDC25BC473D mutant weakens its binding to CDK2/CyclinA is unclear. In order to study the effect of CDC25BC473D mutants on CDK2/CyclinA substrates, we constructed and verified the rationality of the CDC25BWT:CDK2/CyclinA system and CDC25BC473D:CDK2/CyclinA system and conducted molecular dynamics (MD) simulation analysis. In the post-analysis, the fluctuations of residues ARG488-SER499, LYS541-TRP550 on CDC25B and residues ASP206-ASP210 on CDK2 were massive in the mutant CDC25BC473D:CDK2/CyclinA system. And the interactions between residue ARG492 and residue GLU208, residue ARG544 and residue GLU42, residue ARG544 and TRP550 were weakened in the mutant CDC25BC473D:CDK2/CyclinA system. The results showed that when CYS473 on CDC25B was mutated into ASP473, the mutant CDC25BC473D:CDK2/CyclinA system was less stable than the wild-type CDC25BWT:CDK2/CyclinA system. Finally, active site CYS473 of CDC25B was speculated to be the key residue, which had great effects on the binding between CDC25BCYS473 and CDK2 in the CDC25BC473D:CDK2/CyclinA system. Consequently, overall analyses appeared in this study ultimately provided a useful understanding of the weak interactions between CDC25BCYS473D and CDK2/CyclinA.Communicated by Ramaswamy H. Sarma.

Consensus Sparsity: Multi-Context Sparse Image Representation via L∞-Induced Matrix Variate

The sparsity is an attractive property that has been widely and intensively utilized in various image processing fields (e.g., robust image representation, image compression, image analysis, etc.). Its actual success owes to the exhaustive mining of the intrinsic (or homogenous) information from the whole data carrying redundant information. From the perspective of image representation, the sparsity can successfully find an underlying homogenous subspace from a collection of training data to represent a given test sample. The famous sparse representation (SR) and its variants embed the sparsity by representing the test sample using a linear combination of training samples with $L_{0}$ -norm regularization and $L_{1}$ -norm regularization. However, although these state-of-the-art methods achieve powerful and robust performances, the sparsity is not fully exploited on the image representation in the following three aspects: 1) the within-sample sparsity, 2) the between-sample sparsity, and 3) the image structural sparsity. In this paper, to make the above-mentioned multi-context sparsity properties agree and simultaneously learned in one model, we propose the concept of consensus sparsity (Con-sparsity) and correspondingly build a multi-context sparse image representation (MCSIR) framework to realize this. We theoretically prove that the consensus sparsity can be achieved by the $L_{\infty }$ -induced matrix variate based on the Bayesian inference. Extensive experiments and comparisons with the state-of-the-art methods (including deep learning) are performed to demonstrate the promising performance and property of the proposed consensus sparsity.

Self-supervised Discriminative Representation Learning by Fuzzy Autoencoder

Representation learning based on autoencoders has received great concern for its potential ability to capture valuable latent information. Conventional autoencoders (AE) pursue minimal reconstruction error, but in most machine learning tasks such as classification and clustering, the discrimination of feature representation is also important. To address this limitation, an enhanced self-supervised discriminative fuzzy autoencoder (FAE) is innovatively proposed, which focuses on exploring information within data to guide the unsupervised training process and enhancing feature discrimination in a self-supervised manner. In FAE, fuzzy membership is applied to provide a means of self-supervised, which allows FAE can not only utilize AE’s outstanding representation learning capabilities but can also transform the original data into another space with improved discrimination. Firstly, the objective function corresponding to FAE is proposed by reconstruction loss and clustering oriented loss simultaneously. Subsequently, Mini-Batch Gradient Descent (MBGD) is applied to infer the objective function and the detailed process is illustrated step by step. Finally, empirical studies on clustering tasks have demonstrated the superiority of FAE over the state-of-the-art.

Parallel multi-fusion convolutional neural networks based fault diagnosis of rotating machinery under noisy environments

Fault diagnosis has a great significance in preventing serious failures of rotating machinery and avoiding huge economic losses. The performance of the existing fault diagnosis approaches might be affected by two factors, i.e., the quality of fault features extracted from monitoring signals and the capability of fault diagnosis model. This paper proposes a new fault diagnosis method combined mel-frequency cepstral coefficients (MFCC) with a designed parallel multi-fusion convolutional neural network (MFCNN) Specifically, a MFCC-based feature extraction method is defined to reduce the noise components in monitoring signal of rotating machinery and extract more useful low-frequency fault information for downstream task. Furthermore, a novel MFCNN is designed to enrich the high-level features after each convolution operation by using multiple activation functions, so as to improve the quality of the obtained fault features. Meanwhile, a new parallel MFCNN is constructed by using a defined structural ensemble operation to improve its diagnostic performance in different noise environments. Two typical bearing and gearbox failure datasets are applied to evaluate the performance of the proposed fault diagnosis method. The experimental results indicate that the proposed parallel MFCNN has the better diagnostic performance than other methods.

Propagation Characteristics and Identification of High-Order Harmonics of a Traction Power Supply System

High-order harmonics in the traction power supply show negative effects on the safe and stable operation of the railway transportation system. There is a fixed resonant frequency in the traction network. When the harmonic current frequency produced by the locomotive matches the resonant frequency of the traction network, it will cause high-frequency resonant overvoltage. The propagation path of the high-order harmonics of the traction load is analyzed based on a V/v wiring traction transformer. The propagation characteristics of high-order harmonics on self-used equipment at 380 V low-voltage side and 27.5 kV high-voltage side are expounded. A simulation model for the low-voltage self-consumption power system is established and the singular value decomposition algorithm is proposed to identify the harmonic impedance. The simulation results show that the proposed method can reduce the error to within 0.1%. Under realistic conditions, the overvoltage caused by high-order harmonics is difficult to identify. To solve this problem, an overvoltage identification algorithm for Electric Multiple Units based on a convolutional neural network is proposed. The ShuffleNet neural network model is then used to identify high-order harmonics overvoltage and other types of overvoltage. The overall accuracy of the proposed classification model can be improved from 97.12% to 98.44%. Better recognition and classification performances can also be achieved.

Robust sparse principal component analysis by DC programming algorithm

The classical principal component analysis (PCA) is not sparse enough since it is based on the L2-norm that is also prone to be adversely affected by the presence of outliers and noises. In order to address the problem, a sparse robust PCA framework is proposed based on the min of zero-norm regularization and the max of Lp-norm (0 < p ≤ 2) PCA. Furthermore, we developed a continuous optimization method, DC (difference of convex functions) programming algorithm (DCA), to solve the proposed problem. The resulting algorithm (called DC-LpZSPCA) is convergent linearly. In addition, when choosing different p values, the model can keep robust and is applicable to different data types. Numerical simulations are simulated in artificial data sets and Yale face data sets. Experiment results show that the proposed method can maintain good sparsity and anti-outlier ability.