By Topic

A class of upper bounds on probability of error for multihypotheses pattern recognition (Corresp.)

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 class of upper bounds on the probability of error for the general multihypotheses pattern recognition problem is obtained. In particular, an upper bound in the class is shown to be a linear functional of the pairwise Bhattacharya coefficients. Evaluation of the bounds requires knowledge of a priori probabilities and of the hypothesis-conditional probability density functions. A further bound is obtained that is independent of a priori probabilities. For the case of unknown a priori probabilities and conditional probability densities, an estimate of the latter upper bound is derived using a sequence of classified samples and Kernel functions to estimate the unknown densities.

Published in:

Information Theory, IEEE Transactions on  (Volume:15 ,  Issue: 6 )