On limits to perception and pattern recognition
- 37 Downloads
We propose certain general conditions that we believe are reasonable for any pattern recognition algorithm. We find that these conditions give rise to paradoxical identification. The algorithms are incapable of distinguishing composite patterns and must be able to distinguish patterns at an atomistic level.
KeywordsInput Pattern Feature Detector Composite Pattern Impossibility Theorem Pattern Recognition Algorithm
Unable to display preview. Download preview PDF.
- Arrow, K. J. 1963.Social Choice and Individual Values. New York: Wiley.Google Scholar
- Diogenes, Laertius. 1925.Lives of Eminent Philosophers vii, 82. Harvard University Press.Google Scholar
- Domany, E., R. Meir and W. Kinzel. 1986.Europhys. Lett. 2, 175.Google Scholar
- Kelly, J. S. 1978.Arrow Impossibility Theorems. AP.Google Scholar
- Minsky, M. L. and S. Papert. 1969.Perceptrons. Cambridge, MA: MIT.Google Scholar
- Rosenblatt, F. 1961.Principles of Neurodynamics. Washington DC: Spartan.Google Scholar