A Parapropagation Pattern Classifier
暂无分享,去创建一个
A matrix of simple, identical intercommunicating cells is the core of a pattern classifier that can sort two-valued, two-dimensional patterns, such as alphabetic symbols. The matrix yields information about a patterm mapped on its cells by reporting whether or not a threshold exceeds the number of cells that remain in a ``zero'' state after a sequence of operations that include directed cell-to-cell propagations of change of state. The pattern furnishes a barrier to the propagations. The testing process is a program written to suit some alphabet of pattern classes. An automatic sequencer for controlling the testing process is described. The testing operations are few, but they can be combined in tests for an abundance of features of great variety. A computer simulation, using a single decision tree, classifies the commonest press and typewriter fonts. A small manually sequenced model employing integrated microelectronic cells has been built.
[1] J. Deutsch,et al. The Plexiform Zone and Shape Recognition in the Octopus , 1960, Nature.
[2] C. Y. Lee,et al. A content addressable distributed logic memory with applications to information retrieval , 1963 .
[3] Mary Elizabeth Stevens. Abstract shape recognition by machine , 1961, AFIPS '61 (Eastern).
[4] S. H. Unger,et al. Pattern Detection and Recognition , 1959, Proceedings of the IRE.