arrow
返回

Optimum algorithm to minimize human interactions in sequential Computer Assisted Pattern Recognition

delete2009-04-01
delete8
delete
OA
AI
J
José Oncina *
DOI:10.1016/j.patrec.2008.11.009delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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 first error found in the proposed solution. As a consequence, the prefix 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 suffix 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 (usually 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. (c) 2008 Elsevier B.V. All rights reserved.
Keyword:
Computer Assisted Pattern Recognition
Minimizing human interaction
Optimum parsing
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
8.0K
被引数:
1.6W

机构

暂无机构信息
引用论文

引用论文

Language understanding and subsequential transducer learning
err1998-06-01
err8
PREAI
errCastellanos, A; Vidal, E; Varo, MA; Oncina, J
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Utility Theories in Cooperative Games
err2004-01-01
err0
PREAI
errMamoru Kaneko; Myrna H. Wooders
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
An emerging template of CSR in Switzerland
err2015-01-01
err0
errOAAI
errStéphanie Looser; Walter Wehrmeyer
err分享
err收藏
没有更多内容