George Economou

Dr. George Economou

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 December 2015 in Pattern Recognition Letters
Verified
Journal Article
Closed access
DKDimitris Kastaniotis
Dimitris Kastaniotis
ITIlias Theodorakopoulos
Ilias Theodorakopoulos
CTChristos Theoharatos
Christos Theoharatos
GEGeorge Economou
George Economou
SFSpiros Fotopoulos
Spiros Fotopoulos

6 February 2019 in IEEE Transactions on Biometrics, Behavior, and Identity Science
Verified
Journal Article
Closed access
Elias ZoisElias Zois
Elias Zois
DTDimitrios Tsourounis
Dimitrios Tsourounis
ITIlias Theodorakopoulos
Ilias Theodorakopoulos
AKAnastasios L. Kesidis
Anastasios L. Kesidis
GEGeorge Economou
George Economou

13 July 2022 in Sensors
Verified
Journal Article
Open access
PDF file
SKSofoklis Katakis
Sofoklis Katakis
NBNikolaos Barotsis
Nikolaos Barotsis
AKAlexandros Kakotaritis
Alexandros Kakotaritis
GEGeorge Economou
George Economou
EPElias C. Panagiotopoulos
Elias C. Panagiotopoulos
GPGeorge Panayiotakis
George Panayiotakis
Automatically delineating the deep and superficial aponeurosis of the skeletal muscles from ultrasound images is important in many aspects of the clinical routine. In particular, finding muscle parameters, such as thickness, fascicle length or pennation angle, is a time-consuming clinical task requiring both human labour and specialised knowledge. In this study, a multi-step solution for automating these tasks is presented. A process to effortlessly extract the aponeurosis for automatically measuring the muscle thickness has been introduced as a first step. This process consists mainly of three parts. In the first part, the Attention UNet has been incorporated to automatically delineate the boundaries of the studied muscles. Afterwards, a specialised post-processing algorithm was utilised to improve (and correct) the segmentation results. Lastly, the calculation of the muscle thickness was performed. The proposed method has achieved similar to a human-level performance. In particular, the overall discrepancy between the automatic and the manual muscle thickness measurements was equal to 0.4 mm, a significant result that demonstrates the feasibility of automating this task. In the second step of the proposed methodology, the fascicle’s length and pennation angle are extracted through an unsupervised pipeline. Initially, filtering is applied to the ultrasound images to further distinguish the tissues from the other muscle structures. Later, the well-known K-Means algorithm is used to isolate them successfully. As the last step, the dominant angle of the segmented muscle tissues is reported and compared with manual measurements. The proposed pipeline is showing very promising results in the evaluated dataset. Specifically, in the calculation of the pennation angle, the overall discrepancy between the automatic and the manual measurements was less than 2.22° (degrees), once more comparable with the human-level performance. Finally, regarding the fascicle length measurements, the results were divided based on the muscle properties. In the muscles where a large portion (or all) of the fascicles are located between the upper and lower aponeuroses, the proposed pipeline exhibits superb performance; otherwise, overall accuracy deteriorates due to errors caused by the trigonometric approximations needed for the length calculation.

1 April 2005 in Pattern Recognition
Verified
Journal Article
Closed access
CTCh. Theoharatos
Ch. Theoharatos
GEGeorge Economou
George Economou
SFS. Fotopoulos
S. Fotopoulos

23 May 2023 in BioMedInformatics
Verified
Journal Article
Open access
PDF file
SKSofoklis Katakis
Sofoklis Katakis
NBNikolaos Barotsis
Nikolaos Barotsis
AKAlexandros Kakotaritis
Alexandros Kakotaritis
PTPanagiotis Tsiganos
Panagiotis Tsiganos
GEGeorge Economou
George Economou
GPGeorge Panayiotakis
George Panayiotakis
The recent advances in deep learning have revolutionised computer-aided diagnosis in medical imaging. However, deep learning approaches to unveil their full potential require significant amounts of data, which can be a challenging task in some scientific fields, such as musculoskeletal ultrasound imaging, in which data privacy and security reasons can lead to important limitations in the acquisition and the distribution process of patients’ data. For this reason, different generative methods have been introduced to significantly reduce the required amount of real data by generating synthetic images, almost indistinguishable from the real ones. In this study, the power of the diffusion models is incorporated for the generation of realistic data from a small set of musculoskeletal ultrasound images in four different muscles. Afterwards, the similarity of the generated and real images is assessed with different types of qualitative and quantitative metrics that correspond well with human judgement. In particular, the histograms of pixel intensities of the two sets of images have demonstrated that the two distributions are statistically similar. Additionally, the well-established LPIPS, SSIM, FID, and PSNR metrics have been used to quantify the similarity of these sets of images. The two sets of images have achieved extremely high similarity scores in all these metrics. Subsequently, high-level features are extracted from the two types of images and visualized in a two-dimensional space for inspection of their structure and to identify patterns. From this representation, the two sets of images are hard to distinguish. Finally, we perform a series of experiments to assess the impact of the generated data for training a highly efficient Attention-UNet for the important clinical application of muscle thickness measurement. Our results depict that the synthetic data play a significant role in the model’s final performance and can lead to the improvement of the deep learning systems in musculoskeletal ultrasound.

1 June 2020
Verified
Conference Paper
Closed access
Elias ZoisElias Zois
Elias Zois
EZEvangelos Zervas
Evangelos Zervas
DTDimitrios Tsourounis
Dimitrios Tsourounis
GEGeorge Economou
George Economou
In spite of the overwhelming high-tech marvels and applications that rule our digital lives, the use of the handwritten signature is still recognized worldwide in government, personal and legal entities to be the most important behavioral biometric trait. A number of notable research approaches provide advanced results up to a certain point which allow us to assert with confidence that the performance attained by signature verification (SV) systems is comparable to those provided by any other biometric modality. Up to now, the mainstream trend for offline SV is shared between standard -or handcrafted- feature extraction methods and popular machine learning techniques, with typical examples ranging from sparse representation to Deep Learning. Recent progress in graph mining algorithms provide us with the prospect to re-evaluate the opportunity of utilizing graph representations by exploring corresponding graph features for offline SV. In this paper, inspired by the recent use of image visibility graphs for mapping images into networks, we introduce for the first time in offline SV literature their use as a parameter free, agnostic representation for exploring global as well as local information. Global properties of the sparsely located content of the shape of the signature image are encoded with topological information of the whole graph. In addition, local pixel patches are encoded by sequential visibility motifs-subgraphs of size four, to a low six dimensional motif profile vector. A number of pooling functions operate on the motif codes in a spatial pyramid context in order to create the final feature vector. The effectiveness of the proposed method is evaluated with the use of two popular datasets. The local visibility graph features are considered to be highly informative for SV; this is sustained by the corresponding results which are at least comparable with other classic state-of-the-art approaches.