Image-based quantitative analysis of gold immunochromatographic strip via cellular neural network approach

Gold immunochromatographic strip assay provides a rapid, simple, single-copy and on-site way to detect the presence or absence of the target analyte. This paper aims to develop a method for accurately segmenting the test line and control line of the gold immunochromatographic strip (GICS) image for quantitatively determining the trace concentrations in the specimen, which can lead to more functional information than the traditional qualitative or semi-quantitative strip assay. The canny operator as well as the mathematical morphology method is used to detect and extract the GICS reading-window. Then, the test line and control line of the GICS reading-window are segmented by the cellular neural network (CNN) algorithm, where the template parameters of the CNN are designed by the switching particle swarm optimization (SPSO) algorithm for improving the performance of the CNN. It is shown that the SPSO-based CNN offers a robust method for accurately segmenting the test and control lines, and therefore serves as a novel image methodology for the interpretation of GICS. Furthermore, quantitative comparison is carried out among four algorithms in terms of the peak signal-to-noise ratio. It is concluded that the proposed CNN algorithm gives higher accuracy and the CNN is capable of parallelism and analog very-large-scale integration implementation within a remarkably efficient time.

Scale-limited activating sets and multiperiodicity for threshold-linear networks on time scales

The existing results for multiperiodicity of threshold-linear networks (TLNs) are scale-free on time evolution and hence exhibit some restrictions. Due to the nature of the scale-limited activating set, it is interesting to study the dynamical properties of neurons on time scales. In this paper we analyze and obtain results concerning nondivergence, attractivity, and multiperiodic dynamics of TLNs on time scales. Using the notion of exponential functions on time scales, we obtain results for scale-limited type criteria for boundedness and global attractivity of TLNs. Moreover, by constructing simple algebraic inequalities over scale-limited activating sets, we achieve results regarding multiperiodicity of TLNs. This will show that each scale-limited activating set depends on scale-synchronous self-excitation, and the existence of inactive neurons will slow down convergence of TLNs. At the end of the paper, we perform computer simulations to illustrate the obtained new theories.

Delay-dependent stability criteria for reaction–diffusion neural networks with time-varying delays

This paper studies the global asymptotic stability problem of a class of reaction–diffusion neural networks with time-varying delays. To overcome the difficulty caused by the partial differential term, a novel Lyapunov–Krasovskii functional is proposed, and a partial differential equation technique together with a linear operator approach are also applied to obtain the delay-dependent stability criteria, which are less conservative than the existing results. Finally, simulation examples are given to verify and illustrate the theoretical analysis.

Multistability of two kinds of recurrent neural networks with activation functions symmetrical about the origin on the phase plane

In this paper, we investigate multistability of two kinds of recurrent neural networks with time-varying delays and activation functions symmetrical about the origin on the phase plane. One kind of activation function is with zero slope at the origin on the phase plane, while the other is with nonzero slope at the origin on the phase plane. We derive sufficient conditions under which these two kinds of n-dimensional recurrent neural networks are guaranteed to have (2m+1)(n) equilibrium points, with (m+1)(n) of them being locally exponentially stable. These new conditions improve and extend the existing multistability results for recurrent neural networks. Finally, the validity and performance of the theoretical results are demonstrated through two numerical examples.

Implementation of Recurrent Artificial Neural Networks for Nonlinear Dynamic Modeling in Biomedical Applications

Simulation is indispensable during the design of many biomedical prostheses that are based on fundamental electrical and electronic actions. However, simulation necessitates the use of adequate models. The main difficulties related to the modeling of such devices are their nonlinearity and dynamic behavior. Here we report the application of recurrent artificial neural networks for modeling of a nonlinear, two-terminal circuit equivalent to a specific implantable hearing device. The method is general in the sense that any nonlinear dynamic two-terminal device or circuit may be modeled in the same way. The model generated was successfully used for simulation and optimization of a driver (operational amplifier)-transducer ensemble. This confirms our claim that in addition to the proper design and optimization of the hearing actuator, optimization in the electronic domain, at the electronic driver circuit-to-actuator interface, should take place in order to achieve best performance of the complete hearing aid.

FPGA-based distributed computing microarchitecture for complex physical dynamics investigation

In this paper, we present a distributed computing system, called DCMARK, aimed at solving partial differential equations at the basis of many investigation fields, such as solid state physics, nuclear physics, and plasma physics. This distributed architecture is based on the cellular neural network paradigm, which allows us to divide the differential equation system solving into many parallel integration operations to be executed by a custom multiprocessor system. We push the number of processors to the limit of one processor for each equation. In order to test the present idea, we choose to implement DCMARK on a single FPGA, designing the single processor in order to minimize its hardware requirements and to obtain a large number of easily interconnected processors. This approach is particularly suited to study the properties of 1-, 2- and 3-D locally interconnected dynamical systems. In order to test the computing platform, we implement a 200 cells, Korteweg-de Vries (KdV) equation solver and perform a comparison between simulations conducted on a high performance PC and on our system. Since our distributed architecture takes a constant computing time to solve the equation system, independently of the number of dynamical elements (cells) of the CNN array, it allows us to reduce the elaboration time more than other similar systems in the literature. To ensure a high level of reconfigurability, we design a compact system on programmable chip managed by a softcore processor, which controls the fast data/control communication between our system and a PC Host. An intuitively graphical user interface allows us to change the calculation parameters and plot the results.

Impulsive control for existence, uniqueness, and global stability of periodic solutions of recurrent neural networks with discrete and continuously distributed delays

In this paper, a class of recurrent neural networks with discrete and continuously distributed delays is considered. Sufficient conditions for the existence, uniqueness, and global exponential stability of a periodic solution are obtained by using contraction mapping theorem and stability theory on impulsive functional differential equations. The proposed method, which differs from the existing results in the literature, shows that network models may admit a periodic solution which is globally exponentially stable via proper impulsive control strategies even if it is originally unstable or divergent. Two numerical examples and their computer simulations are offered to show the effectiveness of our new results.

Global consensus theorem and self-organized criticality: unifying principles for understanding self-organization, swarm intelligence and mechanisms of carcinogenesis

Complex biological systems manifest a large variety of emergent phenomena among which prominent roles belong to self-organization and swarm intelligence. Generally, each level in a biological hierarchy possesses its own systemic properties and requires its own way of observation, conceptualization, and modeling. In this work, an attempt is made to outline general guiding principles in exploration of a wide range of seemingly dissimilar phenomena observed in large communities of individuals devoid of any personal intelligence and interacting with each other through simple stimulus-response rules. Mathematically, these guiding principles are well captured by the Global Consensus Theorem (GCT) equally applicable to neural networks and to Lotka-Volterra population dynamics. Universality of the mechanistic principles outlined by GCT allows for a unified approach to such diverse systems as biological networks, communities of social insects, robotic communities, microbial communities, communities of somatic cells, social networks and many other systems. Another cluster of universal laws governing the self-organization in large communities of locally interacting individuals is built around the principle of self-organized criticality (SOC). The GCT and SOC, separately or in combination, provide a conceptual basis for understanding the phenomena of self-organization occurring in large communities without involvement of a supervisory authority, without system-wide informational infrastructure, and without mapping of general plan of action onto cognitive/behavioral faculties of its individual members. Cancer onset and proliferation serves as an important example of application of these conceptual approaches. In this paper, the point of view is put forward that apparently irreconcilable contradictions between two opposing theories of carcinogenesis, that is, the Somatic Mutation Theory and the Tissue Organization Field Theory, may be resolved using the systemic approaches provided by GST and SOC.

Stability for neural networks with time-varying delays via some new approaches

This paper considers the problem of delay-dependent stability criteria for neural networks with time-varying delays. First, by constructing a newly augmented Lyapunov-Krasovskii functional, a less conservative stability criterion is established in terms of linear matrix inequalities. Second, by proposing novel activation function conditions which have not been proposed so far, further improved stability criteria are proposed. Finally, three numerical examples used in the literature are given to show the improvements over the existing criteria and the effectiveness of the proposed idea.

A scalable neuristor built with Mott memristors

The Hodgkin-Huxley model for action potential generation in biological axons is central for understanding the computational capability of the nervous system and emulating its functionality. Owing to the historical success of silicon complementary metal-oxide-semiconductors, spike-based computing is primarily confined to software simulations and specialized analogue metal-oxide-semiconductor field-effect transistor circuits. However, there is interest in constructing physical systems that emulate biological functionality more directly, with the goal of improving efficiency and scale. The neuristor was proposed as an electronic device with properties similar to the Hodgkin-Huxley axon, but previous implementations were not scalable. Here we demonstrate a neuristor built using two nanoscale Mott memristors, dynamical devices that exhibit transient memory and negative differential resistance arising from an insulating-to-conducting phase transition driven by Joule heating. This neuristor exhibits the important neural functions of all-or-nothing spiking with signal gain and diverse periodic spiking, using materials and structures that are amenable to extremely high-density integration with or without silicon transistors.

Multistability of neural networks with Mexican-hat-type activation functions

In this paper, we are concerned with a class of neural networks with Mexican-hat-type activation functions. Due to the different structure from neural networks with saturated activation functions, a set of new sufficient conditions are presented to study the multistability, including the total number of equilibrium points, their locations, and stability. Furthermore, the attraction basins of stable equilibrium points are investigated for two-neuron neural networks. The investigation shows that the stable manifolds of unstable equilibrium points constitute the boundaries of attraction basins of stable equilibrium points. Several illustrative examples are given to verify the effectiveness of our results.

Machine learning and radiology

In this paper, we give a short introduction to machine learning and survey its applications in radiology. We focused on six categories of applications in radiology: medical image segmentation, registration, computer aided detection and diagnosis, brain function or activity analysis and neurological disease diagnosis from fMR images, content-based image retrieval systems for CT or MRI images, and text analysis of radiology reports using natural language processing (NLP) and natural language understanding (NLU). This survey shows that machine learning plays a key role in many radiology applications. Machine learning identifies complex patterns automatically and helps radiologists make intelligent decisions on radiology data such as conventional radiographs, CT, MRI, and PET images and radiology reports. In many applications, the performance of machine learning-based automatic detection and diagnosis systems has shown to be comparable to that of a well-trained and experienced radiologist. Technology development in machine learning and radiology will benefit from each other in the long run. Key contributions and common characteristics of machine learning techniques in radiology are discussed. We also discuss the problem of translating machine learning applications to the radiology clinical setting, including advantages and potential barriers.

A competitive layer model for cellular neural networks

This paper discusses a Competitive Layer Model (CLM) for a class of recurrent Cellular Neural Networks (CNNs) from continuous-time type to discrete-time type. The objective of the CLM is to partition a set of input features into salient groups. The complete convergence of such networks in continuous-time type has been discussed first. We give a necessary condition, and a necessary and sufficient condition, which allow the CLM performance existence in our networks. We also discuss the properties of such networks of discrete-time type, and propose a novel CLM iteration method. Such method shows similar performance and storage allocation but faster convergence compared with the previous CLM iteration method (Wersing, Steil, & Ritter, 2001a). Especially for a large scale network with many features and layers, it can significantly reduce the computing time. Examples and simulation results are used to illustrate the developed theory, the comparison between two CLM iteration methods, and the application in image segmentation.

Theorems and application of local activity of CNN with five state variables and one port

Coupled nonlinear dynamical systems have been widely studied recently. However, the dynamical properties of these systems are difficult to deal with. The local activity of cellular neural network (CNN) has provided a powerful tool for studying the emergence of complex patterns in a homogeneous lattice, which is composed of coupled cells. In this paper, the analytical criteria for the local activity in reaction-diffusion CNN with five state variables and one port are presented, which consists of four theorems, including a serial of inequalities involving CNN parameters. These theorems can be used for calculating the bifurcation diagram to determine or analyze the emergence of complex dynamic patterns, such as chaos. As a case study, a reaction-diffusion CNN of hepatitis B Virus (HBV) mutation-selection model is analyzed and simulated, the bifurcation diagram is calculated. Using the diagram, numerical simulations of this CNN model provide reasonable explanations of complex mutant phenomena during therapy. Therefore, it is demonstrated that the local activity of CNN provides a practical tool for the complex dynamics study of some coupled nonlinear systems.

Exponential stability of delayed and impulsive cellular neural networks with partially Lipschitz continuous activation functions

The paper discusses exponential stability of distributed delayed and impulsive cellular neural networks with partially Lipschitz continuous activation functions. By relative nonlinear measure method, some novel criteria are obtained for the uniqueness and exponential stability of the equilibrium point. Our method abandons usual assumptions on global Lipschitz continuity, boundedness and monotonicity of activation functions. Our results are generalization and improvement of some existing ones. Finally, two examples and their simulations are presented to illustrate the correctness of our analysis.

A voltage mode memristor bridge synaptic circuit with memristor emulators

A memristor bridge neural circuit which is able to perform signed synaptic weighting was proposed in our previous study, where the synaptic operation was verified via software simulation of the mathematical model of the HP memristor. This study is an extension of the previous work advancing toward the circuit implementation where the architecture of the memristor bridge synapse is built with memristor emulator circuits. In addition, a simple neural network which performs both synaptic weighting and summation is built by combining memristor emulators-based synapses and differential amplifier circuits. The feasibility of the memristor bridge neural circuit is verified via SPICE simulations.

Robustness analysis of global exponential stability of recurrent neural networks in the presence of time delays and random disturbances

In recent years, the global stability of recurrent neural networks (RNNs) has been investigated extensively. It is well known that time delays and external disturbances can derail the stability of RNNs. In this paper, we analyze the robustness of global stability of RNNs subject to time delays and random disturbances. Given a globally exponentially stable neural network, the problem to be addressed here is how much time delay and noise the RNN can withstand to be globally exponentially stable in the presence of delay and noise. The upper bounds of the time delay and noise intensity are characterized by using transcendental equations for the RNNs to sustain global exponential stability. Moreover, we prove theoretically that, for any globally exponentially stable RNNs, if additive noises and time delays are smaller than the derived lower bounds arrived at here, then the perturbed RNNs are guaranteed to also be globally exponentially stable. Three numerical examples are provided to substantiate the theoretical results.

A novel cloning template designing method by using an artificial bee colony algorithm for edge detection of CNN based imaging sensors

Cellular Neural Networks (CNNs) have been widely used recently in applications such as edge detection, noise reduction and object detection, which are among the main computer imaging processes. They can also be realized as hardware based imaging sensors. The fact that hardware CNN models produce robust and effective results has attracted the attention of researchers using these structures within image sensors. Realization of desired CNN behavior such as edge detection can be achieved by correctly setting a cloning template without changing the structure of the CNN. To achieve different behaviors effectively, designing a cloning template is one of the most important research topics in this field. In this study, the edge detecting process that is used as a preliminary process for segmentation, identification and coding applications is conducted by using CNN structures. In order to design the cloning template of goal-oriented CNN architecture, an Artificial Bee Colony (ABC) algorithm which is inspired from the foraging behavior of honeybees is used and the performance analysis of ABC for this application is examined with multiple runs. The CNN template generated by the ABC algorithm is tested by using artificial and real test images. The results are subjectively and quantitatively compared with well-known classical edge detection methods, and other CNN based edge detector cloning templates available in the imaging literature. The results show that the proposed method is more successful than other methods.

A NEW METHOD FOR THE RE-IMPLEMENTATION OF THRESHOLD LOGIC FUNCTIONS WITH CELLULAR NEURAL NETWORKS

A new strategy is presented for the implementation of threshold logic functions with binary-output Cellular Neural Networks (CNNs). The objective is to optimize the CNNs weights to develop a robust implementation. Hence, the concept of generative set is introduced as a convenient representation of any linearly separable Boolean function. Our analysis of threshold logic functions leads to a complete algorithm that automatically provides an optimized generative set. New weights are deduced and a more robust CNN template assuming the same function can thus be implemented. The strategy is illustrated by a detailed example.

RELAXED STABILITY CONDITIONS FOR DELAYED RECURRENT NEURAL NETWORKS WITH POLYTOPIC UNCERTAINTIES

This paper investigates the problem of stability analysis for recurrent neural networks with time-varying delays and polytopic uncertainties. Parameter-dependent Lypaunov functionals are employed to obtain sufficient conditions that guarantee the robust global exponential stability of the equilibrium point of the considered neural network. The derived stability criteria are expressed in terms of a set of relaxed linear matrix inequalities, which can be easily tested by using commercially available software. Two numerical examples are provided to demonstrate the effectiveness of the proposed results.

STABILITY ANALYSIS OF A CLASS OF GENERAL PERIODIC NEURAL NETWORKS WITH DELAYS AND IMPULSES

Based on the inequality analysis, matrix theory and spectral theory, a class of general periodic neural networks with delays and impulses is studied. Some sufficient conditions are established for the existence and globally exponential stability of a unique periodic solution. Furthermore, the results are applied to some typical impulsive neural network systems as special cases, with a real-life example to show feasibility of our results.

LMI-BASED ASYMPTOTIC STABILITY ANALYSIS OF NEURAL NETWORKS WITH TIME-VARYING DELAYS

The problem of the global asymptotic stability for a class of neural networks with time-varying delays is investigated in this paper, where the activation functions are assumed to be neither monotonic, nor differentiable, nor bounded. By constructing suitable Lyapunov functionals and combining with linear matrix inequality (LMI) technique, new global asymptotic stability criteria about different types of time-varying delays are obtained. It is shown that the criteria can provide less conservative result than some existing ones. Numerical examples are given to demonstrate the applicability of the proposed approach.

DELAY-DEPENDENT ROBUST EXPONENTIAL STABILITY FOR UNCERTAIN RECURRENT NEURAL NETWORKS WITH TIME-VARYING DELAYS

This paper considers the problem of robust exponential stability for a class of recurrent neural networks with time-varying delays and parameter uncertainties. The time delays are not necessarily differentiable and the uncertainties are assumed to be time-varying but norm-bounded. Sufficient conditions, which guarantee that the concerned uncertain delayed neural network is robustly, globally, exponentially stable for all admissible parameter uncertainties, are obtained under a weak assumption on the neuron activation functions. These conditions are dependent on the size of the time delay and expressed in terms of linear matrix inequalities. Numerical examples are provided to demonstrate the effectiveness and less conservatism of the proposed stability results.

FINGERPRINT IMAGE ENHANCEMENT USING CNN FILTERING TECHNIQUES

Due to noisy acquisition devices and variation in impression conditions, the ridgelines of fingerprint images are mostly corrupted by various kinds of noise causing cracks, scratches and bridges in the ridges as well as blurs. These cause matching errors in fingerprint recognition. For an effective recognition the correct ridge pattern is essential which requires the enhancement of fingerprint images. Segment by segment analysis of the fingerprint pattern yields various ridge direction and frequencies. By selecting a directional filter with correct filter parameters to match ridge features at each point, we can effectively enhance fingerprint ridges. This paper proposes a fingerprint image enhancement based on CNN Gabor-Type filters.