Created by W.Langdon from gp-bibliography.bib Revision:1.8098
Aladdin JAVA.
Output is written to one of a number of scratch planes (memory) 'temporary workspaces where an image plane can be stored.' 'the gene [ADDP rD0 rS1 wS2] applies pixel-by-pixel addition to two input planes, read from data plane 0 and from scratch plane 1, and writes its output to scratch plane 2.' 'GENIE performs an analysis of chromosome graphs when they are created and only carries out those processing steps that actually affect the final result. Therefore, the fixed length of the chromosome acts as a maximum effective length.'
hamming distance fitness
pop=50. 30 gens. max chrome size 20. 3 scratch registers.
'The best evolved image-processing algorithm had the chromosome, [OPEN rD1 wS1 1 1][ADDS rD4 wS3 0.34][NEG rS1 wS1][MULTP rD4 rS3 wS2] [LINCOMB rS1 rD6 wS3 0.11][ADDP rS1 rS3 wS1][SUBP rS1 rD5 wS1]'
'The final values of S1, S2, and S3 are then combined in the linear sum, where the coefficients and intercept have been chosen by the Fisher discriminant, as described in Section 2.3, above, to produce our real-valued answer plane A (Figure 6): A = 0.0147*S1 - 0.0142*S2 + 0.0134*S3 + 1.554'
'Adjusting the threshold on A to fall at the between-peak minimum of the histogram at 0.7930 (a different optimisation criterion for the threshold than that used by default by GENIE) produces a new Boolean mask, Figure 9, in which almost all the false positives have been removed, and the remaining pixels marked as burn correspond very closely to the high severity burn regions in the BAER map'",
Genetic Programming entries for Steven P Brumby Jeffrey J Bloch Neal R Harvey James Theiler Simon Perkins A Cody Young John J Szymanski