Understanding greenhouse gas fluxes at the Earth’s surface is becoming crucial in the context of climate change. The aim of the CNES/UKSA MicroCarb mission is therefore to map, on a planetary scale, the sources and sinks of carbon, the main greenhouse gas in the atmosphere. To do this, a spectrometer will be sent in space to acquire spectra in 4 narrow bands around wavelengths associated with O2 and CO2. However, measurement errors can occur due to the instrument used, and induce errors in the resulting trace gas concentrations. It is therefore crucial to estimate the spectral response of the instrument as accurately as possible. This paper investigates a new estimation method for this spectral response that uses a sparse representation in a dictionary of appropriate basis functions. This sparse representation is performed using the LASSO and Orthogonal Matching Pursuit (OMP) algorithms. Simulations conducted on data mimicking observations resulting from the MicroCarb instrument allow the performance of this method to be appreciated.

State estimation techniques appear in a plethora of engineering fields, in particular for the attitude estimation application of interest in this contribution. A number of filters have been devised for this problem, in particular Kalman-type ones, but in their standard form they are known to be fragile against outliers. In this work, we focus on error-state filters, designed for states living on a manifold, here unit-norm quaternions. We propose extensions based on robust statistics, leading to two robust M-type filters able to tackle outliers either in the measurements, in the system dynamics or in both cases. The performance and robustness of these filters is explored in a numerical experiment. We first assess the outlier ratio that they manage to mitigate, and second the type of dynamics outliers that they can detect, showing that the filter performance depends on the measurements’ properties.

Accurately determining signal time-delay is crucial across various domains, such as localization and communication ystems. Understanding the achievable optimal estimation peformance of such technologies, especially during design phases, is essential for benchmarking purposes. One common approach is to derive bounds like the Cramer-Rao Bound (CRB), which directly reflects the minimum achievable estimation error for unbiased estimators. Different studies vary in their approach to deal with the degree of misalignment in the global phase originating from both the transmitter and the receiver in a single input, single output (SISO) link during time-delay estimation assessment. While some treat this phase term as unknown, others assume ideal calibration and compensation. As an alternative to these two opposing approaches, this study adopts a more balanced approach by considering that such a phase can be estimated with a defined uncertainty, a measure that could be mplemented in many practical applications. The primary contribution provided lies in the derivation of a closed-form CRB expression for this alternative signal model, which, as observed, exhibits an asymptotic behavior transitioning between the results observed in previous studies, influenced by the uncertainty assumed for the mentioned phase term.

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.