Efstathios Branikas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Efstathios Branikas has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Evangelia I. Zacharaki
Department of Computer Engineering and Informatics, University of Patras, Greece
1 shared publication - Graeme West
University of Strathclyde
1 shared publication - Paul Murray
University of Strathclyde
1 shared publication - Thomas Papastergiou
Laboratoire d’informatique de Paris Nord, Laboratoire d'Informatique de Paris Nord, CNRS UMR 7030, Université Sorbonne Paris Nord, Villetaneuse, France
1 shared publication Vasileios Megalooikonomou
University of Patras,MDAKM Lab,Achaia,Greece
1 shared publication
Latest Publications
- Open Access
- 3 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 22051-22059
A Novel Data Augmentation Method for Improved Visual Crack Detection Using Generative Adversarial Networks
Condition monitoring and inspection are core activities for assessing and evaluating the health of critical infrastructure spanning from road networks to nuclear power stations. Defect detection on visual inspections of such assets is a field that enjoys increasing attention. However, data-based models are prone to a lack of available data depicting cracks of various modalities and present a great data imbalance. This paper introduces a novel data augmentation technique by deploying the CycleGan Generative Adversarial Network (GAN). The proposed model is deployed between different image datasets depicting cracks, with a nuclear application as the main industrial example. The aim of this network is to improve the segmentation accuracy on these datasets using deep convolutional neural networks. The proposed GAN generates realistic images that are challenging to segment and under-represented in the original datasets. Different deep networks are trained with the augmented datasets while introducing no labelling overhead. A comparison is drawn between the performance of the different neural networks on the original data and their augmented counterparts. Extensive experiments suggest that the proposed augmentation method results in superior crack detection in challenging cases across all datasets. This is reflected by the respective increase in the quantitative evaluation metrics.
- 3 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 22051-22059
Open AccessA Novel Data Augmentation Method for Improved Visual Crack Detection Using Generative Adversarial Networks
Condition monitoring and inspection are core activities for assessing and evaluating the health of critical infrastructure spanning from road networks to nuclear power stations. Defect detection on visual inspections of such assets is a field that enjoys increasing attention. However, data-based models are prone to a lack of available data depicting cracks of various modalities and present a great data imbalance. This paper introduces a novel data augmentation technique by deploying the CycleGan Generative Adversarial Network (GAN). The proposed model is deployed between different image datasets depicting cracks, with a nuclear application as the main industrial example. The aim of this network is to improve the segmentation accuracy on these datasets using deep convolutional neural networks. The proposed GAN generates realistic images that are challenging to segment and under-represented in the original datasets. Different deep networks are trained with the augmented datasets while introducing no labelling overhead. A comparison is drawn between the performance of the different neural networks on the original data and their augmented counterparts. Extensive experiments suggest that the proposed augmentation method results in superior crack detection in challenging cases across all datasets. This is reflected by the respective increase in the quantitative evaluation metrics.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Instance Selection Techniques for Multiple Instance Classification
As the amount of data increases, fully supervised learning methods relying on dense annotations often become impractical, and are substituted by weakly supervised methods, that exploit data with a variable content in respect to size and semantics. In such schemes the volume of irrelevant information might be critically high impacting negatively the modeling performance and increasing considerably the memory and computational cost. Data reduction or selection are necessary to mitigate these effects. In this paper we propose and compare three different instance selection techniques for the Multiple Instance Learning (MIL) paradigm. The techniques are assessed for the problem of image classification using features from standard benchmark MIL datasets, as well as recently proposed features based on tensor decomposition. As implementation paradigm we exploit the widely accepted JC2MIL algorithm that performs joint clustering and classification. Two of the proposed instance selection techniques are based on Shannon entropy in image and feature space respectively, while one technique is based on a clustering evaluation metric, the silhouette score, that is introduced internally in the iterative joint clustering and classification algorithm. The enrichment of the MIL framework with the instance selection step showed to outperform the original algorithm providing state-of-the-art results in the vast majority of the performed experiments.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Instance Selection Techniques for Multiple Instance Classification
As the amount of data increases, fully supervised learning methods relying on dense annotations often become impractical, and are substituted by weakly supervised methods, that exploit data with a variable content in respect to size and semantics. In such schemes the volume of irrelevant information might be critically high impacting negatively the modeling performance and increasing considerably the memory and computational cost. Data reduction or selection are necessary to mitigate these effects. In this paper we propose and compare three different instance selection techniques for the Multiple Instance Learning (MIL) paradigm. The techniques are assessed for the problem of image classification using features from standard benchmark MIL datasets, as well as recently proposed features based on tensor decomposition. As implementation paradigm we exploit the widely accepted JC2MIL algorithm that performs joint clustering and classification. Two of the proposed instance selection techniques are based on Shannon entropy in image and feature space respectively, while one technique is based on a clustering evaluation metric, the silhouette score, that is introduced internally in the iterative joint clustering and classification algorithm. The enrichment of the MIL framework with the instance selection step showed to outperform the original algorithm providing state-of-the-art results in the vast majority of the performed experiments.