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
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
Local feature based retrieval approach for iris biometrics
Frontiers of Computer Science: Selected Publications from Chinese Universities
Parallel geometric hashing for robust iris indexing
Journal of Real-Time Image Processing
Hi-index | 0.00 |
This paper proposes an efficient indexing technique that can be used in an identification system with large multimodal biometric databases. The proposed technique is based on Kd-tree with feature level fusion which uses the multi- dimensional feature vector. A multi dimensional feature vector of each trait is first normalized and then, it is projected to a lower dimensional feature space. The reduced dimensional feature vectors are fused at feature level and the fused feature vectors are used to index the database by forming Kd-tree. The proposed method reduces the data retrieval time along with possible error rates. The system is tested on multimodal databases (feature level fusion of ear, face, iris and signature) consists of 5400 images of 150 subjects (i.e. 9 images per subject per trait). Out of the 9, 8 images are used for training and 1 is used for testing. The performance of the proposed indexing technique has been compared with indexing based on score level fusion. It is found that proposed technique based on feature level fusion performs better than score level fusion.