Krzysztof Krawiec

Krzysztof Krawiec

Auto-generated profile, based on publicly available information

Krzysztof Krawiec

Poznan University of Technology

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

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

Representative Publications

View All Publications
24 March 2016 in IEEE Transactions on Medical Imaging
Verified
Journal Article
Closed access
PLPawel Liskowski
Pawel Liskowski
KKKrzysztof Krawiec
Krzysztof Krawiec
The condition of the vascular network of human eye is an important diagnostic factor in ophthalmology. Its segmentation in fundus imaging is a nontrivial task due to variable size of vessels, relatively low contrast, and potential presence of pathologies like microaneurysms and hemorrhages. Many algorithms, both unsupervised and supervised, have been proposed for this purpose in the past. We propose a supervised segmentation technique that uses a deep neural network trained on a large (up to 400 \thinspace000) sample of examples preprocessed with global contrast normalization, zero-phase whitening, and augmented using geometric transformations and gamma corrections. Several variants of the method are considered, including structured prediction, where a network classifies multiple pixels simultaneously. When applied to standard benchmarks of fundus imaging, the DRIVE, STARE, and CHASE databases, the networks significantly outperform the previous algorithms on the area under ROC curve measure (up to > 0.99) and accuracy of classification (up to > 0.97). The method is also resistant to the phenomenon of central vessel reflex, sensitive in detection of fine vessels ( sensitivity > 0.87), and fares well on pathological cases.

7 July 2012
Verified
Conference Paper
Open access
PDF file
JMJames McDermott
James McDermott
DWDavid R. White
David R. White
SLSean Luke
Sean Luke
Luca ManzoniLuca Manzoni
Luca Manzoni
Mauro CastelliMauro Castelli
Mauro Castelli
UOUna-May O'REilly
Una-May O'REilly

1 May 1995 in Computational Intelligence
Verified
Journal Article
Closed access
PDF file
JJJacek Jelonek
Jacek Jelonek
KKKrzysztof Krawiec
Krzysztof Krawiec
RSRoman Slowiński
Roman Slowiński

12 July 2014
Verified
Conference Paper
Open access
IAIgnacio Arnaldo
Ignacio Arnaldo
KKKrzysztof Krawiec
Krzysztof Krawiec
UOUna-May O'Reilly
Una-May O'Reilly
We propose a new means of executing a genetic program which improves its output quality. Our approach, called Multiple Regression Genetic Programming (MRGP) decouples and linearly combines a program's subexpressions via multiple regression on the target variable. The regression yields an alternate output: the prediction of the resulting multiple regression model. It is this output, over many fitness cases, that we assess for fitness, rather than the program's execution output. MRGP can be used to improve the fitness of a final evolved solution. On our experimental suite, MRGP consistently generated solutions fitter than the result of competent GP or multiple regression. When integrated into GP, inline MRGP, on the basis of equivalent computational budget, outperforms competent GP while also besting post-run MRGP. Thus MRGP's output method is shown to be superior to the output of program execution and it represents a practical, cost neutral, improvement to GP.

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.

16 May 2005 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Verified
Journal Article
Closed access
KKK. Krawiec
K. Krawiec
BBBir Bhanu
Bir Bhanu
In this paper, a novel genetically inspired visual learning method is proposed. Given the training raster images, this general approach induces a sophisticated feature-based recognition system. It employs the paradigm of cooperative coevolution to handle the computational difficulty of this task. To represent the feature extraction agents, the linear genetic programming is used. The paper describes the learning algorithm and provides a firm rationale for its design. Different architectures of recognition systems are considered that employ the proposed feature synthesis method. An extensive experimental evaluation on the demanding real-world task of object recognition in synthetic aperture radar (SAR) imagery shows the ability of the proposed approach to attain high recognition performance in different operating conditions.