By Topic

Construction of a Complex-Valued Nonlinear Discriminant Function for Pattern Recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A method for constructing a new type of nonlinear discriminant function is proposed, and the capability is evaluated by computer simulation. As the orthogonal basis for this function, a ¿-function system is used that is obtained by generalizing the finite Walsh functions to the case of many-valued variables. The discriminant function discussed has the following desired features. It can deal with not only binary patterns, but also many-valued ones. The determination of a weighting vector requires neither storage nor iteration for training patterns. A notion of complexity between pattern classes is introduced to make clear the requirement of the present system for the structure of a pattern space. Examples of separation boundaries for 2-component-pattern classes demonstrate that the discriminant function has a high ability of generalization for new input patterns. The result of recognition experiments for artificial patterns indicates that for various values of the number of pattern components, the number of values taken by a component, and the complexity of pattern classes, the proposed system has sufficient rates of classification with a relatively small number of training patterns.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-1 ,  Issue: 3 )