Entropy based Biometric Template Clustering

Though speed and accuracy are two competing requirements for large scale biometric recognition, they both suffer from large database size. Clustering seems promising to reduce the search space. This can improve accuracy, but may even contrarily affect it by a poor selection of the candidate cluster for the search. We present a novel technique that exploits gallery entropy for clustering. The comparison with K-Means demonstrates that we achieve a better clustering result, yet without fixing the number of clusters a-priori

Entropy based biometric template clustering

Though speed and accuracy are two competing requirements for large scale biometric recognition, they both suffer from large database size. Clustering seems promising to reduce the search space. This can improve accuracy, but may even contrarily affect it by a poor selection of the candidate cluster for the search. We present a novel technique that exploits gallery entropy for clustering. The comparison with K-Means demonstrates that we achieve a better clustering result, yet without fixing the number of clusters a-priori

Entropy based Biometric Template Clustering

Though speed and accuracy are two competing requirements for large scale biometric recognition, they both suffer from large database size. Clustering seems promising to reduce the search space. This can improve accuracy, but may even contrarily affect it by a poor selection of the candidate cluster for the search. We present a novel technique that exploits gallery entropy for clustering. The comparison with K-Means demonstrates that we achieve a better clustering result, yet without fixing the number of clusters a-priori