Share Email Print
cover

Proceedings Paper

Fast parallel architecture for automated identification
Author(s): John Sura; R. Rudy; R. Larsen; E. Juttlestad; B. Marant
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 7 February 1997
PDF: 12 pages
Proc. SPIE 2940, National and International Law Enforcement Databases, (7 February 1997); doi: 10.1117/12.266279
Show Author Affiliations
John Sura, Lockheed Martin Information Systems (United States)
R. Rudy, Lockheed Martin Information Systems (United States)
R. Larsen, Lockheed Martin Information Systems (United States)
E. Juttlestad, Lockheed Martin Information Systems (United States)
B. Marant, Lockheed Martin Information Systems (United States)


Published in SPIE Proceedings Vol. 2940:
National and International Law Enforcement Databases
George Works, Editor(s)

© SPIE. Terms of Use
Back to Top