Situation assessment and autonomous control and optimisation of biometric sensor network
by Kalyan Veeramachaneni, Lisa Osadciw
International Journal of Biometrics (IJBM), Vol. 1, No. 4, 2009

Abstract: In this paper an adaptive sensor management algorithm is presented for a biometric sensor network. A distributed detection framework is adapted for varying security requirements in the network, by considering the trade-offs between accuracy and time. Accuracy and time are tied into a single weighted objective function and a particle swarm optimisation algorithm is designed to achieve best possible configurations for a given set of weights. Results are presented for different weights applied to the bi-objective problem. A Bayesian framework is proposed for estimating the a priori of the imposter in real time. This determines the security requirements of the network. The estimation uses the observations collected from the sensors for different individuals accessing the network via the distributed detection framework. The distributed detection framework is redesigned for the new updated a priori, resulting in a closed loop control of a biometric sensor network. Results show that the new adaptive sensor management algorithm leads to lower false acceptance and false rejection rates when compared to a network without the adaptive algorithm.

Online publication date: Sun, 19-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Biometrics (IJBM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email