2009
DOI: 10.1007/978-3-642-03070-3_13
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Score Combination: A Supervised and Unsupervised Score Combination Method

Abstract: In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a larger degree of separation than those of the scores to be combined. Typically, combination is carried out by a “static” linear combination of scores, where the weights are computed by maximising a performance function. These weights are equal for all the patterns, as they are assigned to each of the expert to be combined. In this pa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0
2

Year Published

2010
2010
2021
2021

Publication Types

Select...
4
3
1

Relationship

3
5

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 12 publications
0
11
0
2
Order By: Relevance
“…), and we used a set of support vector machines (SVMs) to compute a frame level confidence score of being a real session or not. To obtain an high separation between score distributions we combined these similarity scores by means of the Dynamic Score Combination methodology [25]. This type of analysis can be performed also frame by frame.…”
Section: Amilabmentioning
confidence: 99%
“…), and we used a set of support vector machines (SVMs) to compute a frame level confidence score of being a real session or not. To obtain an high separation between score distributions we combined these similarity scores by means of the Dynamic Score Combination methodology [25]. This type of analysis can be performed also frame by frame.…”
Section: Amilabmentioning
confidence: 99%
“…To this end, we test majority voting (MV), which is a well-known technique that accepts as class of a tested video sequence, the one with the most votes from the employed classifiers. Furthermore, inspired by the work of [22], we employ Dynamic Score Combination (DSC) [23] [24] and Particle Swarm Optimization (PSO) [25]. DSC attempts to combine the individual probabilities in a way that the combined probability distribution exhibits a larger separation than the probability distribution produced by the individual classifiers.…”
Section: Methodsmentioning
confidence: 99%
“…For the both stages the team used Dynamic Score Combination [22] as a score-level fusion rule that allows dynamically choosing the best scores and weights to be combined. It requires computation of a weight parameter via majority voting [21].…”
Section: Summaries Of the Anti-spoofing Algorithmsmentioning
confidence: 99%