Sara Brunetti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sara Brunetti has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Péter Balázs
Department of Image Processing and Computer Graphics, University of Szeged, Árpád tér 2., H-6720 Szeged, Hungary
4 shared publications - Walter Quattrociocchi
Sapienza University of Rome
3 shared publications - Alain Daurat
LSIIT UMR 7005 CNRS, Pöle API, Université Louis Pasteur (Strasbourg 1)
2 shared publications - Andrea Frosini
Dipartimento di Scienze Matematiche ed Informatiche “Roberto Magari” Università degli Studi di Siena Via del Capitano 15, 53100, Siena, Italy
2 shared publications - Carla Peri
Università Cattolica S. C
2 shared publications - Christophe Picouleau
Conservatoire National des Arts et Métiers, CEDRIC Laboratory Paris France
2 shared publications
Latest Publications
- 1 April 2026
- Published by Springer Nature
- p. 200-213
Rotational and Rotation-Free Multidirectional Q-Concavity Shape Descriptors
- 1 April 2026
- Published by Springer Nature
- p. 200-213
Rotational and Rotation-Free Multidirectional Q-Concavity Shape Descriptors
- Open Access
- 27 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (13) , 2114
A Comparative Study of Descriptors for Quadrant-Convexity
Many different descriptors have been proposed to measure the convexity of digital shapes. Most of these are based on the definition of continuous convexity and exhibit both advantages and drawbacks when applied in the digital domain. In contrast, within the field of Discrete Tomography, a special type of convexity—called Quadrant-convexity—has been introduced. This form of convexity naturally arises from the pixel-based representation of digital shapes and demonstrates favorable properties for reconstruction from projections. In this paper, we present an overview of using Quadrant-convexity as the basis for designing shape descriptors. We explore two different approaches: the first is based on the geometric features of Quadrant-convex objects, while the second relies on the identification of Quadrant-concave pixels. For both approaches, we conduct extensive experiments to evaluate the strengths and limitations of the proposed descriptors. In particular, we show that all our descriptors achieve an average accuracy of approximately to on noisy retina images for a binary classification task. Furthermore, in a multiclass classification setting using a dataset of desmids, all our descriptors outperform traditional low-level shape descriptors, achieving an accuracy of 76.74%.- 27 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (13) , 2114
Open AccessA Comparative Study of Descriptors for Quadrant-Convexity
Many different descriptors have been proposed to measure the convexity of digital shapes. Most of these are based on the definition of continuous convexity and exhibit both advantages and drawbacks when applied in the digital domain. In contrast, within the field of Discrete Tomography, a special type of convexity—called Quadrant-convexity—has been introduced. This form of convexity naturally arises from the pixel-based representation of digital shapes and demonstrates favorable properties for reconstruction from projections. In this paper, we present an overview of using Quadrant-convexity as the basis for designing shape descriptors. We explore two different approaches: the first is based on the geometric features of Quadrant-convex objects, while the second relies on the identification of Quadrant-concave pixels. For both approaches, we conduct extensive experiments to evaluate the strengths and limitations of the proposed descriptors. In particular, we show that all our descriptors achieve an average accuracy of approximately to on noisy retina images for a binary classification task. Furthermore, in a multiclass classification setting using a dataset of desmids, all our descriptors outperform traditional low-level shape descriptors, achieving an accuracy of 76.74%. - Open Access
- 24 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 19 (2) , 1-19
Post-hoc Evaluation of Nodes Influence in Information Cascades: The Case of Coordinated Accounts
In the last few years, social media has gained an unprecedented amount of attention, playing a pivotal role in shaping the contemporary landscape of communication and connection. However, Coordinated inauthentic Behaviour (CIB), defined as orchestrated efforts by entities to deceive or mislead users about their identity and intentions, has emerged as a tactic to exploit the online discourse. In this study, we quantify the efficacy of CIB tactics by defining a general framework for evaluating the influence of a subset of nodes in a directed tree. We design two algorithms that provide optimal and greedy post-hoc placement strategies that lead to maximising the configuration influence. We then consider cascades from information spreading on X (formerly known as Twitter) to compare the observed behaviour with our algorithms. The results show that, according to our model, coordinated accounts are quite inefficient in terms of their network influence, thus suggesting that they may play a less pivotal role than expected. Moreover, the causes of these poor results may be found in two separate aspects: a bad placement strategy and a scarcity of resources.
- 24 May 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
- Vol. 19 (2) , 1-19
Open AccessPost-hoc Evaluation of Nodes Influence in Information Cascades: The Case of Coordinated Accounts
In the last few years, social media has gained an unprecedented amount of attention, playing a pivotal role in shaping the contemporary landscape of communication and connection. However, Coordinated inauthentic Behaviour (CIB), defined as orchestrated efforts by entities to deceive or mislead users about their identity and intentions, has emerged as a tactic to exploit the online discourse. In this study, we quantify the efficacy of CIB tactics by defining a general framework for evaluating the influence of a subset of nodes in a directed tree. We design two algorithms that provide optimal and greedy post-hoc placement strategies that lead to maximising the configuration influence. We then consider cascades from information spreading on X (formerly known as Twitter) to compare the observed behaviour with our algorithms. The results show that, according to our model, coordinated accounts are quite inefficient in terms of their network influence, thus suggesting that they may play a less pivotal role than expected. Moreover, the causes of these poor results may be found in two separate aspects: a bad placement strategy and a scarcity of resources.
- 1 January 2024
- Published by Springer Nature
- p. 443-455
A Discrete Geometry Method for Atom Depth Computation in Complex Molecular Systems
- 1 January 2024
- Published by Springer Nature
- p. 443-455
A Discrete Geometry Method for Atom Depth Computation in Complex Molecular Systems
- Open Access
- 18 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (22) , 2952
Visual Sequential Search Test Analysis: An Algorithmic Approach
In this work we present an algorithmic approach to the analysis of the Visual Sequential Search Test (VSST) based on the episode matching method. The data set included two groups of patients, one with Parkinson’s disease, and another with chronic pain syndrome, along with a control group. The VSST is an eye-tracking modified version of the Trail Making Test (TMT) which evaluates high order cognitive functions. The episode matching method is traditionally used in bioinformatics applications. Here it is used in a different context which helps us to assign a score to a set of patients, under a specific VSST task to perform. Experimental results provide statistical evidence of the different behaviour among different classes of patients, according to different pathologies.
- 18 November 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (22) , 2952
Open AccessVisual Sequential Search Test Analysis: An Algorithmic Approach
In this work we present an algorithmic approach to the analysis of the Visual Sequential Search Test (VSST) based on the episode matching method. The data set included two groups of patients, one with Parkinson’s disease, and another with chronic pain syndrome, along with a control group. The VSST is an eye-tracking modified version of the Trail Making Test (TMT) which evaluates high order cognitive functions. The episode matching method is traditionally used in bioinformatics applications. Here it is used in a different context which helps us to assign a score to a set of patients, under a specific VSST task to perform. Experimental results provide statistical evidence of the different behaviour among different classes of patients, according to different pathologies.
- 2 June 2020
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 62 (8) , 1121-1135
A Measure of Q-convexity for Shape Analysis
- 2 June 2020
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 62 (8) , 1121-1135
A Measure of Q-convexity for Shape Analysis
- 21 September 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 163 (1) , V-XIV
Preface
- 21 September 2018
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 163 (1) , V-XIV
Preface
- 6 September 2018
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 61 (2) , 193-203
A Q-Convexity Vector Descriptor for Image Analysis
- 6 September 2018
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 61 (2) , 193-203
A Q-Convexity Vector Descriptor for Image Analysis
- 13 September 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (2) , 185-195
On J-additivity and Bounded Additivity
In this paper we consider the uniqueness issues in Discrete Tomography. A special class of geometric objects, widely considered in the literature, is represented by additive sets. These sets are uniquely determined by their X -rays, and they are also
- 13 September 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (2) , 185-195
On J-additivity and Bounded Additivity
In this paper we consider the uniqueness issues in Discrete Tomography. A special class of geometric objects, widely considered in the literature, is represented by additive sets. These sets are uniquely determined by their X -rays, and they are also