By Topic

A modified sequential recognition machine using time-varying stopping boundaries

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

2 Author(s)

The problem of optimally terminating the sequential recognition procedure at a finite time prespecified by the designer is considered. The application arises, in practice, when the receptor (feature extraction) part of a sequential recognition machine has only a finite number of suitable features available to the categorizer (decision) part, or the cost of taking observation is found too high as the recognition process exceeds a certain time limit. In either case, the urgency to terminate the recognition procedure becomes greater when the available measurements are to be exhausted. The problem is studied by considering time-varying stopping boundaries for the sequential procedure such that by a preassigned length of time, the acceptance and rejection regions meet and, therefore, one of the pattern classes has to be accepted as the terminal decision. The idea of varying the stopping rules as a function of time enables us to investigate the behavior of a modified sequential test as compared to the standard Wald test with constant stopping boundaries. Computer simulation of English character recognition using the modified sequential test procedure indicates very satisfactory results.

Published in:

Information Theory, IEEE Transactions on  (Volume:12 ,  Issue: 2 )