An Efficient Indexing Scheme for Iris Biometric Using K-d-b Trees

Hunny Mehrotra, Banshidhar Majhi. An Efficient Indexing Scheme for Iris Biometric Using K-d-b Trees. In De-Shuang Huang, Kang-Hyun Jo, Yong-Quan Zhou, Kyungsook Han, editors, Intelligent Computing Theories and Technology - 9th International Conference, ICIC 2013, Nanning, China, July 28-31, 2013. Proceedings. Volume 7996 of Lecture Notes in Computer Science, pages 475-484, Springer, 2013. [doi]

@inproceedings{MehrotraM13-0,
  title = {An Efficient Indexing Scheme for Iris Biometric Using K-d-b Trees},
  author = {Hunny Mehrotra and Banshidhar Majhi},
  year = {2013},
  doi = {10.1007/978-3-642-39482-9_55},
  url = {http://dx.doi.org/10.1007/978-3-642-39482-9_55},
  researchr = {https://researchr.org/publication/MehrotraM13-0},
  cites = {0},
  citedby = {0},
  pages = {475-484},
  booktitle = {Intelligent Computing Theories and Technology - 9th International Conference, ICIC 2013, Nanning, China, July 28-31, 2013. Proceedings},
  editor = {De-Shuang Huang and Kang-Hyun Jo and Yong-Quan Zhou and Kyungsook Han},
  volume = {7996},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-39481-2},
}