Abstract:This paper deals with the problem of clustering data returned by a radar sensor network that monitors a region where multiple moving targets are present. The network is formed by nodes with limited functionalities that transmit the estimates of target positions (after a detection) to a fusion center without any association between measurements and targets. To solve the problem at hand, we resort to model-based learning algorithms and instead of applying the plain maximum likelihood approach, due to the related computational requirements, we exploit the latent variable model coupled with the expectation-maximization algorithm. The devised estimation procedure returns posterior probabilities that are used to cluster the huge amount of data collected by the fusion center. Remarkably, we also consider challenging scenarios with an unknown number of targets and estimate it by means of the model order selection rules. The clustering performance of the proposed strategy is compared to that of conventional data-driven methods over synthetic data. The numerical examples point out that the herein proposed solutions can provide reliable clustering performance overcoming the considered competitors.
Abstract:In this paper, we address the problem of classifying data within the radar reference window in terms of statistical properties. Specifically, we partition these data into statistically homogeneous subsets by identifying possible clutter power variations with respect to the cells under test (accounting for possible range-spread targets) and/or clutter edges. To this end, we consider different situations of practical interest and formulate the classification problem as multiple hypothesis tests comprising several models for the operating scenario. Then, we solve the hypothesis testing problems by resorting to suitable approximations of the model order selection rules due to the intractable mathematics associated with the maximum likelihood estimation of some parameters. Remarkably, the classification results provided by the proposed architectures represent an advanced clutter map since, besides the estimation of the clutter parameters, they contain a clustering of the range bins in terms of homogeneous subsets. In fact, such information can drive the conventional detectors towards more reliable estimates of the clutter covariance matrix according to the position of the cells under test. The performance analysis confirms that the conceived architectures represent a viable means to recognize the scenario wherein the radar is operating at least for the considered simulation parameters.
Abstract:Hyperspectral target detection is a task of primary importance in remote sensing since it allows identification, location, and discrimination of target features. To this end, the reflectance maps, which contain the spectral signatures and related abundances of the materials in the observed scene, are often used. However, due to the low spatial resolution of most hyperspectral sensors, targets occupy a fraction of the pixel and, hence, the spectra of different sub-pixel targets (including the background spectrum) are mixed together within the same pixel. To solve this issue, in this paper, we adopt a generalized replacement model accounting for multiple sub-pixel target spectra and formulate the detection problem at hand as a binary hypothesis test where under the alternative hypothesis the target is modeled in terms of a linear combination of endmembers whose coefficients also account for the presence of the background. Then, we devise detection architectures based upon the generalized likelihood ratio test where the unknown parameters are suitably estimated through procedures inspired by the maximum likelihood approach. The performances of the proposed decision schemes are evaluated by means of both synthetic as well as real data and compared with an analogous counterpart by showing the effectiveness of the proposed procedure.
Abstract:The joint adaptive detection of multiple point-like targets in scenarios characterized by different clutter types is still an open problem in the radar community. In this paper, we provide a solution to this problem by devising detection architectures capable of classifying the range bins according to their clutter properties and detecting possible multiple targets whose positions and number are unknown. Remarkably, the information provided by the proposed architectures makes the system aware of the surrounding environment and can be exploited to enhance the entire detection and estimation performance of the system. At the design stage, we assume three different signal models and apply the latent variable model in conjunction with estimation procedures based upon the expectation-maximization algorithm. In addition, for some models, the maximization step cannot be computed in closed-form (at least to the best of authors' knowledge) and, hence, suitable approximations are pursued, whereas, in other cases, the maximization is exact. The performance of the proposed architectures is assessed over synthetic data and shows that they can be effective in heterogeneous scenarios providing an initial snapshot of the radar operating scenario.
Abstract:This paper is devoted to the performance analysis of the detectors proposed in the companion paper where a comprehensive design framework is presented for the adaptive detection of subspace signals. The framework addresses four variations on subspace detection: the subspace may be known or known only by its dimension; consecutive visits to the subspace may be unconstrained or they may be constrained by a prior probability distribution. In this paper, Monte Carlo simulations are used to compare the generalized likelihood ratio (GLR) detectors derived in [1] with estimate-and-plug (EP) approximations of the GLR detectors. Remarkably, the EP approximations appear here for the first time (at least to the best of the authors' knowledge). The numerical examples indicate that GLR detectors are effective for the detection of partially-known signals affected by inherent uncertainties due to the system or the operating environment. In particular, if the signal subspace is known, GLR detectors tend to outperform EP detectors. If, instead, the signal subspace is known only by its dimension, the performance of GLR and EP detectors is very similar.
Abstract:This letter deals with the problem of clutter edge detection and localization in training data. To this end, the problem is formulated as a binary hypothesis test assuming that the ranks of the clutter covariance matrix are known, and adaptive architectures are designed based on the generalized likelihood ratio test to decide whether the training data within a sliding window contains a homogeneous set or two heterogeneous subsets. In the design stage, we utilize four different covariance matrix structures (i.e., Hermitian, persymmetric, symmetric, and centrosymmetric) to exploit the a priori information. Then, for the case of unknown ranks, the architectures are extended by devising a preliminary estimation stage resorting to the model order selection rules. Numerical examples based on both synthetic and real data highlight that the proposed solutions possess superior detection and localization performance with respect to the competitors that do not use any a priori information.
Abstract:In this letter, a new approach for the retrieval of the vertical column concentrations of trace gases from hyperspectral satellite observations, is proposed. The main idea is to perform a linear spectral unmixing by estimating the abundances of trace gases spectral signatures in each mixed pixel collected by an imaging spectrometer in the ultraviolet region. To this aim, the sparse nature of the measurements is brought to light and the compressive sensing paradigm is applied to estimate the concentrations of the gases' endemembers given by an a priori wide spectral library, including reference cross sections measured at different temperatures and pressures at the same time. The proposed approach has been experimentally assessed using both simulated and real hyperspectral dataset. Specifically, the experimental analysis relies on the retrieval of sulfur dioxide during volcanic emissions using data collected by the TROPOspheric Monitoring Instrument. To validate the procedure, we also compare the obtained results with the sulfur dioxide total column product based on the differential optical absorption spectroscopy technique and the retrieved concentrations estimated using the blind source separation.
Abstract:In this paper, we propose a new solution for the detection problem of a coherent target in heterogeneous environments. Specifically, we first assume that clutter returns from different range bins share the same covariance structure but different power levels. This model meets the experimental evidence related to non-Gaussian and non-homogeneous scenarios. Then, unlike existing solutions that are based upon estimate and plug methods, we propose an approximation of the generalized likelihood ratio test where the maximizers of the likelihoods are obtained through an alternating estimation procedure. Remarkably, we also prove that such estimation procedure leads to an architecture possessing the constant false alarm rate (CFAR) when a specific initialization is used. The performance analysis, carried out on simulated as well as measured data and in comparison with suitable well-known competitors, highlights that the proposed architecture can overcome the CFAR competitors and exhibits a limited loss with respect to the other non-CFAR detectors.
Abstract:This paper addresses the problem of detecting multidimensional subspace signals, which model range-spread targets, in noise of unknown covariance. It is assumed that a primary channel of measurements, possibly consisting of signal plus noise, is augmented with a secondary channel of measurements containing only noise. The noises in these two channels share a common covariance matrix, up to a scale, which may be known or unknown. The signal model is a subspace model with variations: the subspace may be known or known only by its dimension; consecutive visits to the subspace may be unconstrained or they may be constrained by a prior distribution. As a consequence, there are four general classes of detectors and, within each class, there is a detector for the case where the scale between the primary and secondary channels is known, and for the case where this scale is unknown. The generalized likelihood ratio (GLR) based detectors derived in this paper, when organized with previously published GLR detectors, comprise a unified theory of adaptive subspace detection from primary and secondary channels of measurements.
Abstract:This paper addresses the challenge of classifying polarimetric SAR images by leveraging the peculiar characteristics of the polarimetric covariance matrix (PCM). To this end, a general framework to solve a multiple hypothesis test is introduced with the aim to detect and classify contextual spatial variations in polarimetric SAR images. Specifically, under the null hypothesis, only an unknown structure is assumed for data belonging to a 2-dimensional spatial sliding window, whereas under each alternative hypothesis, data are partitioned into subsets sharing different structures. The problem of partition estimation is solved by resorting to hidden random variables representative of covariance structure classes and the expectation-maximization algorithm. The effectiveness of the proposed detection strategies is demonstrated on both simulated and real polarimetric SAR data also in comparison with existing classification algorithms.