Cartesian Genetic Programming: Non-evolvable Endpoint

KC Kévin Cortacero
BM Brienne McKenzie
SM Sabina Müller
RK Roxana Khazen
FL Fanny Lafouresse
GC Gaëlle Corsaut
NA Nathalie Van Acker
FF François-Xavier Frenois
LL Laurence Lamant
NM Nicolas Meyer
BV Béatrice Vergier
DW Dennis G. Wilson
HL Hervé Luga
OS Oskar Staufer
MD Michael L. Dustin
SV Salvatore Valitutti
SC Sylvain Cussat-Blanc
request Request a Protocol
ask Ask a question
Favorite

We also introduce a new component extending CGP to IS using a determined final function called Endpoint. It is the last processing step before evaluation. It is a substantial bottleneck, not subject to optimization, of the syntactic graph. Moreover, the endpoint is the only node allowing the outcome size and type to change. We use Watershed Transform20 as the main algorithm to produce IS. In cell segmentation, the cell nuclei are usually stained or visible, so it is possible to deduce good markers for a Marker-Controlled Watershed (o = 2)20. These two endpoints produce a label map that is then assessed. In SS, the default endpoint is a Threshold (binary or to zero).

Do you have any questions about this protocol?

Post your question to gather feedback from the community. We will also invite the authors of this article to respond.

post Post a Question
0 Q&A