• DocumentCode
    2698630
  • Title

    Solving the tag assignment problem for neural networks with simulated assemblies of minicolumns

  • Author

    Strong, Gary W.

  • fYear
    1990
  • fDate
    17-21 June 1990
  • Firstpage
    499
  • Abstract
    A computer simulation of cell assemblies in which groups of minicolumns behave as discrete representations was developed. A neurally plausible model which simulates both the parallel processes that may give rise to illusory conjunctions and the serial processes that may solve the tag-assignment problem in normal perception has been constructed. Each simulated minicolumn is a local population of neuronal elements that share intracolumnar activity and have similar intercolumnar connections. The model for the neuronal elements is a simplification of the Hodgkin-Huxley model. A Hebbian learning rule models the development of LTP-type connection strength between pairs of minicolumns that are simultaneously active. A simulated fovea moves over a two-dimensional stimulus space in saccade-like steps, with direction and extent determined by competitive integration of location detectors for off-fovea stimuli
  • Keywords
    learning systems; neural nets; Hebbian learning rule; Hodgkin-Huxley model; LTP-type connection strength; cell assemblies; illusory conjunctions; intercolumnar connections; intracolumnar activity; minicolumns; serial processes; tag-assignment; two-dimensional stimulus space;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1990., 1990 IJCNN International Joint Conference on
  • Conference_Location
    San Diego, CA, USA
  • Type

    conf

  • DOI
    10.1109/IJCNN.1990.137889
  • Filename
    5726847