Share Email Print

Proceedings Paper

Neural network transformation of arbitrary Boolean functions
Author(s): Basit Hussain; Mansur R. Kabuka
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Boolean logic is considered to be a good source for classification problems, an area dominated by neural networks. Although quite a few algorithms exist for training and implementing neural networks, no technique exists that can guarantee the transformation of any arbitrary Boolean function to neural networks. This paper describes a method that accomplishes exactly that. The algorithm is tested on the classic character recognition problem using translated, rotated, deformed, and noisy patterns. The initial simulation results are presented. Comparison of the proposed network to several popular existing networks has been performed and its advantages outlined. The future direction of research has also been explained.

Paper Details

Date Published: 16 December 1992
PDF: 13 pages
Proc. SPIE 1766, Neural and Stochastic Methods in Image and Signal Processing, (16 December 1992); doi: 10.1117/12.130842
Show Author Affiliations
Basit Hussain, Univ. of Miami (United States)
Mansur R. Kabuka, Univ. of Miami (United States)

Published in SPIE Proceedings Vol. 1766:
Neural and Stochastic Methods in Image and Signal Processing
Su-Shing Chen, Editor(s)

© SPIE. Terms of Use
Back to Top