Optimal Low Complexity Combinations
Low complexity combinations are the simplest and most
commonly. Same combination function is used for all classes and it
accepts only the matching scores of a single class as input. In this
project we are trying to determine what are the optimal combination
functions for this type of combinations.
We distinguish two operating modes of the system:
identification mode and verification mode. 
Main results:
- We proved that optimal combination functions are different
for identification and verification modes
- Optimal combination function for verification operating
mode coincides with likelihood ratio of genuine and impostor matching
scores (well-known result), but optimal combination function for
identification operating mode is difficult to find.
- We proposed two iterative approximation algorithms for
finding optimal combination function for identification operating mode.