Share Email Print

Proceedings Paper

Fast Algorithm For Pattern Recognition Using Test Theory
Author(s): Takashi Okagaki; T.Russell Hsing
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 18 January 1988
PDF: 4 pages
Proc. SPIE 0829, Applications of Digital Image Processing X, (18 January 1988); doi: 10.1117/12.942140
Show Author Affiliations
Takashi Okagaki, University of Minnesota Medical School and Bell Communication Research (United States)
T.Russell Hsing, University of Minnesota Medical School and Bell Communication Research (United States)

Published in SPIE Proceedings Vol. 0829:
Applications of Digital Image Processing X
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top