29 November 2018 in IEEE Transactions on Signal Processing
This paper explores the problem of change detection in time series of heterogeneous multivariate synthetic aperture radar images. Classical change detection schemes have modelled the data as a realisation of Gaussian random vectors and have derived statistical tests under this assumption. However, when considering high-resolution images, the heterogeneous behaviour of the scatterers is not well described by a Gaussian model. In this paper, the data model is extended to Spherically Invariant Random Vectors where the heterogeneity of the images is accounted for through a deterministic texture parameter. Then three separate detection problems are considered and generalised likelihood ratio test technique is used to derive statistical tests for each problem. The constant false alarm rate property of the new statistics are studied both theoretically and through simulation. Finally, the performance of the new statistics are studied both in simulation and on real synthetic aperture radar data and compared to Gaussian-derived ones. The study yields promising results when the data are heterogeneous.
13 December 2018 in IEEE Signal Processing Letters
26 June 2023 in IEEE Transactions on Geoscience and Remote Sensing
Phase linking is a prominent methodology to estimate coherence and phase difference in interferometric synthetic-aperture radar. This method is driven by a maximum likelihood estimation approach, which allows to fully exploit all the possible interferograms from a time series. Its performance is, however, known to be affected by the accuracy of the covariance matrix estimation step, which usually requires to introduce additional prior information on its structure when there is a small sample support (spatial window). Moreover, most phase linking algorithms are built upon the sample covariance matrix, due to the assumption of an underlying Gaussian distribution. In a scenario where SAR data is high resolution, or when the study area is spatially heterogeneous (e.g., urban area), this assumption can also limit the accuracy of the covariance matrix estimation step. Considering the two aforementioned issues, we introduce alternative statistical models, whose maximum likelihood estimators then yield new phase linking algorithms. In order to be robust to non-Gaussian data, we consider the use of a more general model of scaled mixture of Gaussian. To address small sample support issues, we also generalize this approach to a possibly low-rank structured covariance matrix. A unified algorithm to perform phase linking given these models is then derived and validated by simulations and a real data case (Sentinel-1 data).
26 November 2021 in IEEE Transactions on Signal Processing
This paper studies a statistical model for heteroscedastic ( i.e. , power fluctuating) signals embedded in white Gaussian noise. Using the Riemannian geometry theory, we propose an unified approach to tackle several problems related to this model. The first axis of contribution concerns parameters (signal subspace and power factors) estimation, for which we derive intrinsic Cramér-Rao bounds and propose a flexible Riemannian optimization algorithmic framework in order to compute the maximum likelihood estimator (as well as other cost functions involving the parameters). Interestingly, the obtained bounds are in closed forms and interpretable in terms of problem’s dimensions and SNR. The second axis of contribution concerns the problem of clustering data assuming a mixture of heteroscedastic signals model, for which we generalize the Euclidean K-means++ to the considered Riemannian parameter space. We propose an application of the resulting clustering algorithm on the Indian Pines segmentation problem benchmark.
14 January 2019 in IEEE Transactions on Geoscience and Remote Sensing
High resolution in synthetic aperture radar (SAR) leads to new physical characterizations of scatterers which are anisotropic and dispersive. These behaviors present an interesting source of diversity for target detection schemes. Unfortunately, such characteristics have been integrated and have been naturally lost in monovariate single-look SAR images. Modeling this behavior as nonstationarity, wavelet analysis has been successful in retrieving this information. However, the sharp-edge of the used wavelet functions introduces undesired high side-lobes for the strong scatterers present in the images. In this paper, a new family of parameterized wavelets, designed specifically to reduce those side lobes in the SAR image decomposition, is proposed. Target detection schemes are then explored using this spectro-angular diversity and it can be shown that in high-resolution SAR images, the non-Gaussian and robust framework leads to better results.
1 February 2021 in IEEE Transactions on Signal Processing
This paper proposes an original Riemmanian geometry for low-rank structured elliptical models, i.e., when samples are elliptically distributed with a covariance matrix that has a low-rank plus identity structure. The considered geometry is the one induced by the product of the Stiefel manifold and the manifold of Hermitian positive definite matrices, quotiented by the unitary group. One of the main contribution is to consider an original Riemannian metric, leading to new representations of tangent spaces and geodesics. From this geometry, we derive a new Riemannian optimization framework for robust covariance estimation, which is leveraged to minimize the popular Tyler's cost function on the considered quotient manifold. We also obtain a new divergence function, which is exploited to define a geometrical error measure on the quotient, and the corresponding intrinsic Cramér-Rao lower bound is derived. Thanks to the structure of the chosen parametrization, we further consider the subspace estimation error on the Grassmann manifold and provide its intrinsic Cramér-Rao lower bound. Our theoretical results are illustrated on some numerical experiments, showing the interest of the proposed optimization framework and that performance bounds can be reached.