Caterina Graziani

Dr. Caterina Graziani

University of Siena
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
25 December 2021 in Electronics
Verified
Journal Article
Open access
PDF file
PAPaolo Andreini
Paolo Andreini
GCGiorgio Ciano
Giorgio Ciano
SBSimone Bonechi
Simone Bonechi
Caterina GrazianiCaterina Graziani
Caterina Graziani
Veronica LachiVeronica Lachi
Veronica Lachi
MBMonica Bianchini
Monica Bianchini
In this paper, we use Generative Adversarial Networks (GANs) to synthesize high-quality retinal images along with the corresponding semantic label-maps, instead of real images during training of a segmentation network. Different from other previous proposals, we employ a two-step approach: first, a progressively growing GAN is trained to generate the semantic label-maps, which describes the blood vessel structure (i.e., the vasculature); second, an image-to-image translation approach is used to obtain realistic retinal images from the generated vasculature. The adoption of a two-stage process simplifies the generation task, so that the network training requires fewer images with consequent lower memory usage. Moreover, learning is effective, and with only a handful of training samples, our approach generates realistic high-resolution images, which can be successfully used to enlarge small available datasets. Comparable results were obtained by employing only synthetic images in place of real data during training. The practical viability of the proposed approach was demonstrated on two well-established benchmark sets for retinal vessel segmentation—both containing a very small number of training samples—obtaining better performance with respect to state-of-the-art techniques.

28 February 2024 in Neural Networks
Verified
Journal Article
Open access
SBSilvia Beddar-Wiesing
Silvia Beddar-Wiesing
GDGiuseppe Alessio D’iNverno
Giuseppe Alessio D’iNverno
Caterina GrazianiCaterina Graziani
Caterina Graziani
Veronica LachiVeronica Lachi
Veronica Lachi
AMAlice Moallemy-Oureh
Alice Moallemy-Oureh
JTJosephine Maria Thomas
Josephine Maria Thomas
Graph Neural Networks (GNNs) are a large class of relational models for graph processing. Recent theoretical studies on the expressive power of GNNs have focused on two issues. On the one hand, it has been proven that GNNs are as powerful as the Weisfeiler-Lehman test (1-WL) in their ability to distinguish graphs. Moreover, it has been shown that the equivalence enforced by 1-WL equals unfolding equivalence. On the other hand, GNNs turned out to be universal approximators on graphs modulo the constraints enforced by 1-WL/unfolding equivalence. However, these results only apply to Static Attributed Undirected Homogeneous Graphs (SAUHG) with node attributes. In contrast, real-life applications often involve a much larger variety of graph types. In this paper, we conduct a theoretical analysis of the expressive power of GNNs for two other graph domains that are particularly interesting in practical applications, namely dynamic graphs and SAUGHs with edge attributes. Dynamic graphs are widely used in modern applications; hence, the study of the expressive capability of GNNs in this domain is essential for practical reasons and, in addition, it requires a new analyzing approach due to the difference in the architecture of dynamic GNNs compared to static ones. On the other hand, the examination of SAUHGs is of particular relevance since they act as a standard form for all graph types: it has been shown that all graph types can be transformed without loss of information to SAUHGs with both attributes on nodes and edges. This paper considers generic GNN models and appropriate 1-WL tests for those domains. Then, the known results on the expressive power of GNNs are extended to the mentioned domains: it is proven that GNNs have the same capability as the 1-WL test, the 1-WL equivalence equals unfolding equivalence and that GNNs are universal approximators modulo 1-WL/unfolding equivalence. Moreover, the proof of the approximation capability is mostly constructive and allows us to deduce hints on the architecture of GNNs that can achieve the desired approximation.

8 December 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Niccolò PancinoNiccolò Pancino
Niccolò Pancino
Caterina GrazianiCaterina Graziani
Caterina Graziani
Veronica LachiVeronica Lachi
Veronica Lachi
Maria Lucia SampoliMaria Lucia Sampoli
Maria Lucia Sampoli
EȘEmanuel Ștefănescu
Emanuel Ștefănescu
GDGiovanna Maria Dimitri
Giovanna Maria Dimitri
Eye-tracking can offer a novel clinical practice and a non-invasive tool to detect neuropathological syndromes. In this paper, we show some analysis on data obtained from the visual sequential search test. Indeed, such a test can be used to evaluate the capacity of looking at objects in a specific order, and its successful execution requires the optimization of the perceptual resources of foveal and extrafoveal vision. The main objective of this work is to detect if some patterns can be found within the data, to discern among people with chronic pain, extrapyramidal patients and healthy controls. We employed statistical tests to evaluate differences among groups, considering three novel indicators: blinking rate, average blinking duration and maximum pupil size variation. Additionally, to divide the three patient groups based on scan-path images—which appear very noisy and all similar to each other—we applied deep learning techniques to embed them into a larger transformed space. We then applied a clustering approach to correctly detect and classify the three cohorts. Preliminary experiments show promising results.

4 August 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
GGGiorgia Giacomini
Giorgia Giacomini
Caterina GrazianiCaterina Graziani
Caterina Graziani
Veronica LachiVeronica Lachi
Veronica Lachi
PBPietro Bongini
Pietro Bongini
Niccolò PancinoNiccolò Pancino
Niccolò Pancino
PAPaolo Andreini
Paolo Andreini
In recent years, the Ribosome profiling technique (Ribo–seq) has emerged as a powerful method for globally monitoring the translation process in vivo at single nucleotide resolution. Based on deep sequencing of mRNA fragments, Ribo–seq allows to obtain profiles that reflect the time spent by ribosomes in translating each part of an open reading frame. Unfortunately, the profiles produced by this method can vary significantly in different experimental setups, being characterized by a poor reproducibility. To address this problem, we have employed a statistical method for the identification of highly reproducible Ribo–seq profiles, which was tested on a set of E. coli genes. State-of-the-art artificial neural network models have been used to validate the quality of the produced sequences. Moreover, new insights into the dynamics of ribosome translation have been provided through a statistical analysis on the obtained sequences.

27 September 2022
Verified
Book Chapter
Closed access
PDF file
PAPaolo Andreini
Paolo Andreini
SBSimone Bonechi
Simone Bonechi
GCGiorgio Ciano
Giorgio Ciano
Caterina GrazianiCaterina Graziani
Caterina Graziani
Veronica LachiVeronica Lachi
Veronica Lachi
FSFranco Scarselli
Franco Scarselli

25 September 2026 in Journal of Logical and Algebraic Methods in Programming
Verified
Journal Article
Open access
ABAsma Bendjeddou
Asma Bendjeddou
LBLinda Brodo
Linda Brodo
MFMoreno Falaschi
Moreno Falaschi
Caterina GrazianiCaterina Graziani
Caterina Graziani