Please use this identifier to cite or link to this item: https://research.academicanalytical.com/jspui/handle/1471/26
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGray, Cameron C.-
dc.contributor.authorAl-Maliki, Shatha F.-
dc.contributor.authorVidal, Franck P.-
dc.date.accessioned2018-07-06T09:16:23Z-
dc.date.available2018-07-06T09:16:23Z-
dc.date.issued2018-07-04-
dc.identifier.issn1389-2576en_GB
dc.identifier.other10.1007/s10710-018-9330-7en_GB
dc.identifier.urihttps://research.shadowraider.com/jspui/handle/1471/26-
dc.description.abstractThis work is based on a cooperative co-evolution algorithm called ‘Fly Algorithm’, which is an evolutionary algorithm (EA) where individuals are called ‘flies’. It is a specific case of the ‘Parisian Approach’ where the solution of an optimisation problem is a set of individuals (e.g. the whole pop- ulation) instead of a single individual (the best one) as in typical EAs. The optimisation problem considered here is tomography reconstruction in positron emission tomography (PET). It estimates the concentration of a radioactive substance (called a radiotracer) within the body. Tomography, in this context, is considered as a difficult ill-posed inverse problem. The Fly Algorithm aims at optimising the position of 3-D points that mimic the radiotracer. At the end of the optimisation process, the fly population is extracted as it corresponds to an estimate of the radioactive concentration. During the optimisation loop a lot of data is generated by the algorithm, such as image metrics, duration, and internal states. This data is recorded in a log file that can be post-processed and visualised. We propose using information visualisation and user interac- tion techniques to explore the algorithm’s internal data. Our aim is to better understand what happens during the evolutionary loop. Using an example, we demonstrate that it is possible to interactively discover when an early termi- nation could be triggered. It is implemented in a new stopping criterion. It is tested on two other examples on which it leads to a 60% reduction of the number of iterations without any loss of accuracy.en_GB
dc.language.isoenen_GB
dc.publisherSpringer: Genetic Programming and Evolvable Machinesen_GB
dc.subjectFly Algorithmen_GB
dc.subjecttomography reconstructionen_GB
dc.subjectInformation visualizationen_GB
dc.subjectdata explorationen_GB
dc.subjectartifical evolutionen_GB
dc.subjectParisian evolutionen_GB
dc.titleData exploration in evolutionary reconstruction of PET imagesen_GB
dc.typePreprinten_GB
Appears in Collections:Accepted Papers

Files in This Item:
File Description SizeFormat 
Vis4Fly_SUBMISSION_3_to__Genetic_Programming_and_Evolvable_Machines_04_07_18.pdfPaper Pre-print3.51 MBAdobe PDFView/Open
10.1007_s10710-018-9330-7.pdfPaper Off-Print (Springer Nature Open Access)4.5 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.