Delay PCNN and Its Application for Optimization

作者: Xiaodong Gu , Liming Zhang , Daoheng Yu

DOI: 10.1007/978-3-540-28647-9_69

关键词:

摘要: This paper introduces the DPCNN (Delay Pulse Coupled Neural Network) based on PCNN and uses to find shortest path. Cauflield Kinser introduced method solve maze[1] although their also can be used path, a large quantity of neurons are needed. However, approach proposed in this needed very fewer than by Kinser. Meanwhile, due parallel pulse transmission characteristic DPCNN, our path quickly. The computational complexity is only related length independent weighted graph number existed paths graph.

参考文章(8)
F. Ricca, P. Tonella, Understanding and restructuring Web sites with ReWeb IEEE MultiMedia. ,vol. 8, pp. 40- 51 ,(2001) , 10.1109/93.917970
Joshua B Tenenbaum, Vin de Silva, John C Langford, A Global Geometric Framework for Nonlinear Dimensionality Reduction Science. ,vol. 290, pp. 2319- 2323 ,(2000) , 10.1126/SCIENCE.290.5500.2319
A. Ephremides, S. Verdu, Control and optimization methods in communication network problems IEEE Transactions on Automatic Control. ,vol. 34, pp. 930- 942 ,(1989) , 10.1109/9.35806
R. Eckhorn, H. J. Reitboeck, M. Arndt, P. Dicke, Feature linking via synchronization among distributed assemblies: Simulations of results from cat visual cortex Neural Computation. ,vol. 2, pp. 293- 307 ,(1990) , 10.1162/NECO.1990.2.3.293
John L. Johnson, Dieter Ritter, Observation of periodic waves in a pulse-coupled neural network Optics Letters. ,vol. 18, pp. 1253- 1255 ,(1993) , 10.1364/OL.18.001253
J.L. Johnson, M.L. Padgett, PCNN models and applications IEEE Transactions on Neural Networks. ,vol. 10, pp. 480- 498 ,(1999) , 10.1109/72.761706
H.J. Caulfield, J.M. Kinser, Finding the shortest path in the shortest time using PCNN's IEEE Transactions on Neural Networks. ,vol. 10, pp. 604- 606 ,(1999) , 10.1109/72.761718