George Tzagkarakis

Dr. George Tzagkarakis


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
14 August 2006 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
GTGeorge Tzagkarakis
George Tzagkarakis
BBB. Beferull-Lozano
B. Beferull-Lozano
PTPanagiotis Tsakalides
Panagiotis Tsakalides
This paper presents a novel rotation-invariant image retrieval scheme based on a transformation of the texture information via a steerable pyramid. First, we fit the distribution of the subband coefficients using a joint alpha-stable sub-Gaussian model to capture their non-Gaussian behavior. Then, we apply a normalization process in order to Gaussianize the coefficients. As a result, the feature extraction step consists of estimating the covariances between the normalized pyramid coefficients. The similarity between two distinct texture images is measured by minimizing a rotation-invariant version of the Kullback-Leibler Divergence between their corresponding multivariate Gaussian distributions, where the minimization is performed over a set of rotation angles

1 February 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
GTGeorge Tzagkarakis
George Tzagkarakis
JNJohn P. Nolan
John P. Nolan
PTPanagiotis Tsakalides
Panagiotis Tsakalides
Traditional compressive sensing (CS) primarily assumes light-tailed models for the underlying signal and/or noise statistics. Nevertheless, this assumption is not met in the case of highly impulsive environments, where non-Gaussian infinite-variance processes arise for the signal and/or noise components. This drives the traditional sparse reconstruction methods to failure, since they are incapable of suppressing the effects of heavy-tailed sampling noise. The family of symmetric alpha-stable (SaS) distributions, as a powerful tool for modeling heavy-tailed behaviors, is adopted in this paper to design a robust algorithm for sparse signal reconstruction from linear random measurements corrupted by infinite-variance additive noise. Specifically, a novel greedy reconstruction method is developed, which achieves increased robustness to impulsive sampling noise by solving a minimum dispersion (MD) optimization problem based on fractional lower-order moments. The MD criterion emerges naturally in the case of additive sampling noise modeled by SaS distributions, as an effective measure of the spread of reconstruction errors around zero, due to the lack of second-order moments. The experimental evaluation demonstrates the improved reconstruction performance of the proposed algorithm when compared against state-of-the-art CS techniques for a broad range of impulsive environments.

10 June 2008 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
GTGeorge Tzagkarakis
George Tzagkarakis
BBBaltasar Beferull-Lozano
Baltasar Beferull-Lozano
PTPanagiotis Tsakalides
Panagiotis Tsakalides
This paper addresses the construction of a novel efficient rotation-invariant texture retrieval method that is based on the alignment in angle of signatures obtained via a steerable sub-Gaussian model. In our proposed scheme, we first construct a steerable multivariate sub-Gaussian model, where the fractional lower-order moments of a given image are associated with those of its rotated versions. The feature extraction step consists of estimating the so-called covariations between the orientation subbands of the corresponding steerable pyramid at the same or at adjacent decomposition levels and building an appropriate signature that can be rotated directly without the need of rotating the image and recalculating the signature. The similarity measurement between two images is performed using a matrix-based norm that includes a signature alignment in angle between the images being compared, achieving in this way the desired rotation-invariance property. Our experimental results show how this retrieval scheme achieves a lower average retrieval error, as compared to previously proposed methods having a similar computational complexity, while at the same time being competitive with the best currently known state-of-the-art retrieval system. In conclusion, our retrieval method provides the best compromise between complexity and average retrieval performance.

8 June 2023 in Neural Computing and Applications
Verified
Journal Article
Open access
PDF file
MSMostafa Shabani
Mostafa Shabani
MMMartin Magris
Martin Magris
GTGeorge Tzagkarakis
George Tzagkarakis
JKJuho Kanniainen
Juho Kanniainen
AIAlexandros Iosifidis
Alexandros Iosifidis
Cross-correlation analysis is a powerful tool for understanding the mutual dynamics of time series. This study introduces a new method for predicting the future state of synchronization of the dynamics of two financial time series. To this end, we use the cross recurrence plot analysis as a nonlinear method for quantifying the multidimensional coupling in the time domain of two time series and for determining their state of synchronization. We adopt a deep learning framework for methodologically addressing the prediction of the synchronization state based on features extracted from dynamically sub-sampled cross recurrence plots. We provide extensive experiments on several stocks, major constituents of the S &P100 index, to empirically validate our approach. We find that the task of predicting the state of synchronization of two time series is in general rather difficult, but for certain pairs of stocks attainable with very satisfactory performance (84% F1-score, on average).

10 June 2020 in Sensors
Verified
Journal Article
Open access
PDF file
GTGeorge Tzagkarakis
George Tzagkarakis
PCPavlos Charalampidis
Pavlos Charalampidis
SRStylianos Roumpakis
Stylianos Roumpakis
AMAntonis Makrogiannakis
Antonis Makrogiannakis
PTPanagiotis Tsakalides
Panagiotis Tsakalides
Monitoring contemporary water distribution networks (WDN) relies increasingly on smart metering technologies and wireless sensor network infrastructures. Smart meters and sensor nodes are deployed to capture and transfer information from the WDN to a control center for further analysis. Due to difficulties in accessing the water assets, many water utility companies employ battery-powered nodes, which restricts the use of high sampling rates, thus limiting the knowledge we can extract from the recorder data. To mitigate this issue, compressive sensing (CS) has been introduced as a powerful framework for reducing dramatically the required bandwidth and storage resources, without diminishing the meaningful information content. Despite its well-established and mathematically rigorous foundations, most of the focus is given on the algorithmic perspective, while the real benefits of CS in practical scenarios are still underexplored. To address this problem, this work investigates the advantages of a CS-based implementation on real sensing devices utilized in smart water networks, in terms of execution speedup and reduced ener experimental evaluation revealed that a CS-based scheme can reduce compression execution times around 50 % , while achieving significant energy savings compared to lossless compression, by selecting a high compression ratio, without compromising reconstruction fidelity. Most importantly, the above significant savings are achieved by simultaneously enabling a weak encryption of the recorded data without the need for additional encryption hardware or software components.

1 May 2021 in Signal Processing
Verified
Journal Article
Closed access
GTGeorge Tzagkarakis
George Tzagkarakis
JNJohn P. Nolan
John P. Nolan
PTPanagiotis Tsakalides
Panagiotis Tsakalides