Abstract
The competitive pulse coupled neural network (CPCNN) model is proposed based on the pulse coupled neural network (PCNN), the properties of pulse wave propagation of the CPCNN are analyzed for the solution of network shortest routing. The setting terms of the neuron parameters for the pulse wave propagation along the routing of the shortest path tree (SPT) of network routing graph are educed. The simulation results show that the proposed method is better than Dijkstra algorithm when the network routing graph holds many nodes. With the nodes number of the network increasing, the number of iterations of our algorithm will basically hold the line. The method shows better computational performance and dominance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eckhorn, R., Reitboeck, H.J., Arndt, M., Dicke, P.: Feature Linking via Synchronization among Distributed Assemblies: Simulation of Result from Cat Visual Cortex. Neutral Comput. 2(3), 293–307 (1990)
Gu, X.D., Guom, S.D., et al.: A New Approach for Automated Image Segmentation Based on Unit Linking PCNN. In: Proceedings of 2002 International Conference on Machine Learning and Cybernetics, pp. 175–178. IEEE Press, Beijing (2002)
Muresan, R.C.: Pattern Recognition Using Pulse-coupled Neural Networks and Discrete Fourier Transforms. Neurocomputing 51, 487–493 (2003)
Gu, X.D., Yu, D.H., Zhang, L.M.: Finding the Shortest Path Based on Delay. Acta Electronica Sinica 32(9), 1441–1443 (2004) (in Chinese)
Song, Y.M., Yuan, D.L.: An Algorithm for Finding the Shortest Path of Labyrinth Based on PCNN Model. Journal of Circuits and Systems 10(3), 72–75 (2005) (in Chinese)
Zhang, J.Y., Wang, D.F., Shi, M.H.: Finding Shortest Path in Shortest Time with Output Threshold Coupled Neural Networks. Science in China (Series E) 33(6), 522–530 (2003)
Caufield, H.J., Kinser, J.M.: Finding Shortest Path in the Shortest Time Using PCNN’s. IEEE Trans. on Neural Networks 10(3), 604–606 (1999)
Johnson, J.L., Padgett, M.L.: PCNN Models and Application. IEEE Trans. on Neural Networks 10(3), 480–498 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, D., Nie, R., Zhao, D. (2008). A New Algorithm for Finding the Shortest Path Tree Using Competitive Pulse Coupled Neural Network. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-85984-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85983-3
Online ISBN: 978-3-540-85984-0
eBook Packages: Computer ScienceComputer Science (R0)