NobleBlocks

Research indexJournal article

Fast Algorithm For Pattern Recognition Using Test Theory

Okagaki, Hsing

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE18 Jan 1988

NobleIDark:/48914/w1/20260522/507E575CDOI10.1117/12.942140

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

By applying the test theory, an object can be placed into a subspace within the hyperspace of features, which in turn gives a probability of correct classification (predictive value or diagnosability). Once the predictive value reaches or exceeds the predetermined confidence limit after a finite number of observations (tests) of the features, no additional observation is necessary. A discriminant for a given feature is set from empirical values ("experiences"), an observation of a feature needs not be a precise measure. Instead, a comparison whether the feature is greater or lesser than the discriminant can be used. Information of tests will give clues to decide the sequence of the tests in a descending order of information to classify an object with the minimum number of observa-tions. These strategies reduce the time required for observations of features and computation, and shortens the execution of pattern recognition.

Discussion

Topics

More

Suggest a correction or report