Skip to main content
Kent Academic Repository

Comparing Evolutionary Operators, Search Spaces, and Evolutionary Algorithms in the Construction of Facial Composites

Mist, Joseph J., Gibson, Stuart J., Solomon, Christopher J. (2015) Comparing Evolutionary Operators, Search Spaces, and Evolutionary Algorithms in the Construction of Facial Composites. Informatica, . pp. 135-145. ISSN 0350-5596. (KAR id:49161)

Abstract

Facial composite construction is one of the most successful applications of interactive evolutionary computation.

In spite of this, previous work in the area of composite construction has not investigated the

algorithm design options in detail. We address this issue with four experiments. In the first experiment a

sorting task is used to identify the 12 most salient dimensions of a 30-dimensional search space. In the second

experiment the performances of two mutation and two recombination operators for interactive genetic

algorithms are compared. In the third experiment three search spaces are compared: a 30-dimensional

search space, a mathematically reduced 12-dimensional search space, and a 12-dimensional search space

formed from the 12 most salient dimensions. Finally, we compare the performances of an interactive

genetic algorithm to interactive differential evolution. Our results show that the facial composite construction

process is remarkably robust to the choice of evolutionary operator(s), the dimensionality of the search

space, and the choice of interactive evolutionary algorithm. We attribute this to the imprecise nature of human

face perception and differences between the participants in how they interact with the algorithms.

Povzetek: Kompozitna gradnja obrazov je ena izmed najbolj uspešnih aplikacij interaktivnega evolucijskega

ra?cunanja. Kljub temu pa do zdaj na podro?cju kompozitne gradnje niso bile podrobno raziskane

možnosti snovanja algoritma. To vprašanje smo obravnavali s štirimi poskusi. V prvem je uporabljeno

sortiranje za identifikacijo 12 najbolj izstopajo?cih dimenzij 30-dimenzionalnega preiskovalnega prostora.

V drugem primerjamo u?cinkovitost dveh mutacij in dveh rekombinacijskih operaterjev za interaktivni

genetski algoritem. V tretjem primerjamo tri preiskovalne prostore: 30-dimenzionalni, matemati?cno reducirani

12-dimenzionalni in 12-dimenzionalni prostor sestavljen iz 12 najpomembnejših dimenzij. Na

koncu smo primerjali uspešnost interaktivnega genetskega algoritma z interaktivno diferencialno evolucijo.

Rezultati kažejo, da je proces kompozitne gradnje obrazov izredno robusten glede na izbiro evolucijskega

operatorja(-ev), dimenzionalnost preiskovalnega prostora in izbiro interaktivnega evolucijskega algoritma.

To pripisujemo nenatan?cni naravi percepcije in razlikam med interakcijami uporabnikov z algoritmom.

Item Type: Article
Subjects: Q Science > QA Mathematics (inc Computing science)
Divisions: Divisions > Division of Natural Sciences > Physics and Astronomy
Depositing User: Stuart Gibson
Date Deposited: 25 Jun 2015 15:15 UTC
Last Modified: 05 Nov 2024 10:33 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/49161 (The current URI for this page, for reference purposes)

University of Kent Author Information

Mist, Joseph J..

Creator's ORCID:
CReDIT Contributor Roles:

Gibson, Stuart J..

Creator's ORCID: https://orcid.org/0000-0002-7981-241X
CReDIT Contributor Roles:

Solomon, Christopher J..

Creator's ORCID: https://orcid.org/0000-0002-5057-4614
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.