On the discriminability of keystroke feature vectors used in fixed text keystroke authentication
Pattern Recognition Letters
KNOWME: An Energy-Efficient Multimodal Body Area Network for Physical Activity Monitoring
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Hi-index | 754.84 |
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.