arXiv subjects

Paolo Braca

Publications and source records attributed to Paolo Braca.

At least 19 recordsLinked to original sources

arXiv2023

3D Localization and Tracking Methods for Multi-Platform Radar Networks

Multi-platform radar networks (MPRNs) are an emerging sensing technology due to their ability to provide improved surveillance capabilities over plain monostatic and bistatic systems. The design of advanced detection, localization, and tracking algorithms for efficient fusion of information obtained through multiple receivers has attracted much attention. However, considerable challenges remain. This article provides an overview on recent unconstrained and constrained localization techniques as well as multitarget tracking (MTT) algorithms tailored to MPRNs. In particular, two data-processing methods are illustrated and explored in detail, one aimed at accomplishing localization tasks the other tracking functions. As to the former, assuming a MPRN with one transmitter and multiple receivers, the angular and range constrained estimator (ARCE) algorithm capitalizes on the knowledge of the transmitter antenna beamwidth. As to the latter, the scalable sum-product algorithm (SPA) based MTT technique is presented. Additionally, a solution to combine ARCE and SPA-based MTT is investigated in order to boost the accuracy of the overall surveillance system. Simulated experiments show the benefit of the combined algorithm in comparison with the conventional baseline SPA-based MTT and the stand-alone ARCE localization, in a 3D sensing scenario.

eess.SP↗

arXiv2023

Monitoring of Underwater Critical Infrastructures: the Nord Stream and Other Recent Case Studies

The explosions on September 26th, 2022, which damaged the gas pipelines of Nord Stream 1 and Nord Stream 2, have highlighted the need and urgency of improving the resilience of Underwater Critical Infrastructures (UCIs). Comprising gas pipelines and power and communication cables, these connect countries worldwide and are critical for the global economy and stability. An attack targeting multiple of such infrastructures simultaneously could potentially cause significant damage and greatly affect various aspects of daily life. Due to the increasing number and continuous deployment of UCIs, existing underwater surveillance solutions, such as Autonomous Underwater Vehicles (AUVs) or Remotely Operated Vehicles (ROVs), are not adequate enough to ensure thorough monitoring. We show that the combination of information from both underwater and above-water surveillance sensors enables achieving Seabed-to-Space Situational Awareness (S3A), mainly thanks to Artificial Intelligence (AI) and Information Fusion (IF) methodologies. These are designed to process immense volumes of information, fused from a variety of sources and generated from monitoring a very large number of assets on a daily basis. The learned knowledge can be used to anticipate future behaviors, identify threats, and determine critical situations concerning UCIs. To illustrate the capabilities and importance of S3A, we consider three events that occurred in the second half of 2022: the aforementioned Nord Stream explosions, the cutoff of the underwater communication cable SHEFA-2 connecting the Shetland Islands and the UK mainland, and the suspicious activity of a large vessel in the Adriatic Sea. Specifically, we provide analyses of the available data, from Automatic Identification System (AIS) and satellite data, integrated with possible contextual information, e.g., bathymetry, weather conditions, and human intelligence.

eess.SP↗

arXiv2023

Large Deviations for Classification Performance Analysis of Machine Learning Systems

We study the performance of machine learning binary classification techniques in terms of error probabilities. The statistical test is based on the Data-Driven Decision Function (D3F), learned in the training phase, i.e., what is thresholded before the final binary decision is made. Based on large deviations theory, we show that under appropriate conditions the classification error probabilities vanish exponentially, as $\sim \exp\left(-n\,I + o(n) \right)$, where $I$ is the error rate and $n$ is the number of observations available for testing. We also propose two different approximations for the error probability curves, one based on a refined asymptotic formula (often referred to as exact asymptotics), and another one based on the central limit theorem. The theoretical findings are finally tested using the popular MNIST dataset.

cs.LG↗

arXiv2022

Statistical Hypothesis Testing Based on Machine Learning: Large Deviations Analysis

We study the performance -- and specifically the rate at which the error probability converges to zero -- of Machine Learning (ML) classification techniques. Leveraging the theory of large deviations, we provide the mathematical conditions for a ML classifier to exhibit error probabilities that vanish exponentially, say $\sim \exp\left(-n\,I + o(n) \right)$, where $n$ is the number of informative observations available for testing (or another relevant parameter, such as the size of the target in an image) and $I$ is the error rate. Such conditions depend on the Fenchel-Legendre transform of the cumulant-generating function of the Data-Driven Decision Function (D3F, i.e., what is thresholded before the final binary decision is made) learned in the training phase. As such, the D3F and, consequently, the related error rate $I$, depend on the given training set, which is assumed of finite size. Interestingly, these conditions can be verified and tested numerically exploiting the available dataset, or a synthetic dataset, generated according to the available information on the underlying statistical model. In other words, the classification error probability convergence to zero and its rate can be computed on a portion of the dataset available for training. Coherently with the large deviations theory, we can also establish the convergence, for $n$ large enough, of the normalized D3F statistic to a Gaussian distribution. This property is exploited to set a desired asymptotic false alarm probability, which empirically turns out to be accurate even for quite realistic values of $n$. Furthermore, approximate error probability curves $\sim ζ_n \exp\left(-n\,I \right)$ are provided, thanks to the refined asymptotic derivation (often referred to as exact asymptotics), where $ζ_n$ represents the most representative sub-exponential terms of the error probabilities.

stat.ML↗

arXiv2022

Recurrent Encoder-Decoder Networks for Vessel Trajectory Prediction with Uncertainty Estimation

Recent deep learning methods for vessel trajectory prediction are able to learn complex maritime patterns from historical Automatic Identification System (AIS) data and accurately predict sequences of future vessel positions with a prediction horizon of several hours. However, in maritime surveillance applications, reliably quantifying the prediction uncertainty can be as important as obtaining high accuracy. This paper extends deep learning frameworks for trajectory prediction tasks by exploring how recurrent encoder-decoder neural networks can be tasked not only to predict but also to yield a corresponding prediction uncertainty via Bayesian modeling of epistemic and aleatoric uncertainties. We compare the prediction performance of two different models based on labeled or unlabeled input data to highlight how uncertainty quantification and accuracy can be improved by using, if available, additional information on the intention of the ship (e.g., its planned destination).

cs.CV↗

arXiv2021

Fusion of Sensor Measurements and Target-Provided Information in Multitarget Tracking

Tracking multiple time-varying states based on heterogeneous observations is a key problem in many applications. Here, we develop a statistical model and algorithm for tracking an unknown number of targets based on the probabilistic fusion of observations from two classes of data sources. The first class, referred to as target-independent perception systems (TIPSs), consists of sensors that periodically produce noisy measurements of targets without requiring target cooperation. The second class, referred to as target-dependent reporting systems (TDRSs), relies on cooperative targets that report noisy measurements of their state and their identity. We present a joint TIPS-TDRS observation model that accounts for observation-origin uncertainty, missed detections, false alarms, and asynchronicity. We then establish a factor graph that represents this observation model along with a state evolution model including target identities. Finally, by executing the sum-product algorithm on that factor graph, we obtain a scalable multitarget tracking algorithm with inherent TIPS-TDRS fusion. The performance of the proposed algorithm is evaluated using simulated data as well as real data from a maritime surveillance experiment.

eess.SP↗

arXiv2021

Cooperative Localization and Multitarget Tracking in Agent Networks with the Sum-Product Algorithm

This paper addresses the problem of multitarget tracking using a network of sensing agents with unknown positions. Agents have to both localize themselves in the sensor network and, at the same time, perform multitarget tracking in the presence of clutter and miss detection. These two problems are jointly resolved using a holistic and centralized approach where graph theory is used to describe the statistical relationships among agent states, target states, and observations. A scalable message passing scheme, based on the sum-product algorithm, enables to efficiently approximate the marginal posterior distributions of both agent and target states. The proposed method is general enough to accommodate a full multistatic network configuration, with multiple transmitters and receivers. Numerical simulations show superior performance of the proposed joint approach with respect to the case in which cooperative self-localization and multitarget tracking are performed separately, as the former manages to extract valuable information from targets. Lastly, data acquired in 2018 by the NATO Science and Technology Organization (STO) Centre for Maritime Research and Experimentation (CMRE) through a network of autonomous underwater vehicles demonstrates the effectiveness of the approach in a practical application.

eess.SP↗

arXiv2021

Deep Learning Methods for Vessel Trajectory Prediction based on Recurrent Neural Networks

Data-driven methods open up unprecedented possibilities for maritime surveillance using Automatic Identification System (AIS) data. In this work, we explore deep learning strategies using historical AIS observations to address the problem of predicting future vessel trajectories with a prediction horizon of several hours. We propose novel sequence-to-sequence vessel trajectory prediction models based on encoder-decoder recurrent neural networks (RNNs) that are trained on historical trajectory data to predict future trajectory samples given previous observations. The proposed architecture combines Long Short-Term Memory (LSTM) RNNs for sequence modeling to encode the observed data and generate future predictions with different intermediate aggregation layers to capture space-time dependencies in sequential data. Experimental results on vessel trajectories from an AIS dataset made freely available by the Danish Maritime Authority show the effectiveness of deep-learning methods for trajectory prediction based on sequence-to-sequence neural networks, which achieve better performance than baseline approaches based on linear regression or on the Multi-Layer Perceptron (MLP) architecture. The comparative evaluation of results shows: i) the superiority of attention pooling over static pooling for the specific application, and ii) the remarkable performance improvement that can be obtained with labeled trajectories, i.e., when predictions are conditioned on a low-level context representation encoded from the sequence of past observations, as well as on additional inputs (e.g., port of departure or arrival) about the vessel's high-level intention, which may be available from AIS.

cs.CV↗

arXiv2021

Enhanced Target Localization with Deployable Multiplatform Radar Nodes Based on Non-Convex Constrained Least Squares Optimization

A new algorithm for 3D localization in multiplatform radar networks, comprising one transmitter and multiple receivers, is proposed. To take advantage of the monostatic sensor radiation pattern features, ad-hoc constraints are imposed in the target localization process. Therefore, the localization problem is formulated as a non-convex constrained Least Squares (LS) optimization problem which is globally solved in a quasi-closed-form leveraging Karush-Kuhn-Tucker (KKT) conditions. The performance of the new algorithm is assessed in terms of Root Mean Square Error (RMSE) in comparison with the benchmark Cramer Rao Lower Bound (CRLB) and some competitors from the open literature. The results corroborate the effectiveness of the new strategy which is capable of ensuring a lower RMSE than the counterpart methodologies especially in the low Signal to Noise Ratio (SNR) regime.

eess.SP↗

arXiv2021

Quickest Detection and Forecast of Pandemic Outbreaks: Analysis of COVID-19 Waves

The COVID-19 pandemic has, worldwide and up to December 2020, caused over 1.7 million deaths, and put the world's most advanced healthcare systems under heavy stress. In many countries, drastic restrictive measures adopted by political authorities, such as national lockdowns, have not prevented the outbreak of new pandemic's waves. In this article, we propose an integrated detection-estimation-forecasting framework that, using publicly available data, is designed to: (i) learn relevant features of the pandemic (e.g., the infection rate); (ii) detect as quickly as possible the onset (or the termination) of an exponential growth of the contagion; and (iii) reliably forecast the pandemic evolution. The proposed solution is validated by analyzing the COVID-19 second and third waves in the USA.

eess.SP↗

arXiv2021

Quickest Detection of COVID-19 Pandemic Onset

This paper develops an easily-implementable version of Page's CUSUM quickest-detection test, designed to work in certain composite hypothesis scenarios with time-varying data statistics. The decision statistic can be cast in a recursive form and is particularly suited for on-line analysis. By back-testing our approach on publicly-available COVID-19 data we find reliable early warning of infection flare-ups, in fact sufficiently early that the tool may be of use to decision-makers on the timing of restrictive measures that may in the future need to be taken.

eess.SP↗

arXiv2021

COVID-19 Impact on Global Maritime Mobility

To prevent the outbreak of the Coronavirus disease (COVID-19), many countries around the world went into lockdown and imposed unprecedented containment measures. These restrictions progressively produced changes to social behavior and global mobility patterns, evidently disrupting social and economic activities. Here, using maritime traffic data collected via a global network of AIS receivers, we analyze the effects that the COVID-19 pandemic and containment measures had on the shipping industry, which accounts alone for more than 80% of the world trade. We rely on multiple data-driven maritime mobility indexes to quantitatively assess ship mobility in a given unit of time. The mobility analysis here presented has a worldwide extent and is based on the computation of: CNM of all ships reporting their position and navigational status via AIS, number of active and idle ships, and fleet average speed. To highlight significant changes in shipping routes and operational patterns, we also compute and compare global and local density maps. We compare 2020 mobility levels to those of previous years assuming that an unchanged growth rate would have been achieved, if not for COVID-19. Following the outbreak, we find an unprecedented drop in maritime mobility, across all categories of commercial shipping. With few exceptions, a generally reduced activity is observable from March to June, when the most severe restrictions were in force. We quantify a variation of mobility between -5.62% and -13.77% for container ships, between +2.28% and -3.32% for dry bulk, between -0.22% and -9.27% for wet bulk, and between -19.57% and -42.77% for passenger traffic. This study is unprecedented for the uniqueness and completeness of the employed dataset, which comprises a trillion AIS messages broadcast worldwide by 50000 ships, a figure that closely parallels the documented size of the world merchant fleet.

econ.GN↗

arXiv2021

Decision Support for the Quickest Detection of Critical COVID-19 Phases

During the course of an epidemic, one of the most challenging tasks for authorities is to decide what kind of restrictive measures to introduce and when these should be enforced. In order to take informed decisions in a fully rational manner, the onset of a critical regime, characterized by an exponential growth of the contagion, must be identified as quickly as possible. Providing rigorous quantitative tools to detect such an onset represents an important contribution from the scientific community to proactively support the political decision makers. In this paper, leveraging the quickest detection theory, we propose a mathematical model of the COVID-19 pandemic evolution and develop decision tools to rapidly detect the passage from a controlled regime to a critical one. A new sequential test -- referred to as MAST (mean-agnostic sequential test) -- is presented, and demonstrated on publicly available COVID-19 infection data from different countries. Then, the performance of MAST is investigated for the second pandemic wave, showing an effective trade-off between average decision delay $Δ$ and risk $R$, where $R$ is inversely proportional to the time required to declare the need to take unnecessary restrictive measures. Ideally, the decision mechanism should react as quick as possible for a given level of risk. We find that all the countries share the same behaviour in terms of quickest detection, specifically the risk scales exponentially with the delay, $R \sim \exp{(-ωΔ)}$, where $ω$ depends on the specific nation. For a reasonably small risk level, say, one possibility in ten thousand (i.e., unmotivated implementation of countermeasures every 27 years, on the average), the proposed algorithm detects the onset of the critical regime with delay between a few days to three weeks, much earlier than when the exponential growth becomes evident.

physics.soc-ph↗

arXiv2020

Space-based Global Maritime Surveillance. Part I: Satellite Technologies

Maritime surveillance (MS) is crucial for search and rescue operations, fishery monitoring, pollution control, law enforcement, migration monitoring, and national security policies. Since the early days of seafaring, MS has been a critical task for providing security in human coexistence. Several generations of sensors providing detailed maritime information have become available for large offshore areas in real time: maritime radar sensors in the 1950s and the automatic identification system (AIS) in the 1990s among them. However, ground-based maritime radars and AIS data do not always provide a comprehensive and seamless coverage of the entire maritime space. Therefore, the exploitation of space-based sensor technologies installed on satellites orbiting around the Earth, such as satellite AIS data, synthetic aperture radar, optical sensors, and global navigation satellite systems reflectometry, becomes crucial for MS and to complement the existing terrestrial technologies. In the first part of this work, we provide an overview of the main available space-based sensors technologies and present the advantages and limitations of each technology in the scope of MS. The second part, related to artificial intelligence, signal processing and data fusion techniques, is provided in a companion paper, titled: "Space-based Global Maritime Surveillance. Part II: Artificial Intelligence and Data Fusion Techniques" [1].

eess.SP↗

arXiv2020

Space-based Global Maritime Surveillance. Part II: Artificial Intelligence and Data Fusion Techniques

Maritime surveillance (MS) is of paramount importance for search and rescue operations, fishery monitoring, pollution control, law enforcement, migration monitoring, and national security policies. Since ground-based radars and automatic identification system (AIS) do not always provide a comprehensive and seamless coverage of the entire maritime domain, the use of space-based sensors is crucial to complement them. We reviewed space-based technologies for MS in the first part of this work, titled "Space-based Global Maritime Surveillance. Part I: Satellite Technologies" [1]. However, future MS systems combining multiple terrestrial and space-based sensors with additional information sources will require dedicated artificial intelligence and data fusion techniques for the processing of raw satellite images and fuse heterogeneous information. The second part of our work focuses on the most promising artificial intelligence and data fusion techniques for MS using space-based sensors.

eess.SP↗

arXiv2020

Classification-Aided Multitarget Tracking Using the Sum-Product Algorithm

Multitarget tracking (MTT) is a challenging task that aims at estimating the number of targets and their states from measurements of the target states provided by one or multiple sensors. Additional information, such as imperfect estimates of target classes provided by a classifier, can facilitate the target-measurement association and thus improve MTT performance. In this letter, we describe how a recently proposed MTT framework based on the sum-product algorithm can be extended to efficiently exploit class information. The effectiveness of the proposed approach is demonstrated by simulation results.

eess.SP↗

arXiv2018

Signal Amplitude Estimation and Detection from Unlabeled Binary Quantized Samples

Signal amplitude estimation and detection from unlabeled quantized binary samples are studied, assuming that the order of the time indexes is completely unknown. First, maximum likelihood (ML) estimators are utilized to estimate both the permutation matrix and unknown signal amplitude under arbitrary, but known signal shape and quantizer thresholds. Sufficient conditions are provided under which an ML estimator can be found in polynomial time and an alternating maximization algorithm is proposed to solve the general problem via good initial estimates. In addition, the statistical identifiability of the model is studied. Furthermore, the generalized likelihood ratio test (GLRT) detector is adopted to detect the presence of signal. In addition, an accurate approximation to the probability of successful permutation matrix recovery is derived, and explicit expressions are provided to reveal the relationship between the number of signal samples and the number of quantizers. Finally, numerical simulations are performed to verify the theoretical results.

cs.IT↗

arXiv2017

ODIN: Obfuscation-based privacy preserving consensus algorithm for Decentralized Information fusion in smart device Networks

The large spread of sensors and smart devices in urban infrastructures are motivating research in the area of Internet of Thing (IoT), to develop new services and improve citizens' quality of life. Sensors and smart devices generate large amount of measurement data from sensing the environment, which is used to enable services, such as control power consumption or traffic density. To deal with such a large amount of information, and provide accurate measurements, service providers can adopt information fusion, which, given the decentralized nature of urban deployments, can be performed by means of consensus algorithms. These algorithms allow distributed agents to (iteratively) compute linear functions on the exchanged data, and take decisions based on the outcome, without the need for the support of a central entity. However, the use of consensus algorithms raises several security concerns, especially when private or security critical information are involved in the computation. This paper proposes ODIN, a novel algorithm that allows information fusion over encrypted data. ODIN is a privacy-preserving extension of the popular consensus gossip algorithm, that prevents distributed agents have direct access to the data while they iteratively reach consensus; agents cannot access even the final consensus value, but can only retrieve partial information, e.g., a binary decision. ODIN uses efficient additive obfuscation and proxy re-encryption during the update steps, and Garbled Circuits to take final decisions on the obfuscated consensus. We discuss the security of our proposal, and show its practicability and efficiency on real-world resource constrained devices, developing a prototype implementation for Raspberry Pi devices.

cs.CR↗