7 February 1997 Fast parallel architecture for automated identification
Author Affiliations +
Proceedings Volume 2940, National and International Law Enforcement Databases; (1997) https://doi.org/10.1117/12.266279
Event: Enabling Technologies for Law Enforcement and Security, 1996, Boston, MA, United States
Abstract
The problem of using a search set of fingerprints to identify an individual as a member of a very large existing repository has long been of interest to law enforcement agencies. Partially automated approaches have been used that require significant search space reduction before automated techniques can be used. The time required to perform such an identification becomes onerous as the repository population size increases. An architectural approach to fully automating this one-on-many identification problem is presented and described. The use of automated search space reduction techniques combined with repository distribution across the architecture results in rapid identification response times by implementing a fully parallelized search. The architecture supports scalability in both workload and repository population. A detailed architectural simulation model was created and results were generated to predict performance. These results are presented and substantiate rapid identification response to one-on-many searches of very large fingerprint feature repositories.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John Sura, R. Rudy, R. Larsen, E. Juttlestad, B. Marant, "Fast parallel architecture for automated identification", Proc. SPIE 2940, National and International Law Enforcement Databases, (7 February 1997); doi: 10.1117/12.266279; https://doi.org/10.1117/12.266279
PROCEEDINGS
12 PAGES


SHARE
Back to Top