The design and analysis of spatial data structures
The design and analysis of spatial data structures
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Digital Image Processing
An efficient randomized algorithm for detecting circles
Computer Vision and Image Understanding
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Handbook of Biometrics
A novel iris segmentation method for hand-held capture device
ICB'06 Proceedings of the 2006 international conference on Advances in Biometrics
Indexing biometric databases using pyramid technique
AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
IEEE Transactions on Circuits and Systems for Video Technology
How to handle missing data in robust multi-biometrics verification
International Journal of Biometrics
Hi-index | 0.00 |
This paper proposes an efficient indexing technique which can be used in an identification system with large multimodal biometric database. In this technique, multi-dimensional feature vectors of each trait (iris, signature, ear and face) are normalised and projected to a lower dimensional feature space. The reduced feature vectors are fused at feature level and used to index the database by forming Kd-tree. The performance of the proposed technique is also analysed with the feature vectors of all traits by first fusing them and projecting the fused feature vector to a lower dimensional space, and using it for indexing. Performance is also compared with the indexing based on score-level fusion. The experiment is performed on a multimodal database consisting of 5400 images of 150 subjects (i.e. nine images per subject, per trait). Out of the nine, eight images are used for training and one is used for testing. Our experiment shows that the proposed technique significantly reduces the data retrieval time along with possible error rates.