Tiziana Cattai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tiziana Cattai has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Stefania Colonnese
Department of Information Engineering, Electronics and Telecommunications, Sapienza University of Rome, 00184 Rome, Italy
12 shared publications - Francesca Cuomo
Sapienza University of Rome, Rome, Italy
7 shared publications - Gaetano Scarano
Department of Information Engineering, Electronics and Telecommunications, University of Rome La Sapienza Rome, Italy
6 shared publications - Fabrizio De Vico Fallani
Paris Brain Institute (ICM), CNRS UMR7225, INRIA Paris, INSERM U1127, Hôpital de la Pitié Salpêtrière AP‐HP Sorbonne Université Paris France
4 shared publications - Antonino Pagano
Department of Engineering, University of Palermo, Palermo, Italy
2 shared publications - Azeddine Beghdadi
Université Sorbonne Paris Nord
2 shared publications
Latest Publications
- Open Access
- 26 May 2026
- Published by Elsevier in Internet of Things
- Vol. 38
Joint anomaly detection and topology inference for dynamic water distribution networks monitoring
- 26 May 2026
- Published by Elsevier in Internet of Things
- Vol. 38
Open AccessJoint anomaly detection and topology inference for dynamic water distribution networks monitoring
- Open Access
- 4 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (12) , 19000-19012
ECG Wavelet Graph for IoT-Enabled Well-Being Monitoring
IoT-based ECG monitoring can support well-being assessment across a range of applications, from emotion recognition to arrhythmia detection. In this work, we propose a novel graph–wavelet-based representation of the ECG signal for classification under different emotional and health conditions. The proposed wavelet-graph encodes the persistence of ECG components across multiple wavelet sub-bands, effectively discriminating structurally different signals both in affective computing and arrhythmia detection tasks. The proposed wavelet-graph approach applies a single unified framework across diverse tasks — a characteristic that remains relatively uncommon in the current literature — outperforming task-specific methods by up to 4% and maintaining competitive performance across all evaluated settings, despite those methods being individually optimized for a single classification problem. Furthermore, the proposed approach relies on substantially fewer training samples and a markedly reduced number of trainable parameters compared to existing methods, thereby supporting near–real-time IoT-based wellbeing monitoring applications.
- 4 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (12) , 19000-19012
Open AccessECG Wavelet Graph for IoT-Enabled Well-Being Monitoring
IoT-based ECG monitoring can support well-being assessment across a range of applications, from emotion recognition to arrhythmia detection. In this work, we propose a novel graph–wavelet-based representation of the ECG signal for classification under different emotional and health conditions. The proposed wavelet-graph encodes the persistence of ECG components across multiple wavelet sub-bands, effectively discriminating structurally different signals both in affective computing and arrhythmia detection tasks. The proposed wavelet-graph approach applies a single unified framework across diverse tasks — a characteristic that remains relatively uncommon in the current literature — outperforming task-specific methods by up to 4% and maintaining competitive performance across all evaluated settings, despite those methods being individually optimized for a single classification problem. Furthermore, the proposed approach relies on substantially fewer training samples and a markedly reduced number of trainable parameters compared to existing methods, thereby supporting near–real-time IoT-based wellbeing monitoring applications.
- Open Access
- 7 April 2026
- Published by Elsevier in Internet of Things
- Vol. 37
Sustainable application-aware gateway deployment for massive IoT networks
- 7 April 2026
- Published by Elsevier in Internet of Things
- Vol. 37
Open AccessSustainable application-aware gateway deployment for massive IoT networks
- Open Access
- 4 March 2026
- Published by Elsevier in Internet of Things
- Vol. 37
TwinAI: A digital twin and graph reinforcement learning framework for real-time management of water distribution networks
- 4 March 2026
- Published by Elsevier in Internet of Things
- Vol. 37
Open AccessTwinAI: A digital twin and graph reinforcement learning framework for real-time management of water distribution networks
- Open Access
Learning Dirac Spectral Transforms for Topological Signals
The Dirac operator provides a unified framework for processing signals defined over different order topological domains, such as node and edge signals. Its eigenmodes define a spectral representation that inherently captures cross-domain interactions, in contrast to conventional Hodge-Laplacian eigenmodes that operate within a single topological dimension. In this paper, we compare the two alternatives in terms of the distortion/sparsity trade-off and we show how an overcomplete basis built concatenating the two dictionaries can provide better performance with respect to each approach. Then, we propose a parameterized nonredundant transform whose eigenmodes incorporate a mode-specific mass parameter that captures the interplay between node and edge modes. Interestingly, we show that learning the mass parameters from data makes the proposed transform able to achieve the best distortion-sparsity tradeoff with respect to both complete and overcomplete bases.
Open AccessLearning Dirac Spectral Transforms for Topological Signals
The Dirac operator provides a unified framework for processing signals defined over different order topological domains, such as node and edge signals. Its eigenmodes define a spectral representation that inherently captures cross-domain interactions, in contrast to conventional Hodge-Laplacian eigenmodes that operate within a single topological dimension. In this paper, we compare the two alternatives in terms of the distortion/sparsity trade-off and we show how an overcomplete basis built concatenating the two dictionaries can provide better performance with respect to each approach. Then, we propose a parameterized nonredundant transform whose eigenmodes incorporate a mode-specific mass parameter that captures the interplay between node and edge modes. Interestingly, we show that learning the mass parameters from data makes the proposed transform able to achieve the best distortion-sparsity tradeoff with respect to both complete and overcomplete bases.
- Open Access
- 11 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 24432-24446
Centrality-Guided Node Selection for Efficient Water Leak Detection
Water Distribution Networks (WDNs) are critical infrastructures that require continuous monitoring to ensure efficient operation and mitigate water loss caused by leaks. The strategic placement of sensors within these networks is essential for timely leak detection and localization. Selecting the most effective nodes for sensor placement, however, remains a challenging problem. Centrality measures, widely used in network science to quantify the node importance, offer a promising approach to guide the sensor deployment. This study investigates the impact of various centrality measures on node selection for leak detection in WDNs.We address the leak-detection problem using a two-stage methodology. First, we derive compact and informative feature representations from pressure matrices using the encoder of an autoencoder. Then, we apply a binary classifier to identify anomalous embeddings. We apply our method to two topologically different WDNs, exploring different centrality measures for sparse sensor deployment. Results show that in looped, high-redundancy topologies, a reduced set of strategically placed sensors maintain or even improve detection accuracy. In contrast, more fragile tree-like networks experience performance loss when sensors are reduced. To explain this structural behavior, we introduce a metric that quantifies a network’s structural vulnerability. Taken together, our findings offer practical guidance for water utilities seeking to balance leak-detection speed, accuracy, and cost through topology-based sensor placement.
- 11 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 24432-24446
Open AccessCentrality-Guided Node Selection for Efficient Water Leak Detection
Water Distribution Networks (WDNs) are critical infrastructures that require continuous monitoring to ensure efficient operation and mitigate water loss caused by leaks. The strategic placement of sensors within these networks is essential for timely leak detection and localization. Selecting the most effective nodes for sensor placement, however, remains a challenging problem. Centrality measures, widely used in network science to quantify the node importance, offer a promising approach to guide the sensor deployment. This study investigates the impact of various centrality measures on node selection for leak detection in WDNs.We address the leak-detection problem using a two-stage methodology. First, we derive compact and informative feature representations from pressure matrices using the encoder of an autoencoder. Then, we apply a binary classifier to identify anomalous embeddings. We apply our method to two topologically different WDNs, exploring different centrality measures for sparse sensor deployment. Results show that in looped, high-redundancy topologies, a reduced set of strategically placed sensors maintain or even improve detection accuracy. In contrast, more fragile tree-like networks experience performance loss when sensors are reduced. To explain this structural behavior, we introduce a metric that quantifies a network’s structural vulnerability. Taken together, our findings offer practical guidance for water utilities seeking to balance leak-detection speed, accuracy, and cost through topology-based sensor placement.
- 2 January 2026
- Published by Springer Nature
- p. 108-121
Secure Management of a Water Distribution Network in Multi-tenant Scenarios
- 2 January 2026
- Published by Springer Nature
- p. 108-121
Secure Management of a Water Distribution Network in Multi-tenant Scenarios
- Open Access
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 1317-1331
Robust Graph Topology Inference for Multiple Brain EEG Networks
In EEG-based connectivity analysis, multiple graphs are typically available, as obtained from measurements taken under different conditions, such as frequency bands, trials, or patients' states. Identifying stable patterns of interaction among brain regions, such as functional communities, can provide valuable insight into brain organization and its changes across tasks or conditions. It is then of interest to find a method to properly combine these different graphs to obtain a clustering that is sufficiently stable and representative of brain functionalities. In this paper, we propose a method to obtain robust spectral clustering. The method relies on a statistical characterization of the multiple graphs and a small perturbation analysis of the eigen-decomposition of graphs affected by random perturbations to derive the optimal weighting that minimizes the variance of the eigenvalues. The proposed method is first tested on synthetic data, to assess its advantages with respect to conventional approaches under controllable conditions, and then it is applied to real EEG data in both healthy individuals performing motor imagery tasks and patients affected by Alzheimer's disease. The results show the ability of the method to reliably detect functional communities and quantify connectivity reorganization during cognitive tasks. Our results suggest that the proposed approach provides a valid new strategy to combine multiple graphs taking into account the statistical properties of each graph in the presence of uncertainties.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 1317-1331
Open AccessRobust Graph Topology Inference for Multiple Brain EEG Networks
In EEG-based connectivity analysis, multiple graphs are typically available, as obtained from measurements taken under different conditions, such as frequency bands, trials, or patients' states. Identifying stable patterns of interaction among brain regions, such as functional communities, can provide valuable insight into brain organization and its changes across tasks or conditions. It is then of interest to find a method to properly combine these different graphs to obtain a clustering that is sufficiently stable and representative of brain functionalities. In this paper, we propose a method to obtain robust spectral clustering. The method relies on a statistical characterization of the multiple graphs and a small perturbation analysis of the eigen-decomposition of graphs affected by random perturbations to derive the optimal weighting that minimizes the variance of the eigenvalues. The proposed method is first tested on synthetic data, to assess its advantages with respect to conventional approaches under controllable conditions, and then it is applied to real EEG data in both healthy individuals performing motor imagery tasks and patients affected by Alzheimer's disease. The results show the ability of the method to reliably detect functional communities and quantify connectivity reorganization during cognitive tasks. Our results suggest that the proposed approach provides a valid new strategy to combine multiple graphs taking into account the statistical properties of each graph in the presence of uncertainties.
- Open Access
- 7 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 6, 2067-2081
Multi-UAV Reinforcement Learning With Realistic Communication Models: Recent Advances and Challenges
The interest in applications related to Multi-Unmanned Aerial Vehicle (UAV) systems has been growing exponentially in the last few years. Reinforcement Learning (RL) presents one of the most popular alternatives for solving Multi-UAV tasks, thanks to its flexible requirements for modeling the problem. However, it is often applied to abstractions of the original problem, thus leaving to next development phases the integration of RL solutions to the actual systems. This choice may not guarantee the overall optimal performance of the implemented system. In this survey, we analyze the literature on Multi-UAV applications that utilize reinforcement learning, with particular attention to works that consider realistic communication channels. We focus on identifying the key variables that influence communication and whether these variables are integrated within the RL framework or considered externally. Additionally, we identify key trends, challenges, and future directions in the field, providing a comprehensive overview for researchers and practitioners interested in the practical deployment of RL-based Multi-UAV systems.
- 7 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 6, 2067-2081
Open AccessMulti-UAV Reinforcement Learning With Realistic Communication Models: Recent Advances and Challenges
The interest in applications related to Multi-Unmanned Aerial Vehicle (UAV) systems has been growing exponentially in the last few years. Reinforcement Learning (RL) presents one of the most popular alternatives for solving Multi-UAV tasks, thanks to its flexible requirements for modeling the problem. However, it is often applied to abstractions of the original problem, thus leaving to next development phases the integration of RL solutions to the actual systems. This choice may not guarantee the overall optimal performance of the implemented system. In this survey, we analyze the literature on Multi-UAV applications that utilize reinforcement learning, with particular attention to works that consider realistic communication channels. We focus on identifying the key variables that influence communication and whether these variables are integrated within the RL framework or considered externally. Additionally, we identify key trends, challenges, and future directions in the field, providing a comprehensive overview for researchers and practitioners interested in the practical deployment of RL-based Multi-UAV systems.
- Open Access
- 21 June 2025
- Published by Elsevier in Journal of Industrial Information Integration
- Vol. 47
Graph neural networks to model and optimize the operation of Water Distribution Networks: A review
- 21 June 2025
- Published by Elsevier in Journal of Industrial Information Integration
- Vol. 47
Open AccessGraph neural networks to model and optimize the operation of Water Distribution Networks: A review