A biometric system provides poor performances when the input data exhibit intra-class variations which are not well represented by the enrolled template set. This problem has been recently faced by template update techniques. The majority of the proposed techniques can be regarded as ldquoself-updaterdquo methods, as the system updates its own templates using the recognition results provided by the same templates. However, this approach can only exploit the input data ldquonearrdquo to the current templates resulting in ldquolocalrdquo template optimization, namely, only input samples very similar to the current templates are exploited for update. To address this issue, this paper proposes a ldquoglobalrdquo optimization of templates based on the graph mincut algorithm. The proposed approach can update templates by analysing the underlying structure of input data collected during the systempsilas operation. This is achieved by a graph drawn using a pair-wise similarity measure between enrolled and input data. Investigation of this novel template update technique has been done by its application to face verification, as a case study. The reported results show the effectiveness of the proposed technique in comparison to state of art self-update techniques.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Biometric template update using the graph mincut algorithm: a case study in face verification|
|Data di pubblicazione:||2008|
|Tipologia:||4.1 Contributo in Atti di convegno|