Related Experiment Videos
A novel recurrent neural network with one neuron and finite-time convergence for k-winners-take-all operation
Qingshan Liu1, Chuangyin Dang, Jinde Cao
1School of Automation, Southeast University, Nanjing 210096, China. qsliu@seu.edu.cn
Abstract:
In this paper, based on a one-neuron recurrent neural network, a novel k-winners-take-all ( k -WTA) network is proposed. Finite time convergence of the proposed neural network is proved using the Lyapunov method. The k-WTA operation is first converted equivalently into a linear programming problem. Then, a one-neuron recurrent neural network is proposed to get the kth or (k+1)th largest inputs of the k-WTA problem. Furthermore, a k-WTA network is designed based on the proposed neural network to perform the k-WTA operation. Compared with the existing k-WTA networks, the proposed network has simple structure and finite time convergence. In addition, simulation results on numerical examples show the effectiveness and performance of the proposed k-WTA network.
Related Concept Videos
Neural Circuits
Neuronal pools are collections of nerve cells with similar functions and interact through chemical and electrical signals. These pools include both interneurons (the central neural circuit nodes that...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Multi-input and Multi-variable systems
In the absence of...
Network Function of a Circuit