This article introduces a new class of recursive linearly constrained minimum variance estimators (LCMVEs) that provides additional robustness to modeling errors. To achieve that robustness, a set of non-stationary linear constraints are added to the standard LCMVE that allow for a closed form solution that becomes appealing in sequential implementations of the estimator. Indeed, a key point of such recursive LCMVE is to be fully adaptive in the context of sequential estimation as it allows optional constraints addition that can be triggered by a preprocessing of each new observation or external information on the environment. This methodology has significance in the popular problem of linear regression among others. Particularly, this article considers the general class of partially coherent signal (PCS) sources, which encompasses the case of fully coherent signal (FCS) sources. The article derivates the recursive LCMVE for this type of problems and investigates, analytically and through simulations, its robustness against mismatches on linear discrete state-space models. Both errors on system matrices and noise statistics uncertainty are considered. An illustrative multi-channel array processing example is treated to support the discussion, where results in different model mismatched scenarios are provided with respect to the standard case with only FCS sources.

Satellite systems typically use physical and link layer reliability schemes to compensate the significant channel impairments, especially for the link between a satellite and a mobile end-user. These schemes have been introduced at the price of an increase in the end-to-end delay, high jitter or out-of-order packets. This is show to have a negative impact both on multimedia and best-effort traffic, decreasing the Quality of Experience (QoE) of users. In this paper, we propose to solve this issue by scheduling data transmission as a function of the channel condition. We first investigate existing scheduling mechanisms and analyze their performance for two kinds of traffic : VoIP and best-effort. In the case of VoIP traffic, the objective is to lower both latency and jitter, which are the most important metrics to achieve a consistent VoIP service. We select the best candidate among several schedulers and propose a novel algorithm speciffically designed to carry VoIP over LEO constellations. We then investigate the performance of the scheduling policies on Internet-browsing trac carried by TCP, where the goal is now the maximize the users' goodput, and select the best candidate in this case.

Light detection and ranging (Lidar) single-photon devices capture range and intensity information from a 3D scene. This modality enables long range 3D reconstruction with high range precision and low laser power. A multispectral single-photon Lidar system provides additional spectral diversity, allowing the discrimination of different materials. However, the main drawback of such systems can be the long acquisition time needed to collect enough photons in each spectral band. In this work, we tackle this problem in two ways: first, we propose a Bayesian 3D reconstruction algorithm that is able to find multiple surfaces per pixel, using few photons, i.e., shorter acquisitions. In contrast to previous algorithms, the novel method processes jointly all the spectral bands, obtaining better reconstructions using less photon detections. The proposed model promotes spatial correlation between neighbouring points within a given surface using spatial point processes. Secondly, we account for different spatial and spectral subsampling schemes, which reduce the total number of measurements, without significant degradation of the reconstruction performance. In this way, the total acquisition time, memory requirements and computational time can be significantly reduced. The experiments performed using both synthetic and real single-photon Lidar data demonstrate the advantages of tailored sampling schemes over random alternatives. Furthermore, the proposed algorithm yields better estimates than other existing methods for multi-surface reconstruction using multispectral Lidar data.

This paper proposes a new motion estimation method based on convolutional sparse coding to adaptively design the colored-coded apertures in static and dynamic spectral videos. The motion in a spectral video is estimated from a low-resolution reconstruction of the datacube by training a convolutional dictionary per spectral band and solving a minimization problem. Simulations show improvements in terms of peak signal-to-noise ratio (of up to 2 dB) of the reconstructed videos by using the proposed approach, compared with state-of-art non-adaptive coded apertures.

This paper investigates a new regularization of the group-sparsity estimation problem based on a quadratic envelope operator. The resulting estimator is shown to have a reduced bias when compared to the classical LASSO estimator and is characterized by a simple hyperparameter selection. Numerical results show that the quadratic envelope regularization yields estimates equal to an oracle solution with high probability. The robustness of the proposed hyperparameter selection rule is also analyzed.

One of the main objectives of hyperspectral image processing is to detect a given target among an unknown background. The standard data to conduct such a detection is a reflectance map, where the spectral signatures of each pixel’s components, known as endmembers, are associated with their abundances in the pixel. Due to the low spatial resolution of most hyperspectral sensors, such a target occupies a fraction of the pixel. A widely used model in case of subpixel targets is the replacement model. Among the vast number of possible detectors, algorithms matched to the replacement model are quite rare. One of the few examples is the Finite Target Matched Filter, which is an adjustment of the well-known Matched Filter. In this paper, we derive the exact Generalized Likelihood Ratio Test for this model. This new detector can be used both with a local covariance estimation window or a global one. It is shown to outperform the standard target detectors on real data, especially for small covariance estimation windows.

Detecting a target of known spectral signature from an unknown background is one of main goal of hyperspectral imaging. As the majority of hyperspectral imaging systems have a poor spatial resolution, subpixel targets are usual. In this case, the so-called replacement model is commonly advocated. This model, valid for reflectance images, specifies that if a target is present, the amount of background should reduce in the same proportion. Nevertheless, the majority of the standard detectors, such as the Match Filter or the Kelly detector, have been developed for different contexts, and do not exploit this constraint. One of the rare example that is suitable for the replacement model is the Finite Target Match Filter, which is known to improve the target selectivity detection. In this paper, we develop the exact Generalized Likelihood Ratio Test for the model at hand. We show that this new detector outperforms the standard ones, on a real data experiment.

Spacecraft health monitoring from housekeeping telemetry data represents one of the main issues in space operations. Motivated by the success of machine learning or data driven-based methods in many signal and image processing applications, some of these methods have been applied to anomaly detection in housekeeping telemetry via a semi-supervised learning. This paper studies a new multivariate anomaly detection algorithm based on a sparse decomposition on a dictionary of nominal patterns. One originality of the proposed method is a multivariate framework allowing us to take into account possible relationships between different telemetry parameters, in particular through a joint processing of time-series described by mixed continuous and discrete parameters. The proposed method is tested with real satellite telemetry and evaluated on a representative anomaly dataset composed of actual anomalies that occurred on several operated satellites. The first results confirm the interest of the proposed method and demonstrate its competitiveness with respect to the state-of-the-art.

Single-photon lidar devices can acquire 3D data at very long range with high precision. Moreover, recent advances in lidar arrays have enabled acquisitions at very high frame rates. However, these devices place a severe bottleneck on the reconstruction algorithms, which have to handle very large volumes of noisy data. Recently, real-time 3D reconstruction of distributed surfaces has been demonstrated obtaining information at one wavelength. Here, we propose a new algorithm that achieves color 3D reconstruction without increasing the execution time nor the acquisition process of the realtime single-wavelength reconstruction system. The algorithm uses a coded aperture that compresses the data by considering a subset of the wavelengths per pixel. The reconstruction algorithm is based on a plug-and-play denoising framework, which benefits from off-the-shelf point cloud and image de-noisers. Experiments using real lidar data show the competitivity of the proposed method.