2019
DOI: 10.1007/s10032-019-00333-0
|View full text |Cite
|
Sign up to set email alerts
|

On optimal stopping strategies for text recognition in a video stream as an application of a monotone sequential decision model

Abstract: The paper describes the problem of stopping the text field recognition process in a video stream, which is a novel problem, particularly relevant to real-time mobile document recognition systems. A decision-theoretic framework for this problem is provided, and similarities with existing stopping rule problems are explored. Following the theoretical works on monotone stopping rule problems, a strategy is proposed based on thresholding the estimation of the expected difference between consequent recognition resu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 14 publications
(27 citation statements)
references
References 27 publications
0
27
0
Order By: Relevance
“…Anytime algorithms as a way of thinking about algorithms with quantifiable goals are useful when the cost of computation (whether in terms of time or other quantities) is comparable, or at least relevant, in relation to the cost of error. Intelligent systems such as decision support systems [36] and computer vision systems [37]- [39] use the model of anytime algorithms to represent and manage the trade-off between the quality of the result and the time required to obtain it. If the tomographic procedure is not broken down into separate stages scanning and reconstruction, the tomographic scanning cost can be either expressed in terms of time required to collect the projections, or in terms of radiation dose delivered to the object.…”
Section: Reconstruction As An Anytime Algorithmmentioning
confidence: 99%
See 3 more Smart Citations
“…Anytime algorithms as a way of thinking about algorithms with quantifiable goals are useful when the cost of computation (whether in terms of time or other quantities) is comparable, or at least relevant, in relation to the cost of error. Intelligent systems such as decision support systems [36] and computer vision systems [37]- [39] use the model of anytime algorithms to represent and manage the trade-off between the quality of the result and the time required to obtain it. If the tomographic procedure is not broken down into separate stages scanning and reconstruction, the tomographic scanning cost can be either expressed in terms of time required to collect the projections, or in terms of radiation dose delivered to the object.…”
Section: Reconstruction As An Anytime Algorithmmentioning
confidence: 99%
“…For the case of monotone stopping problems where the error term of the loss function (1) is expressed as a distance ρ from an obtained result to the ground truth, i.e. (R n , θ) = ρ(R n , R * (θ)), in the paper [37] an approximation of the myopic rule (11) is proposed. Instead of estimating the difference between the current error and the expected error at the next stage it is proposed to estimate the expected distance between the current result to the result which would be obtained on the next stage.…”
Section: E Solving the Stopping Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…This method, however, is not fully formalized and raises the questions of tuning the clustering parameters. In [15] [3] video stream recognition stopping as a monotone sequential decision problem. It presents a stopping strategy derived from the properties of monotone stopping problems, however it was tested only for text recognition results as simple strings, without any per-character alternatives.…”
Section: Introductionmentioning
confidence: 99%