A Leaf Recognition Algorithm for Plant Classification Using Probabilistic Neural Network

In this paper, we employ Probabilistic Neural Network (PNN) with image and data processing techniques to implement a general purpose automated leaf recognition algorithm. 12 leaf features are extracted and orthogonalized into 5 principal variables which consist the input vector of the PNN. The PNN is trained by 1800 leaves to classify 32 kinds of plants with an accuracy greater than 90%. Compared with other approaches, our algorithm is an accurate artificial intelligence approach which is fast in execution and easy in implementation.Comment: 6 pages, 3 figures, 2 table

A Unifying review of linear gaussian models

Factor analysis, principal component analysis, mixtures of gaussian clusters, vector quantization, Kalman filter models, and hidden Markov models can all be unified as variations of unsupervised learning under a single basic generative model. This is achieved by collecting together disparate observations and derivations made by many previous authors and introducing a new way of linking discrete and continuous state models using a simple nonlinearity. Through the use of other nonlinearities, we show how independent component analysis is also a variation of the same basic generative model.We show that factor analysis and mixtures of gaussians can be implemented in autoencoder neural networks and learned using squared error plus the same regularization term. We introduce a new model for static data, known as sensible principal component analysis, as well as a novel concept of spatially adaptive observation noise. We also review some of the literature involving global and local mixtures of the basic models and provide pseudocode for inference and learning for all the basic models

Simulation as a method for asymptotic system behavior identification (e.g. water frog hemiclonal population systems)

Studying any system requires development of ways to describe the variety of its conditions. Such development includes three steps. The first one is to identify groups of similar systems (associative typology). The second one is to identify groups of objects which are similar in characteristics important for their description (analytic typology). The third one is to arrange systems into groups based on their predicted common future (dynamic typology). We propose a method to build such a dynamic topology for a system. The first step is to build a simulation model of studied systems. The model must be undetermined and simulate stochastic processes. The model generates distribution of the studied systems output parameters with the same initial parameters. We prove the correctness of the model by aligning the parameters sets generated by the model with the set of the original systems conditions evaluated empirically. In case of a close match between the two, we can presume that the model is adequately describing the dynamics of the studied systems. On the next stage, we should determine the probability distribution of the systems transformation outcome. Such outcomes should be defined based on the simulation of the transformation of the systems during the time sufficient to determine its fate. If the systems demonstrate asymptotic behavior, its phase space can be divided into pools corresponding to its different future state prediction. A dynamic typology is determined by which of these pools each system falls into. We implemented the pipeline described above to study water frog hemiclonal population systems. Water frogs (Pelophylax esculentus complex) is an animal group displaying interspecific hybridization and non-mendelian inheritance

Time Series Cluster Kernel for Learning Similarities between Multivariate Time Series with Missing Data

Similarity-based approaches represent a promising direction for time series analysis. However, many such methods rely on parameter tuning, and some have shortcomings if the time series are multivariate (MTS), due to dependencies between attributes, or the time series contain missing data. In this paper, we address these challenges within the powerful context of kernel methods by proposing the robust \emph{time series cluster kernel} (TCK). The approach taken leverages the missing data handling properties of Gaussian mixture models (GMM) augmented with informative prior distributions. An ensemble learning approach is exploited to ensure robustness to parameters by combining the clustering results of many GMM to form the final kernel. We evaluate the TCK on synthetic and real data and compare to other state-of-the-art techniques. The experimental results demonstrate that the TCK is robust to parameter choices, provides competitive results for MTS without missing data and outstanding results for missing data.Comment: 23 pages, 6 figure

Smart monitoring of aeronautical composites plates based on electromechanical impedance measurements and artificial neural networks

This paper presents a structural health monitoring (SHM) method for in situ damage detection and localization in carbon fiber reinforced plates (CFRPs). The detection is achieved using the electromechanical impedance (EMI) technique employing piezoelectric transducers as high-frequency modal sensors. Numerical simulations based on the finite element method are carried out so as to simulate more than a hundred damage scenarios. Damage metrics are then used to quantify and detect changes between the electromechanical impedance spectrum of a pristine and damaged structure. The localization process relies on artificial neural networks (ANNs) whose inputs are derived from a principal component analysis of the damage metrics. It is shown that the resulting ANN can be used as a tool to predict the in-plane position of a single damage in a laminated composite plate

An Assessment of PIER Electric Grid Research 2003-2014 White Paper

This white paper describes the circumstances in California around the turn of the 21st century that led the California Energy Commission (CEC) to direct additional Public Interest Energy Research funds to address critical electric grid issues, especially those arising from integrating high penetrations of variable renewable generation with the electric grid. It contains an assessment of the beneficial science and technology advances of the resultant portfolio of electric grid research projects administered under the direction of the CEC by a competitively selected contractor, the University of California’s California Institute for Energy and the Environment, from 2003-2014

Disentangling causal webs in the brain using functional Magnetic Resonance Imaging: A review of current approaches

In the past two decades, functional Magnetic Resonance Imaging has been used to relate neuronal network activity to cognitive processing and behaviour. Recently this approach has been augmented by algorithms that allow us to infer causal links between component populations of neuronal networks. Multiple inference procedures have been proposed to approach this research question but so far, each method has limitations when it comes to establishing whole-brain connectivity patterns. In this work, we discuss eight ways to infer causality in fMRI research: Bayesian Nets, Dynamical Causal Modelling, Granger Causality, Likelihood Ratios, LiNGAM, Patel's Tau, Structural Equation Modelling, and Transfer Entropy. We finish with formulating some recommendations for the future directions in this area