Ioannis Psarros

Ioannis Psarros

Auto-generated profile, based on publicly available information

Ioannis Psarros

Hausdorff Center for Mathematics University of Bonn Germany

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
22 February 2023 in IEEE Journal of Photovoltaics
Verified
Journal Article
Closed access
AKAlexandros Kalimeris
Alexandros Kalimeris
IPIoannis Psarros
Ioannis Psarros
Giorgos GiannopoulosGiorgos Giannopoulos
Giorgos Giannopoulos
MTManolis Terrovitis
Manolis Terrovitis
GPGeorge Papastefanatos
George Papastefanatos
GKGregory Kotsis
Gregory Kotsis
Soiling is the accumulation of dirt in solar panels that leads to a decreasing trend in solar energy yield and may be the cause of vast revenue losses. The effect of soiling can be reduced by washing the panels, which is, however, a procedure of non-negligible cost. Moreover, soiling monitoring systems are often unreliable or very costly. We study the problem of estimating the soiling ratio in photovoltaic (PV) modules, i.e., the ratio of the real power output to the power output that would be produced if solar panels were clean. A key advantage of our algorithms is that they estimate soiling, without needing to train on labeled data, i.e., periods of explicitly monitoring the soiling in each park, and without relying on generic analytical formulas that do not take into account the peculiarities of each installation. We consider as input a time series comprising a minimum set of measurements that are available to most PV park operators. Our experimental evaluation shows that we significantly outperform current state-of-the-art methods for estimating soiling ratio.

31 July 2021
Verified
Book Chapter
Closed access
PDF file
ADAnne Driemel
Anne Driemel
IPIoannis Psarros
Ioannis Psarros

9 August 2021 in Discrete & Computational Geometry
Verified
Journal Article
Open access
PDF file
ADAnne Driemel
Anne Driemel
ANAndré Nusser
André Nusser
JPJeff M. Phillips
Jeff M. Phillips
IPIoannis Psarros
Ioannis Psarros
The Vapnik–Chervonenkis dimension provides a notion of complexity for systems of sets. If the VC dimension is small, then knowing this can drastically simplify fundamental computational tasks such as classification, range counting, and density estimation through the use of sampling bounds. We analyze set systems where the ground set X is a set of polygonal curves in $$\mathbb {R}^d$$ R d and the sets $$\mathcal {R}$$ R are metric balls defined by curve similarity metrics, such as the Fréchet distance and the Hausdorff distance, as well as their discrete counterparts. We derive upper and lower bounds on the VC dimension that imply useful sampling bounds in the setting that the number of curves is large, but the complexity of the individual curves is small. Our upper and lower bounds are either near-quadratic or near-linear in the complexity of the curves that define the ranges and they are logarithmic in the complexity of the curves that define the ground set.

21 October 2022
Verified
Book Chapter
Closed access
PDF file
MBMaike Buchin
Maike Buchin
ADAnne Driemel
Anne Driemel
KGKoen van Greevenbroek
Koen van Greevenbroek
IPIoannis Psarros
Ioannis Psarros
DRDennis Rohde
Dennis Rohde

15 November 2019 in arXiv
Verified
Preprint
Open access
PDF file
ADAnne Driemel
Anne Driemel
ANAndré Nusser
André Nusser
JPJeff M. Phillips
Jeff M. Phillips
IPIoannis Psarros
Ioannis Psarros
The Vapnik-Chervonenkis dimension provides a notion of complexity for systems of sets. If the VC dimension is small, then knowing this can drastically simplify fundamental computational tasks such as classification, range counting, and density estimation through the use of sampling bounds. We analyze set systems where the ground set $X$ is a set of polygonal curves in $\mathbb{R}^d$ and the sets $\mathcal{R}$ are metric balls defined by curve similarity metrics, such as the Fr\'echet distance and the Hausdorff distance, as well as their discrete counterparts. We derive upper and lower bounds on the VC dimension that imply useful sampling bounds in the setting that the number of curves is large, but the complexity of the individual curves is small. Our upper bounds are either near-quadratic or near-linear in the complexity of the curves that define the ranges and they are logarithmic in the complexity of the curves that define the ground set.

10 June 2019 in HAL
Verified
Preprint
Open access
PDF file
IPIoannis Psarros
Ioannis Psarros
With the increase of availability of complex datasets, there is a need for algorithmic solutions which scale well as the complexity of the data increases. We focus on proximity problems for high-dimensional vectors and polygonal curves and we present new solutions for the problem of computing approximate nearest neighbors. In Euclidean spaces, we propose and analyse random projections to a very low dimension, aiming for a high-dimensional solution which is also space efficient. For polygonal curves, we design a data structure with arbitrarily small approximation error. In addition, we present a new solution for computing good representatives, when the dataset consists of high-dimensional vectors. Finally, we study range spaces defined by metrics for polygonal curves and we present new bounds on their VC dimension.