Neural network transformation of arbitrary Boolean functions

Basit Hussain; Mansur R. Kabuka

doi:10.1117/12.130842

16 December 1992 Neural network transformation of arbitrary Boolean functions

Basit Hussain, Mansur R. Kabuka

Proceedings Volume 1766, Neural and Stochastic Methods in Image and Signal Processing; (1992) https://doi.org/10.1117/12.130842
Event: San Diego '92, 1992, San Diego, CA, United States

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.

Citation Download Citation

Basit Hussain and Mansur R. Kabuka "Neural network transformation of arbitrary Boolean functions", Proc. SPIE 1766, Neural and Stochastic Methods in Image and Signal Processing, (16 December 1992); https://doi.org/10.1117/12.130842

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available