2,157 research outputs found
Combining Fine- and Coarse-Grained Classifiers for Diabetic Retinopathy Detection
Visual artefacts of early diabetic retinopathy in retinal fundus images are
usually small in size, inconspicuous, and scattered all over retina. Detecting
diabetic retinopathy requires physicians to look at the whole image and fixate
on some specific regions to locate potential biomarkers of the disease.
Therefore, getting inspiration from ophthalmologist, we propose to combine
coarse-grained classifiers that detect discriminating features from the whole
images, with a recent breed of fine-grained classifiers that discover and pay
particular attention to pathologically significant regions. To evaluate the
performance of this proposed ensemble, we used publicly available EyePACS and
Messidor datasets. Extensive experimentation for binary, ternary and quaternary
classification shows that this ensemble largely outperforms individual image
classifiers as well as most of the published works in most training setups for
diabetic retinopathy detection. Furthermore, the performance of fine-grained
classifiers is found notably superior than coarse-grained image classifiers
encouraging the development of task-oriented fine-grained classifiers modelled
after specialist ophthalmologists.Comment: Pages 12, Figures
On the design of an ECOC-compliant genetic algorithm
Genetic Algorithms (GA) have been previously applied to Error-Correcting Output Codes (ECOC) in state-of-the-art works in order to find a suitable coding matrix. Nevertheless, none of the presented techniques directly take into account the properties of the ECOC matrix. As a result the considered search space is unnecessarily large. In this paper, a novel Genetic strategy to optimize the ECOC coding step is presented. This novel strategy redefines the usual crossover and mutation operators in order to take into account the theoretical properties of the ECOC framework. Thus, it reduces the search space and lets the algorithm to converge faster. In addition, a novel operator that is able to enlarge the code in a smart way is introduced. The novel methodology is tested on several UCI datasets and four challenging computer vision problems. Furthermore, the analysis of the results done in terms of performance, code length and number of Support Vectors shows that the optimization process is able to find very efficient codes, in terms of the trade-off between classification performance and the number of classifiers. Finally, classification performance per dichotomizer results shows that the novel proposal is able to obtain similar or even better results while defining a more compact number of dichotomies and SVs compared to state-of-the-art approaches
Sub-Classifier Construction for Error Correcting Output Code Using Minimum Weight Perfect Matching
Multi-class classification is mandatory for real world problems and one of
promising techniques for multi-class classification is Error Correcting Output
Code. We propose a method for constructing the Error Correcting Output Code to
obtain the suitable combination of positive and negative classes encoded to
represent binary classifiers. The minimum weight perfect matching algorithm is
applied to find the optimal pairs of subset of classes by using the
generalization performance as a weighting criterion. Based on our method, each
subset of classes with positive and negative labels is appropriately combined
for learning the binary classifiers. Experimental results show that our
technique gives significantly higher performance compared to traditional
methods including the dense random code and the sparse random code both in
terms of accuracy and classification times. Moreover, our method requires
significantly smaller number of binary classifiers while maintaining accuracy
compared to the One-Versus-One.Comment: 7 pages, 3 figure
- …