Paper
1 September 1995 Similarity judgments serving eyewitness identification
Avraham Levi, Noam Jungmann, Arie Aperman
Author Affiliations +
Abstract
Current police tools of identification are flawed. The lineup suffers from being too small and no adequate solution to a criterion of similar foils. The mugshot search suffers from too many photos and inadequate procedures for choosing an appropriate subset. The composite, from inappropriate methods of selecting facial features. Our new mugshot search provides solutions to some of the problems. Witnesses choose photos similar to the offender, and the computer, using a similarity network, helps witnesses reach the offender faster. Replacing mugshots with foils, we can use the same technique as a lineup, that is significantly enlarged and leaves the choice of similar foils to the witnesses. When the mugshot search fails, a composite can be composed as a superimposition of the photos most similar to the offender. Several algorithms were tested for implementing the similarity network. They involve both the establishment of a meaningful distance criterion within 'face space' and the usage of efficient search strategies. Here, we discuss their benefits and drawbacks. A system comprising the full local album of the Haifa district (more than 10,000 photos) is presently being subjected to a field test by the Isreali police. We briefly describe the system and its user interface.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Avraham Levi, Noam Jungmann, and Arie Aperman "Similarity judgments serving eyewitness identification", Proc. SPIE 2567, Investigative and Trial Image Processing, (1 September 1995); https://doi.org/10.1117/12.218478
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Composites

Prototyping

Distance measurement

Human-machine interfaces

Databases

Sensors

Forensic science

Back to Top