Solomon, Christopher J., Gibson, Stuart J., Mist, Joseph J. (2013) Interactive evolutionary generation of facial composites for locating suspects in criminal investigations. Applied Soft Computing, 13 (7). pp. 3298-3306. ISSN 1568-4946. (doi:10.1016/j.asoc.2013.02.010) (KAR id:33909)
PDF
Author's Accepted Manuscript
Language: English |
|
Download this file (PDF/709kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1016/j.asoc.2013.02.010 |
Abstract
Statistical appearance models have previously been used for computer face recognition applications in which
an image patch is synthesized and morphed to match a target face image using an automated iterative fitting
algorithm. Here we describe an alternative use for appearance models, namely for producing facial composite
images (sometimes referred to as E-FIT or PhotoFIT images). This application poses an interesting real-
world optimization problem because the target face exists in the mind of the witness and not in a tangible
form such as a digital image. To solve this problem we employ an interactive evolutionary algorithm that
allows the witness to evolve a likeness to the target face. A system based on our approach, called EFIT-V,
is used frequently by three quarters of UK police constabularies.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1016/j.asoc.2013.02.010 |
Uncontrolled keywords: | Facial Composite, Interactive Evolutionary Algorithm, Statistical Appearance Model, Facial Identification, EFIT-V, Interactive Evolution Strategy |
Subjects: | Q Science |
Divisions: | Divisions > Division of Natural Sciences > Physics and Astronomy |
Depositing User: | Stuart Gibson |
Date Deposited: | 16 May 2013 11:48 UTC |
Last Modified: | 05 Nov 2024 10:17 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/33909 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):