Global and Local Structure Network for Image Classification

The diesel engine fault data is nonlinear and it’s difficult to extract the characteristic information. Kernel Principal Component Analysis (KPCA) is used to extract features of nonlinear data, only considering global structure. Kernel Locality Preserving Projection (KLPP) considers the local feature structure. So an improved algorithm for global and local structure preserving is proposed to extract the feature of data. The improved feature extraction algorithm combining KPCA and KLPP, avoids the loss of information considering the global and local feature structure and then uses the modified K-NN algorithm for fault classification. In this paper, the software AVL BOOST is used to simulate the faults of diesel engine. The simulation experiments indicate the proposed method can extract the feature vectors effectively, and shows good classification performance.

This article presents a method based on support vector machines (SVMs) and the Osuna–Platt algorithm used to diagnose the ischemic heart disease. It also includes the necessary concepts from the optimization theory which make it possible to formulate the problem for support vectors and the Osuna–Platt algorithm applied. Next, a principal component analysis (PCA) algorithm used is also presented. Heart images acquired using Single Photon Emission Computed Tomography (SPECT) have been used in the experimental part. Results of classifying cardiac SPECT images using SVM, PCA and neural networks are compared here with those obtained using another method of machine learning – CLIP3 – a combination of the decision tree algorithm and the rule induction algorithm. Tests against an SPECT image database have shown that SVMs are generally more accurate and specific, while the PCA algorithm is the most sensitive for all data sets analysed in this research project.

Remote sensing technology provides an unprecedented tool for the continuous and real-time monitoring of atmospheric SO2 from volcanic eruption and anthropogenic emission. The Global Ozone Monitoring Experiment (GOME), SCanning Imaging Absorption spectroMeter for Atmospheric CHartographY (SCIAMACHY), and Ozone Monitoring Instrument (OMI) have high SO2 monitoring capability. The OMI, which was launched on the EOS/Aura platform in July 2004, has the same hyperspectral measurements as the GOME and SCIAMACHY, but offers the improved spatial resolution at nadir (1324 km2) and daily global coverage for short-lifetime SO2. For OMI operational SO2 planetary boundary layer (PBL) retrieval, the previous band residual difference (BRD) algorithm has been replaced by principal component analysis (PCA) algorithm, which effectively reduces the systematic biases in SO2 column retrievals. However, there are few studies on the evaluations and validations of PCA SO2 retrievals over China, and the long-term comparisons with BRD SO2 retrievals also need to be conducted. In this study, the accuracies of PCA and BRD SO2 retrievals are validated by using ground-based multi axis differential optical absorption spectroscopy (MAX-DOAS) located in Beijing, and regional atmospheric modeling system, community multi-scale air quality (RAMS-CMAQ) modeling system model which can simulate the vertical distribution of atmospheric SO2. Moreover, BRD and PCA SO2 retrievals from oceanic area, eastern China and Reunion volcanic eruption are compared to find the long-term trend and spatiotemporal differences between SO2 columns. Finally, the uncertainty of SO2 retrieval, caused by measurement errors, band selection and input parameter errors in radiative transfer model, are analysed to understand the limitations of BRD and PCA algorithms. Results show that both PCA and BRD SO2 retrievals over Beijing are lower than ground-based MAX-DOAS measurements of SO2. PCA and BRD SO2 retrievals over eastern China are lower than the simulated SO2 columns from RAMS-CMAQ in winter 2008, but in July and August BRD SO2 columns are higher than RAMS-CMAQ simulations. The values of SO2 columns from BRD over China are more consistent with those from ground-based MAX-DOAS and RAMS-CMAQ model than from PCA. Although PCA algorithm effectively reduces the noise in SO2 column retrieval, SO2 columns from PCA over China are lower than those from BRD. For oceanic area where SO2 amount is nearly zero, the standard deviation of PCA results is lower than that of BRD, but the absolute value of averaged PCA SO2 column is larger than that of BRD. In the case of Reunion volcanic eruption with SO2 columns larger than 25 DU, the BRD SO2 columns are lower than PCA retrievals. Meanwhile, with the increase of SO2 column, the difference between BRD and PCA SO2 retrievals increases. Detailed uncertainty analysis shows the influences of measurement errors, band selection and inputs of radiative transfer model on the retrieval results. This study is important for developing the retrieval algorithm, and can also improve the application of OMI SO2 products.

Principal component analysis (PCA) and minor component analysis (MCA) are two important statistical tools which have many applications in the fields of signal processing and data analysis. PCA and MCA neural networks (NNs) can be used to online extract principal component and minor component from input data. It is interesting to develop generalized learning algorithms of PCA and MCA NNs. Some novel generalized PCA and MCA learning algorithms are proposed in this paper. Convergence of PCA and MCA learning algorithms is an essential issue in practical applications. Traditionally, the convergence is studied via deterministic continuous-time (DCT) method. The DCT method requires the learning rate of the algorithms to approach to zero, which is not realistic in many practical applications. In this paper, deterministic discrete-time (DDT) method is used to study the dynamical behaviors of the proposed algorithms. The DDT method is more reasonable for the convergence analysis since it does not require constraints as that of the DCT method. It is proven that under some mild conditions, the weight vector in these proposed algorithms will converge exponentially to principal or minor component. Simulation results are further used to illustrate the theoretical results.

Traditional dimensionality reduction algorithms such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA) and Locality Preserving Projections (LPP) have been employed in many fields such as biometrics patter recognition. But those methods only effectively preserve the global Euclidean structure or local structure of data set. In this paper, a novel unsupervised subspace method called Maximum Margin Subspace Projection (MMSP) is proposed. MMSP aims at preserving the local structure on the data manifold while maximize the global information of the samples simultaneously by maximizing the margin between the global structure and local structure of data manifold. Thus two abilities of manifold learning and classification have been combined into the proposed of our MMSP algorithm. Extensive experimental results on face databases demonstrate the effectiveness of the proposed algorithm.

The incidence and mortality rate of the primary liver cancer are very high and its postoperative metastasis and recurrence have become important factors to the prognosis of patients. Circulating tumor cells (CTC), as a new tumor marker, play important roles in the early diagnosis and individualized treatment. This paper presents an effective method to distinguish liver cancer based on the cellular scattering spectrum, which is a non-fluorescence technique based on the fiber confocal microscopic spectrometer. Combining the principal component analysis (PCA) with back propagation (BP) neural network were utilized to establish an automatic recognition model for backscatter spectrum of the liver cancer cells from blood cell. PCA was applied to reduce the dimension of the scattering spectral data which obtained by the fiber confocal microscopic spectrometer. After dimensionality reduction by PCA, a neural network pattern recognition model with 2 input layer nodes, 11 hidden layer nodes, 3 output nodes was established. We trained the network with 66 samples and also tested it. Results showed that the recognition rate of the three types of cells is more than 90%, the relative standard deviation is only 2.36%. The experimental results showed that the fiber confocal microscopic spectrometer combining with the algorithm of PCA and BP neural network can automatically identify the liver cancer cell from the blood cells. This will provide a better tool for investigating the metastasis of liver cancers in vivo, the biology metabolic characteristics of liver cancers and drug transportation. Additionally, it is obviously referential in practical application.

Graph neural networks (GNNs) have revolutionized deep learning on non-Euclidean data domains, and are extensively used in fields such as social media and recommendation systems. However, complex relational data structures such as hypergraphs, pose challenges for GNNs in terms of their ability to model, embed, and learn relational complexities of multigraphs. Most GNNs focus on capturing flat local neighborhoods of a node thus failing to account for structural properties of multi-relational graphs. This paper introduces Hypergraph Link Prediction (HLP), a novel approach of encoding the multilink structure of graphs. HLP allows pooling operations to incorporate a 360 degrees overview of a node interaction profile, by learning local neighborhood and global hypergraph structure simultaneously. Global graph information is injected into node representations, such that unique global structural patterns of every node are encoded at the node level. HLP leverages the augmented hypergraph adjacency matrix to incorporate the depth of the hypergraph in the convolutional layers. The model is applied to the task of predicting multi-drug interactions, by modeling relations between pairs of drugs as a hypergraph. The existence and the type of drug interactions between the same pair of drugs are mapped as multiple edges, and can be inferred by learning the multigraph local and global structure concurrently. To account for molecular graph properties of a drug, additional drug chemical graph structural fingerprints are included as node attributes.

In this study, an iterative k-t principal component analysis (PCA) algorithm with nonrigid frame-to-frame motion correction is proposed for dynamic contrast-enhanced three-dimensional perfusion imaging. An iterative k-t PCA algorithm was implemented with regularization using training data corrected for frame-to-frame motion in the x-pc domain. Motion information was extracted using shape-constrained nonrigid image registration of the composite of training and k-t undersampled data. The approach was tested for 10-fold k-t undersampling using computer simulations and in vivo data sets corrupted by respiratory motion artifacts owing to free-breathing or interrupted breath-holds. Results were compared to breath-held reference data. Motion-corrected k-t PCA image reconstruction resolved residual aliasing. Signal intensity curves extracted from the myocardium were close to those obtained from the breath-held reference. Upslopes were found to be more homogeneous in space when using the k-t PCA approach with motion correction. Iterative k-t PCA with nonrigid motion correction permits correction of respiratory motion artifacts in three-dimensional first-pass myocardial perfusion imaging.

Within the last years various principal component analysis (PCA) algorithms have been proposed. In this paper we use a general framework to describe those PCA algorithms which are based on Hebbian learning. For an important subset of these algorithms, the local algorithms, we fully describe their equilibria, where all lateral connections are set to zero and their local stability. We show how the parameters in the PCA algorithms have to be chosen in order to get an algorithm which converges to a stable equilibrium which provides principal component extraction.

Face recognition is one technology that is commonly used now. Therefore, various algorithms continue to be developed to obtain maximum results with minimum costs. One of them is the Deep Neural Network or DNN algorithm. While DNN requires a large dataset to train the algorithm, another algorithm called the Principal Component Analysis (PCA) algorithm works good in a smaller dataset. These algorithms are compared to know which algorithm has the better result in given circumstances. Later the accuracy, speed, and optimality of the algorithms are analyzed. By comparing these algorithms, we could know which algorithm is preferable in given circumstances. After the experiment is done, we can assume that the two algorithms have a slight difference in terms of accuracy. Also, the time used for running the PCA implementation code is slightly longer than DNN. However, that does not mean that the PCA algorithm is not great. If the dataset to be used is limited, PCA is going to be a good choice.

Cancer is the most common disease to threaten human health. The ability to screen individuals with malignant tumours with only a blood sample would be greatly advantageous to early diagnosis and intervention. This study explores the possibility of discriminating between cancer patients and normal subjects with serum surface-enhanced Raman spectroscopy (SERS) and a support vector machine (SVM) through a peripheral blood sample. A total of 130 blood samples were obtained from patients with liver cancer, colonic cancer, esophageal cancer, nasopharyngeal cancer, gastric cancer, as well as 113 blood samples from normal volunteers. Several diagnostic models were built with the serum SERS spectra using SVM and principal component analysis (PCA) techniques. The results show that a diagnostic accuracy of 85.5% is acquired with a PCA algorithm, while a diagnostic accuracy of 95.8% is obtained using radial basis function (RBF), PCA–SVM methods. The results prove that a RBF kernel PCA–SVM technique is superior to PCA and conventional SVM (C-SVM) algorithms in classification serum SERS spectra. The study demonstrates that serum SERS, in combination with SVM techniques, has great potential for screening cancerous patients with any solid malignant tumour through a peripheral blood sample.

Complete neighborhood preserving embedding for face recognition

In this chapter, we introduce a new subspace learning framework called “Sparse Manifold Subspace Learning (SMSL)”. Compared with the conventional methods considering global data structure e.g., PCA, LDA, SMSL aims at preserving the local neighborhood structure on the data manifold and provides a more accurate data representation via locality sparse coding. In addition, it removes the common concerns of many local structure based subspace learning methods e.g., Local Linear Embedding (LLE), Neighborhood Preserving Embedding (NPE), that how to choose appropriate neighbors. SMSL adaptively selects neighbors based on their distances and importance, which is less sensitive to noise than NPE. Moreover, the dual-sparse processes, i.e., the locality sparse coding, and sparse eigen-decomposition in graph embedding yield a noise-tolerant framework. Finally, SMSL is learned in an inductive fashion, and therefore easily extended to different tests. We exhibit experimental results on several databases and demonstrate the effectiveness of the proposed method.

Robust two-dimensional PCANet with F-norm distance metric

Anchor-based multi-view graph clustering (AMVGC) has received abundant attention owing to its high efficiency and the capability to capture complementary structural information across multiple views. Intuitively, a high-quality anchor graph plays an essential role in the success of AMVGC. However, the existing AMVGC methods only consider single-structure information, i.e., local or global structure, which provides insufficient information for the learning task. To be specific, the over-scattered global structure leads to learned anchors failing to depict the cluster partition well. In contrast, the local structure with an improper similarity measure results in potentially inaccurate anchor assignment, ultimately leading to sub-optimal clustering performance. To tackle the issue, we propose a novel anchor-based multi-view graph clustering framework termed Efficient Multi-View Graph Clustering with Local and Global Structure Preservation (EMVGC-LG). Specifically, a unified framework with a theoretical guarantee is designed to capture local and global information. Besides, EMVGC-LG jointly optimizes anchor construction and graph learning to enhance the clustering quality. In addition, EMVGC-LG inherits the linear complexity of existing AMVGC methods respecting the sample number, which is time-economical and scales well with the data size. Extensive experiments demonstrate the effectiveness and efficiency of our proposed method.