This paper studies a new fusion method designed for magnetic resonance (MR) and ultrasound (US) images, with a specific focus on endometriosis diagnosis. The proposed method is based on guided filtering, leveraging the advantages of this technique to enhance the quality of fused images. The fused image is a weighted average of base and detail images from the MR and US images. The weights assigned to the US image account for the presence of speckle noise, a common challenge in US imaging whereas the weights assigned to the MR image allow the contrast of the fused image to be enhanced. The effectiveness of the method is evaluated using synthetic and phantom data, showing promising results. The image provided by the proposed fusion method holds potential for enhancing visualization and aiding decision-making in endometriosis surgery, offering a valuable contribution to the field of medical image fusion.

This paper studies an algorithm allowing the isolation forest method to be adapted to time series associated with ship trajectories. This algorithm builds decision trees using different similarity measures between the ship trajectories of interest and the atoms of a dictionary constructed by the user. The similarity measure used to compare trajectories with potentially different lengths is based on dynamic time warping. Results obtained on synthetic data with an available ground truth yield promising results, when compared to the state-of-the-art.

Multiple sensors, such as AIS and radar, are used to monitor nearby ships during maritime surveillance operations. The data from these sensors must be associated so as to accurately locate the targets and identify their behavior, while taking into account the presence of potential sensor biases. Several algorithms exist in the state-of-the-art to solve this association problem. However, few of them allow the sensor biases to be corrected. This paper adapts the coherent point drift method to the association of AIS and radar tracks while taking into account the radar uncertainty. The proposed adaptation is based on an expectation-maximization algorithm that jointly estimates the bias of the radar sensor with respect to the AIS sensor (in polar coordinates), the radar and AIS uncertainties and solves the association problem. The performance of this algorithm is evaluated using AIS and radar tracks obtained from numerous scenarios yielding promising results.

This paper analyzes multidimensional time series through the lens of their integrals of various moment orders, constituting their signatures, a novel tool for detecting anomalies in time series. The proposed anomaly detection (AD) method is compared using classical distance-based methods such as Local Outlier Factor (LOF) and One-Class Support Vector Machine (OCSVM). These methods are investigated using different similarity measures: distance on signature features, Euclidean distance and Dynamic TimeWarping (DTW). The combination of signature features with a specific segmentation of time series leads to a multi-scale analysis tool that is competitive with respect to the state-of-the-art results, while maintaining low computational costs thanks to a property of the signature features.

In this paper, we propose an unsupervised statistical approach for near real-time monitoring of forest loss, leveraging Bayesian inference. We address the identification of forest loss as a change-point detection problem within non-filtered Sentinel-1 single polarization time series data. Each new observation contributes to the probability of deforestation occurrence, utilizing prior knowledge and a data model. Our method offers the advantage of detecting small-scale deforestation without resorting to spatial filtering techniques, thus preserving the native spatial resolution of the Sentinel-1 measurements. To assess its effectiveness, we conducted comparative evaluations against existing operational deforestation monitoring systems. The validation campaign revealed that our method exhibits enhanced detection performance with low false alarm rates with respect to existing systems across diverse landscapes, including dense forest regions such as the Brazilian Amazon, as well as seasonality-dependent areas like the Cerrado, which is strongly under-monitored by existing technology. This robustness stems from the sequential adaptive process inherent in our approach, which enables effective monitoring even in the presence of backscatter variations.

Forest loss is a global issue that requires real-time surveillance to prevent further vegetation loss. This study presents an unsupervised SAR-based technique that leverages Bayesian inference and infinite state Markov chains to identify forest loss, overcoming the limitations of current methods. Our approach significantly improves accuracy and reduces false alarm rates compared to existing Near Real-Time (NRT) forest loss monitoring systems and enlarges the conditions of operability.

The computation of a common reference time for a swarm of nanosatellites is restricted by the quality and availability of the timing measurements made with inter-satellite links. The presence of anomalies or absence of communication links is demonstrated to harm the stability of the time scale. The Least Squares (LS) estimator is introduced as a method of preprocessing measurement noise by using all available clock comparisons in the swarm. This estimator also provides filtered measurements when inter-satellite links are missing as long as each satellite maintains at least one link with another. Anomaly detection and removing corrupted satellite links are shown to be compatible with the LS estimator to mitigate the impact of anomalous measurements. When a satellite becomes completely isolated for some period of time, a correction at the beginning and the end of the isolation period are both detailed. The correction is simple and just requires resetting the weights of missing clocks and clocks being reintroduced. Continuity is shown to be maintained when a large portion of clocks are removed and later reintroduced at the same time.

Nous proposons de partitionner l’architecture d’un réseau ad-hoc mobile en plusieurs groupes, afin de re-distribuer équitablement la charge entre les membres du réseau. Notre étude porte sur un essaim de nanosatellites fonctionnant commue un télélescope spatial distribué, placé en orbite lunaire. Chaque nanosatellite de l’essaim collecte des données d’observation de l’espace, puis les échange avec les autres membres de l’essaim. Les données recueillies sont ensuite combinées localement afin de produire l’image globale observée par l’essaim. Cependant, un système fondé sur ce mode opératoire est particulièrement sensible aux pertes de paquets et aux pannes d’énergie. En effet, la transmission simultanée d’un important volume de données peut entraîner des problèmes de communication, notamment en surchargeant le canal radio ou en augmentant le risque de collisions, menant dans les deux cas à des pertes de paquets. La consommation énergétique totale de l’essaim est également proportionnelle au nombre de paquets transmis : il faut alors trouver une solution pour limiter le nombre de transmissions afin d’économiser l’énergie des nanosatellites. La principale contribution de ce papier est de proposer une approche basée sur la division équitable du réseau en plusieurs groupes de nanosatellites. Nous comparons les performances de trois algorithmes de division de graphe : Random Node Division (RND), Multiple Independent Random Walks (MIRW), et Forest Fire Division (FFD). Nos résultats montrent que MIRW obtient les meilleurs scores en termes d’équité, peu importe le nombre de groupes produit.

Nous proposons de partitionner l’architecture d’un réseau ad-hoc mobile en plusieurs groupes, afin de re-distribuer équitablement la charge entre les membres du réseau. Notre étude porte sur un essaim de nanosatellites fonctionnant comme un télescope spatial distribué, placé en orbite lunaire. Chaque nanosatellite de l’essaim collecte des données d’observation de l’espace, puis les échange avec les autres membres de l’essaim. Les données recueillies sont ensuite combinées localement afin de produire l’image globale observée par l’essaim. Cependant, un système fondé sur ce mode opératoire est particulièrement sensible aux pertes de paquets et aux pannes d’énergie. En effet, la transmission simultanée d’un important volume de données peut entraîner des problèmes de communication, notamment en surchargeant le canal radio ou en augmentant le risque de collisions, menant dans les deux cas `a des pertes de paquets. La consommation énergétique totale de l’essaim est également proportionnelle au nombre de paquets transmis : il faut alors trouver une solution pour limiter le nombre de transmissions afin d’économiser l’énergie des nanosatellites. La principale contribution de ce papier est de proposer une approche basée sur la division équitable du réseau en plusieurs groupes de nanosatellites. Nous comparons les performances de trois algorithmes de division de graphe : Random Node Division (RND), Multiple Independent Random Walks (MIRW), et Forest Fire Division (FFD). Nos résultats montrent que MIRW obtient les meilleurs scores en termes d’équité, peu importe le nombre de groupes produit.