## Abstract Cellular neural networks (CNNs) are well suited for image processing due to the possibility of a parallel computation. In this paper, we present two algorithms for tracking and obstacle avoidance using CNNs. Furthermore, we show the implementation of an autonomous robot guided using onl
An efficient concurrent implementation of a neural network algorithm
β Scribed by R. Andonie; A. T. Chronopoulos; D. Grosu; H. Galmeanu
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 202 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.987
No coin nor oath required. For personal study only.
β¦ Synopsis
The focus of this study is how we can efficiently implement the neural network backpropagation algorithm on a network of computers (NOC) for concurrent execution. We assume a distributed system with heterogeneous computers and that the neural network is replicated on each computer. We propose an architecture model with efficient pattern allocation that takes into account the speed of processors and overlaps the communication with computation. The training pattern set is distributed among the heterogeneous processors with the mapping being fixed during the learning process. We provide a heuristic pattern allocation algorithm minimizing the execution time of backpropagation learning. The computations are overlapped with communications. Under the condition that each processor has to perform a task directly proportional to its speed, this allocation algorithm has polynomial-time complexity. We have implemented our model on a dedicated network of heterogeneous computers using Sejnowski's NetTalk benchmark for testing.
π SIMILAR VOLUMES
## Abstract This paper investigates the prediction of Class A pan evaporation using the artificial neural network (ANN) technique. The ANN back propagation algorithm has been evaluated for its applicability for predicting evaporation from minimum climatic data. Four combinations of input data were
In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho