Object Recognition Supported by User Interaction for Service Robots
DOI: 10.1109/icpr.2002.1044806
|View full text |Cite
|
Sign up to set email alerts
|

Rejection strategies and confidence measures for a k-NN classifier in an OCR task

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
28
0

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(28 citation statements)
references
References 4 publications
0
28
0
Order By: Relevance
“…A revision of the expression to compute the a posteriori probability based on [15] and [2] applied to k-NN is used. In this case, the estimation involves computing the nearest neighbor prototype for each class and normalizing the inverse of the distance.…”
Section: Verification System Schemesmentioning
confidence: 99%
See 1 more Smart Citation
“…A revision of the expression to compute the a posteriori probability based on [15] and [2] applied to k-NN is used. In this case, the estimation involves computing the nearest neighbor prototype for each class and normalizing the inverse of the distance.…”
Section: Verification System Schemesmentioning
confidence: 99%
“…The normalized sigmoids of the distances to the discriminant functions are taken as the estimates for the posterior probabilities. On the other hand, Arlandis et al [2] proposed an interesting method based on the k-NN, focused only on the distances to the k-NN prototypes, assigning a zero probability to the prototypes outside that neighborhood. Nevertheless, in most cases, the zero probability is not a realistic situation.…”
Section: Introductionmentioning
confidence: 99%
“…In such a case, the option of rejection to classify a pattern should be applied. The reject option is a subject of many works (Cordella et al 1995, Ha 1996a, Baram 1998, Fumera et al 2000, Duda et al 2001, Sansone et al 2001, Arlandis et al 2002, SantosPereira and Pires 2005. The principal approach in analysing the trade-off between a potential error and rejection is conventionally formulated in terms of posterior probabilities of different classes: if the posterior probability of the best class label is high, then the label is attached to the pattern and reported; if not, the classification is not performed (reject option); see, for example, Battiti and Colla (1994).…”
Section: Introductionmentioning
confidence: 99%
“…The condences of the single classiers are based on the Euclidean distance to the training set samples. We use a modication of the expression to compute a posteriory probability based on [3] and proposed in [4]. The estimation isP (ω i |x) where ω i is the i-th class and x is a new example to classify.…”
Section: Classication Schemesmentioning
confidence: 99%
“…There are some works which use condence methods based in a posteriory probabilities (according to the Bayes theory) in classication, as in [3], where several formulas are proposed to estimate this probability, and in [4], where the authors propose a method based on the k-Nearest Neighbour rule.…”
Section: Introductionmentioning
confidence: 99%