Object recognition using multilayer Hopfield neural network

Reachable set bounding for neural networks with mixed delays: Reciprocally convex approach

This paper discusses the reachable set estimation problem of neural networks with mixed delays. Firstly, by means of the maximal Lyapunov-Krasovskii functional, we obtain a non-ellipsoid form of the reachable set. Further more, when calculating the derivative of the maximum Lyapunov functional, the lower bound lemma and reciprocally convex approach method are used to solve the reciprocally convex combination term, which reduce the related decision variables. Secondly, we extend the results to polytopic uncertainties neural networks and consider the case of uncertain differentiable parameters. Finally, two numerical examples and one application example are listed to show the validity of our methods.

On Global Dissipativity of Nonautonomous Neural Networks With Multiple Proportional Delays

This brief addresses the problem of global dissipativity analysis of nonautonomous neural networks with multiple proportional delays. By using a novel constructive approach based on some comparison techniques for differential inequalities, new explicit delay-independent conditions are derived using M-matrix theory to ensure the existence of generalized exponential attracting sets and the global dissipativity of the system. The method presented in this brief is also utilized to derive a generalized exponential estimate for a class of Halanay-type inequalities with proportional delays. Finally, three numerical examples are given to illustrate the effectiveness and improvement of the obtained results.

Adaptive Exponential Synchronization of Multislave Time-Delayed Recurrent Neural Networks With Lévy Noise and Regime Switching

This paper discusses the problem of adaptive exponential synchronization in mean square for a new neural network model with the following features: 1) the noise is characterized by the Lévy process and the parameters of the model change in line with the Markovian process; 2) the master system is also disturbed by the same Lévy noise; and 3) there are multiple slave systems, and the state matrix of each slave system is an affine function of the state matrices of all slave systems. Based on the Lyapunov functional theory, the generalized Itô's formula, -matrix method, and the adaptive control technique, some criteria are established to ensure the adaptive exponential synchronization in the mean square of the master system and each slave system. Moreover, the update law of the control gain and the dynamic variation of the parameters of the slave systems are provided. Finally, the effectiveness of the synchronization criteria proposed in this paper is verified by a practical example.

Synchronization of generalized reaction-diffusion neural networks with time-varying delays based on general integral inequalities and sampled-data control approach

This paper explores the problem of synchronization of a class of generalized reaction-diffusion neural networks with mixed time-varying delays. The mixed time-varying delays under consideration comprise of both discrete and distributed delays. Due to the development and merits of digital controllers, sampled-data control is a natural choice to establish synchronization in continuous-time systems. Using a newly introduced integral inequality, less conservative synchronization criteria that assure the global asymptotic synchronization of the considered generalized reaction-diffusion neural network and mixed delays are established in terms of linear matrix inequalities (LMIs). The obtained easy-to-test LMI-based synchronization criteria depends on the delay bounds in addition to the reaction-diffusion terms, which is more practicable. Upon solving these LMIs by using Matlab LMI control toolbox, a desired sampled-data controller gain can be acuqired without any difficulty. Finally, numerical examples are exploited to express the validity of the derived LMI-based synchronization criteria.

Synchronization of Neural Networks With Control Packet Loss and Time-Varying Delay via Stochastic Sampled-Data Controller

This paper addresses the problem of exponential synchronization of neural networks with time-varying delays. A sampled-data controller with stochastically varying sampling intervals is considered. The novelty of this paper lies in the fact that the control packet loss from the controller to the actuator is considered, which may occur in many real-world situations. Sufficient conditions for the exponential synchronization in the mean square sense are derived in terms of linear matrix inequalities (LMIs) by constructing a proper Lyapunov-Krasovskii functional that involves more information about the delay bounds and by employing some inequality techniques. Moreover, the obtained LMIs can be easily checked for their feasibility through any of the available MATLAB tool boxes. Numerical examples are provided to validate the theoretical results.

Synchronization for coupled neural networks with interval delay: a novel augmented Lyapunov-Krasovskii functional method

This paper is concerned with the synchronization problems for an array of neural networks with hybrid coupling and interval time-varying delay. First, a novel augmented Lyapunov-Krasovskii functional (LKF) method is proposed to develop delay-dependent synchronization criteria for the networks, which makes use of more relaxed conditions by employing the new type of augmented matrices with Kronecker product operation. The proposed method can handle a multitude of Kronecker product operations in the LKF and alleviates the requirements of the positive definiteness of some conditional matrices which are usually considered in the existing methods for complex networks. This leads to a significant improvement in the performance of the synchronization criteria, i.e., less conservative synchronization results can be obtained. Meanwhile, the case of fast time-varying delay can also be handled by the proposed method. Furthermore, based on the derived criteria, a robust synchronization criterion is obtained for the system with uncertainties both in coefficient and coupling matrix terms. Since an expression based on linear matrix inequality is used, the proposed criteria can be easily checked in practice. Finally, numerical examples are provided to show the effectiveness of the proposed method.

Robust exponential stability of uncertain delayed neural networks with stochastic perturbation and impulse effects

This paper focuses on the hybrid effects of parameter uncertainty, stochastic perturbation, and impulses on global stability of delayed neural networks. By using the Ito formula, Lyapunov function, and Halanay inequality, we established several mean-square stability criteria from which we can estimate the feasible bounds of impulses, provided that parameter uncertainty and stochastic perturbations are well-constrained. Moreover, the present method can also be applied to general differential systems with stochastic perturbation and impulses.

A unified approach to the stability of generalized static neural networks with linear fractional uncertainties and delays

In this paper, the robust global asymptotic stability (RGAS) of generalized static neural networks (SNNs) with linear fractional uncertainties and a constant or time-varying delay is concerned within a novel input-output framework. The activation functions in the model are assumed to satisfy a more general condition than the usually used Lipschitz-type ones. First, by four steps of technical transformations, the original generalized SNN model is equivalently converted into the interconnection of two subsystems, where the forward one is a linear time-invariant system with a constant delay while the feedback one bears the norm-bounded property. Then, based on the scaled small gain theorem, delay-dependent sufficient conditions for the RGAS of generalized SNNs are derived via combining a complete Lyapunov functional and the celebrated discretization scheme. All the results are given in terms of linear matrix inequalities so that the RGAS problem of generalized SNNs is projected into the feasibility of convex optimization problems that can be readily solved by effective numerical algorithms. The effectiveness and superiority of our results over the existing ones are demonstrated by two numerical examples.

Image recognition in the presence of non-Gaussian noise with unknown statistics

We design receivers to detect a known pattern or a reference signal in the presence of very general and non-Gaussian types of noise. Three sources of input-noise degradation are considered: additive, multiplicative, and disjoint background. The detection process involves two steps: (1) estimation of the relevant noise parameters within the framework of hypothesis testing and (2) maximizing a certain metric that measures the likelihood of the target being at a given location. The parameter estimation portion is carried out by moment-matching techniques. Because of the number of unknown parameters and the fact that various types of input-noise processes are non-Gaussian, the methods that are used to estimate these parameters differ from the standard methods of maximizing the likelihood function. To verify the existence of the target at a certain location, we use l(p)-norm metric for p > or = 0 to measure the likelihood of the target being present at the location of interest. Computer simulations are used to show that for the images tested here, the receivers designed herein perform better than some existing receivers.

Foveal automatic target recognition using a multiresolution neural network

This paper presents a method for detecting and classifying a target from its foveal (graded resolution) imagery using a multiresolution neural network. Target identification decisions are based on minimizing an energy function. This energy function is evaluated by comparing a candidate blob with a library of target models at several levels of resolution simultaneously available in the current foveal image. For this purpose, a concurrent (top-down-and-bottom-up) matching procedure is implemented via a novel multilayer Hopfield neural network. The associated energy function supports not only interactions between cells at the same resolution level, but also between sets of nodes at distinct resolution levels. This permits features at different resolution levels to corroborate or refute one another contributing to an efficient evaluation of potential matches. Gaze control, refoveation to more salient regions of the available image space, is implemented as a search for high resolution features which will disambiguate the candidate blob. Tests using real two-dimensional (2-D) objects and their simulated foveal imagery are provided.