• Articles • Previous Articles     Next Articles

The Complexity of Recognition in the Single-Layered PLN Network with Feedback Connections

Zhang Bo; Zhang Ling;   

  1. Dept.of; Computer; Science; Technology; Tsinghua; University; Beijing; 100084; Mathematics; Anqing; Teachers'; College; Anhui; 246011;
  • Online:1993-07-10 Published:1993-07-10

Regarding a single-layered PLN network with feedback connections as an associative memory network,the complexity of recognition is discussed.We have the main result:if the size of the network N is m,then the complexity of recognition is an exponential function of m.The necessary condition under which the complexity of recognition is polynomial is given.

Key words: adaptive color histogram; mean shift; head tracking;

[1] Zhang Bo. Zhang Ling et al., The quantitative analysis of the behaviors of the PLN network. Neural Networks. 1992. 5(4), pp.639-644.

[2] Zhang Bo. Zhang Ling et al., The Complexity of Learning Algorithm in PLN Network. International Joint Conference on Neural Network (IJCNN'9l), Singapore, Nov.1991.

[3] I.Aleksander (eds.), Neural Computing Architectures. MIT Press. 1989. ………
[1] LIU Qingshan (刘青山), MA Songde (马颂德) and LU Hanqing (卢汉青). Head Tracking Using Shapes and Adaptive Color Histograms [J]. , 2002, 17(6): 0-0.
Full text



No Suggested Reading articles found!

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved