COMPARISON BETWEEN DEEP NEURAL NETWORK AND PRINCIPAL COMPONENT ANALYSIS ALGORITHM IN FACE RECOGNITION

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.

Multitemporal Landsat TM imagery were classified to extract land cover information using principal component analysis (PCA) and backpropagation (BP) algorithm of artificial neural network. Data used are two Landsat TM data of in Jan. 1, 1991 (Data I) and May 9, 1994 (Data II). Twelve bands data were compressed to 4 bands data by the first and second PCA. Approximately 95 percent of the total variance of each Landsat TM data was included resulting from the first and second component analysis. Analyzed data through the PCA were classified by the BP training algorithm of artificial neural network. As a result of classification, it is concluded that this approach will become an attractive and effective method in extracting land cover or land use information using multitemporal Landsat TM data.

<p>This paper presents a simple and fast recognition system with various facial expressions, poses, and rotation. The proposed system performed in two phases. Face detection is the first phase. The front and profile face detected cropped face area from the image by Viola-Jones algorithm and the right side face is detected from the image by taking the flip of the profile image. Principal component analysis (eigenfaces) algorithm is used in the recognition phase and depends on created database models used to be compared with test face image input to the recognition procedure. For training and testing the system, two sets of the image of the file exchange interface (FEI) database have been used to identify the person. The experimental result shows the effectiveness and robustness of the method used for the detection of the face and achieves high accuracy of 96%, which improves the recognition performance with low execution time. Furthermore, the accuracy of 35 trained images for recognition is 97.143% with average time execution which is (0.323657s). Also, the accuracy of 15 tested images for recognition is 93.315% with average time execution which is (0.3348s) which indicates a good and strong success and accuracy method for facial recognition.</p>

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.

Deep neural network algorithm for MPPT control of double diode equation based PV module

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.

We present a novel hybrid algorithm for training Deep Neural Networks that combines the state-of-the-art Gradient Descent (GD) method with a Mixed Integer Linear Programming (MILP) solver, outperforming GD and variants in terms of accuracy, as well as resource and data efficiency for both regression and classification tasks. Our GD+Solver hybrid algorithm, called GDSolver, works as follows: given a DNN D as input, GDSolver invokes GD to partially train D until it gets stuck in a local minima, at which point GDSolver invokes an MILP solver to exhaustively search a region of the loss landscape around the weight assignments of D’s final layer parameters with the goal of tunnelling through and escaping the local minima. The process is repeated until desired accuracy is achieved. In our experiments, we find that GDSolver not only scales well to additional data and very large model sizes, but also outperforms all other competing methods in terms of rates of convergence and data efficiency. For regression tasks, GDSolver produced models that, on average, had 31.5% lower MSE in 48% less time, and for classification tasks on MNIST and CIFAR10, GDSolver was able to achieve the highest accuracy over all competing methods, using only 50% of the training data that GD baselines required.

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.

Survey on Deep Neural Networks in Speech and Vision Systems

Deep learning is one of the most recent development form of Artificial Neural Network (ANN) in machine learning. Deep Neural Network (DNN) algorithm is usually used in image and speech recognition applications. As the development of Artificial Neural Network, very possible there are so many hidden layers in Deep Neural Network. In DNN, the output of each node is a quadratic function of its inputs. The DNN training process is very difficult. In this paper, we try to optimizing the training process by slightly construct of the deep architecture and combines several existing algorithms. Output's error of each unit in the previous layer will be calculated. The weight of the unit with the smallest error will be maintained in the next iteration. This paper uses MNIST handwriting images as its data training and data test. After doing some tests, it can be concluded that the optimization by selecting any output in each hidden layer, the DNN training process will be faster approximately 8%.

Shrimps are aquaculture products highly needed by the people and this is the reason their growth needs to be monitored using underwater digital images. However, the large dimensions of the shrimp digital images usually make the processing difficult. Therefore, this research focuses on reducing the dimensions of underwater shrimp digital images without reducing their information through the application of the Principal Component Analysis (PCA) algorithm. This was achieved using 4 digital shrimp images extracted from video data with the number of columns 398 for each image. The results showed that 12 PCs were produced and this means the reduced digital images with new dimensions have 12 variable columns with data diversity distributed based on a total variance of 95.61%. Moreover, the original and reduced digital images were compared and the lowest value of MSE produced was 94.12, the minimum value of RMSE was 9.54, and the highest value of PSNR was 8.06 db, and they were obtained in the 4th digital image. The experiment was conducted using 3 devices which include I3, I7, and Google Colab processor computers and the fastest computational result was produced at 2.1 seconds by the Google Colab processor. This means the PCA algorithm is good for the reduction of digital image dimensions as indicated by the production of 12 PC as the new variable dimensions for the reduced underwater image of shrimps.

Principal Component Analysis Network (PCANet) is a feature learning algorithm which is widely used in face recognition and object classification. However, original PCANet still has some shortages. One is that PCA algorithm only extracts features by considering the global structure. The other lies in that the original PCANet only employs one particular single layer convolutional results, which loses the information of other convolutional layers. In this paper, we propose a new simple and efficient convolutional neural network called global and local structure network (GLSNet) to address the problems. The network extracts the features both from the global structure and the local structure of the original data space. Specifically, a principal component analysis (PCA) convolutional layer which learns the filters by PCA algorithm is used to remove the noises and redundant information at the first stage. Then at the second stage, another PCA convolution is added to extract features by considering the global structure. As for the local structure, we use the neighborhood preserving embedding (NPE) algorithm to learn the convolutional filters. At the output stage, the global structure feature extracted by PCA convolution and the local structure feature extracted by NPE convolution is concatenated as a united feature. Furthermore, the first layer convolutional feature is also taken into consideration to obtain shallow-level information. Finally, these features are concatenated as a united feature, and a spatial pyramid pooling layer is followed to pool above the united features. To test the effectiveness of the proposed algorithm, the experiments on some image datasets, including three types: human face dataset, object dataset, and handprinted dataset, proceeded. And it performs better than the original PCANet and some improvement algorithms of PCANet, such as PLDANet, and MMPCANet.

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.

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.

This paper reviews the implementation of Principal Component Analysis (PCA) Algorithm to traveling wave distance protection with the addition of Type D locator for distance calculation of a three phase 400 kV doubly fed power system. When a fault occurs on the transmission line by detecting the traveling waves at substation based on the pattern recognition of the first wavefront that arrives at the location of relay is used to classify whether they are within the reach of the relay using PCA algorithm and by implementing Type D locator i.e. two terminal method in algorithm, the discrimination is verified. The idea is tested for different types of faults and is simulated using MATLAB/Simulink and the performance of the algorithm is reported.