Bartosz Wieloch

Bartosz Wieloch

Auto-generated profile, based on publicly available information

Bartosz Wieloch

Poznań University of Technology, Poznań, Poland

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2014 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
TPTomasz P. Pawlak
Tomasz P. Pawlak
BWBartosz Wieloch
Bartosz Wieloch
KKKrzysztof Krawiec
Krzysztof Krawiec
In genetic programming, a search algorithm is expected to produce a program that achieves the desired final computation state (desired output). To reach that state, an executing program needs to traverse certain intermediate computation states. An evolutionary search process is expected to autonomously discover such states. This can be difficult for nontrivial tasks that require long programs to be solved. The semantic backpropagation algorithm proposed in this paper heuristically inverts the execution of evolving programs to determine the desired intermediate computation states. Two search operators, random desired operator and approximately geometric semantic crossover, use the intermediate states determined by semantic backpropagation to define subtasks of the original programming task, which are then solved using an exhaustive search. The operators outperform the standard genetic search operators and other semantic-aware operators when compared on a suite of symbolic regression and Boolean benchmarks. This result and additional analysis conducted in this paper indicate that semantic backpropagation helps evolution to identify the desired intermediate computation states and makes the search process more efficient.

23 June 2017 in Scientific Reports
Verified
Journal Article
Open access
PDF file
Karol KarnowskiKarol Karnowski
Karol Karnowski
AAAnna Ajduk
Anna Ajduk
BWBartosz Wieloch
Bartosz Wieloch
STSzymon Tamborski
Szymon Tamborski
KKKrzysztof Krawiec
Krzysztof Krawiec
MSMaciej Szkulmowski
Maciej Szkulmowski
Imaging of living cells based on traditional fluorescence and confocal laser scanning microscopy has delivered an enormous amount of information critical for understanding biological processes in single cells. However, the requirement for a high numerical aperture and fluorescent markers still limits researchers’ ability to visualize the cellular architecture without causing short- and long-term photodamage. Optical coherence microscopy (OCM) is a promising alternative that circumvents the technical limitations of fluorescence imaging techniques and provides unique access to fundamental aspects of early embryonic development, without the requirement for sample pre-processing or labeling. In the present paper, we utilized the internal motion of cytoplasm, as well as custom scanning and signal processing protocols, to effectively reduce the speckle noise typical for standard OCM and enable high-resolution intracellular time-lapse imaging. To test our imaging system we used mouse and pig oocytes and embryos and visualized them through fertilization and the first embryonic division, as well as at selected stages of oogenesis and preimplantation development. Because all morphological and morphokinetic properties recorded by OCM are believed to be biomarkers of oocyte/embryo quality, OCM may represent a new chapter in imaging-based preimplantation embryo diagnostics.

23 December 2014 in Genetic Programming and Evolvable Machines
Verified
Journal Article
Open access
PDF file
TPTomasz P. Pawlak
Tomasz P. Pawlak
BWBartosz Wieloch
Bartosz Wieloch
KKKrzysztof Krawiec
Krzysztof Krawiec
This paper provides a structured, unified, formal and empirical perspective on all geometric semantic crossover operators proposed so far, including the exact geometric crossover by Moraglio, Krawiec, and Johnson, as well as the approximately geometric operators. We start with presenting the theory of geometric semantic genetic programming, and discuss the implications of geometric operators for the structure of fitness landscape. We prove that geometric semantic crossover can by construction produce an offspring that is not worse than the fitter parent, and that under certain conditions such an offspring is guaranteed to be not worse than the worse parent. We review all geometric semantic crossover operators presented to date in the literature, and conduct a comprehensive experimental comparison using a tree-based genetic programming framework and a representative suite of nine symbolic regression and nine Boolean function synthesis tasks. We scrutinize the performance (program error and success rate), generalization, computational cost, bloat, population diversity, and the operators’ capability to generate geometric offspring. The experiment leads to several interesting conclusions, the primary one being that an operator’s capability to produce geometric offspring is positively correlated with performance. The paper is concluded by recommendations regarding the suitability of operators for the particular domains of program induction tasks.

10 July 2008 in Genetic Programming and Evolvable Machines
Verified
Journal Article
Closed access
PDF file
WJWojciech Jaśkowski
Wojciech Jaśkowski
KKKrzysztof Krawiec
Krzysztof Krawiec
BWBartosz Wieloch
Bartosz Wieloch

1 December 2008 in Evolutionary Computation
Verified
Journal Article
Closed access
WJWojciech Jaśkowski
Wojciech Jaśkowski
KKKrzysztof Krawiec
Krzysztof Krawiec
BWBartosz Wieloch
Bartosz Wieloch
We propose a multitask learning method of visual concepts within the genetic programming (GP) framework. Each GP individual is composed of several trees that process visual primitives derived from input images. Two trees solve two different visual tasks and are allowed to share knowledge with each other by commonly calling the remaining GP trees (subfunctions) included in the same individual. The performance of a particular tree is measured by its ability to reproduce the shapes contained in the training images. We apply this method to visual learning tasks of recognizing simple shapes and compare it to a reference method. The experimental verification demonstrates that such multitask learning often leads to performance improvements in one or both solved tasks, without extra computational effort.

6 July 2013
Verified
Conference Paper
Open access
PDF file
BWBartosz Wieloch
Bartosz Wieloch
KKKrzysztof Krawiec
Krzysztof Krawiec