Optimum Algorithm to Minimize Human Interactions in Sequential Computer Assisted Pattern Recognition
Pattern Recognition Letters
Given a Pattern Recognition task, Computer Assisted Pattern Recognition can be viewed as a series of solution proposals made by a computer system, followed by corrections made by a user, until an acceptable solution is found. For this kind of systems, the appropriate measure of performance is the expected number of corrections the user has to make.
In the present work we study the special case when the solution proposals have a sequential nature. Some examples of this type of tasks are: language translation, speech transcription and handwriting text transcription. In all these cases the output (the solution proposal) is a sequence of symbols. In this framework it is assumed that the user corrects always the rst error found in the proposed solution. As a consequence, the prex of the proposed solution before the last error correction can be assumed error free in the next iteration.
Nowadays, all the techniques in the literature relies in proposing, at each step, the most probable sufix given that a prefix of the "correct" output is already known. Usually the computation of the conditional most probable output is an NP-Hard or an undecidable problem (and then we have to apply some approximations) or, in some simple cases, complex dynamic programming techniques should be used (usualy some variant of the Viterbi algorithm).
In the present work we show that this strategy is not optimum when we are interested in minimizing the number of human interactions. Moreover we describe the optimum strategy that is simpler (and usually faster) to compute.
|Project Keyword:||Project Keyword UNSPECIFIED|
|Subjects:||Theory & Algorithms|
|Deposited By:||Jose Oncina|
|Deposited On:||13 March 2009|