Paper
6 April 1995 Computational problems in the linear perceptron: a possible solution--dynamic definition of net topology
Author Affiliations +
Abstract
With respect to Rosenblatt linear perceptron, two classical limitation theorems demonstrated by M. Minsky and S. Papert are discussed. These two theorems, `(Psi) One-in-a-box' and `(Psi) Parity,' ultimately concern the intrinsic limitations of parallel calculations in pattern recognition problems. We demonstrate a possible solution of these limitation problems by substituting the static definition of characteristic functions and of their domains in the `geometrical' perceptron, with their dynamic definition. This dynamic consists in the mutual redefinition of the characteristic function and of its domain depending on the matching with the input.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Antonio Luigi Perrone and Gianfranco Basti "Computational problems in the linear perceptron: a possible solution--dynamic definition of net topology", Proc. SPIE 2492, Applications and Science of Artificial Neural Networks, (6 April 1995); https://doi.org/10.1117/12.205098
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Retina

Computer architecture

Calculus

Chemical elements

Focus stacking software

Fourier transforms

Gold

RELATED CONTENT

Steerable filter for 3D euclidian motion
Proceedings of SPIE (September 23 1999)
Object-oriented reasoning in cognitive systems
Proceedings of SPIE (June 23 2000)
B-spline surface fairing with boundary constraint
Proceedings of SPIE (July 31 2002)

Back to Top