Damer, NaserNaserDamerTerhörst, PhilippPhilippTerhörstBraun, AndreasAndreasBraunKuijper, ArjanArjanKuijper2022-03-132022-03-132017https://publica.fraunhofer.de/handle/publica/39747010.1007/978-3-319-64698-5_17Indexing of iris data is required to facilitate fast search in large-scale biometric systems. Previous works addressing this issue were challenged by the tradeoffs between accuracy, computational efficacy, storage costs, and maintainability. This work presents an iris indexing approach based on rotation invariant iris representation and LSH-Forest to produce an accurate and easily maintainable indexing structure. The complexity of insertion or deletion in the proposed method is limited to the same logarithmic complexity of a query and the required storage grows linearly with the database size. The proposed approach was extended into a multi-instance iris indexing scheme resulting in a clear performance improvement. Single iris indexing scored a hit rate of 99.7% at a 0.1% penetration rate while multi-instance indexing scored a 99.98% hit rate at the same penetration rate. The evaluation of the proposed approach was conducted on a large database of 50k references and 50k probes of the left and the right irises. The advantage of the proposed solution was put into prospective by comparing the achieved performance to the reported results in previous works.enbiometricsmultibiometricsIris recognitionindexingCRISPLead Topic: Digitized WorkLead Topic: Smart CityResearch Line: Computer vision (CV)Research Line: Human computer interaction (HCI)006conference paper