757 research outputs found

    MAXIMUM LIKELIHOOD ESTIMATION OF CLUTTER SUBSPACE IN NON HOMOGENEOUS NOISE CONTEXT

    No full text
    International audienceIn the context of a disturbance composed of a Low Rank (LR) clutter plus a white Gaussian noise, the corresponding LR filters used to detect a target embedded in this disturbance needs less training vectors than classical methods to reach equivalent performance. Unlike the classical one which is based on covariance matrix of the noise, the LR filter is based on the clutter subspace projector. In this paper, we propose a new estimator of the clutter subspace projector for a disturbance composed of a LR Spherically Invariant Random Vectors (SIRV) plus a zero mean white Gaussian noise that does not require prior information on the SIRV's texture. Numerical simulations validate the introduced estimator, and its performance and robustness are tested on a Space Time Adaptive Processing (STAP) simulation

    MAXIMUM LIKELIHOOD ESTIMATION OF CLUTTER SUBSPACE IN NON HOMOGENEOUS NOISE CONTEXT

    Get PDF
    International audienceIn the context of a disturbance composed of a Low Rank (LR) clutter plus a white Gaussian noise, the corresponding LR filters used to detect a target embedded in this disturbance needs less training vectors than classical methods to reach equivalent performance. Unlike the classical one which is based on covariance matrix of the noise, the LR filter is based on the clutter subspace projector. In this paper, we propose a new estimator of the clutter subspace projector for a disturbance composed of a LR Spherically Invariant Random Vectors (SIRV) plus a zero mean white Gaussian noise that does not require prior information on the SIRV's texture. Numerical simulations validate the introduced estimator, and its performance and robustness are tested on a Space Time Adaptive Processing (STAP) simulation

    The adaptive coherence estimator is the generalized likelihood ratio test for a class of heterogeneous environments

    Get PDF
    The adaptive coherence estimator (ACE) is known to be the generalized likelihood ratio test (GLRT) in partially homogeneous environments, i.e., when the covariance matrix Ms of the secondary data is proportional to the covariance matrix Mp of the vector under test (or Ms = gamma/Mp). In this letter, we show that ACE is indeed the GLRT for a broader class of nonhomogeneous environments, more precisely when Ms is a random matrix, with inverse complex Wishart prior distribution whose mean only is proportional to Mp. Furthermore, we prove that, for this class of heterogeneous environments, the ACE detector satisfies the constant false alarm rate (CFAR) property with respect to gamma and Mp

    A bayesian approach to adaptive detection in nonhomogeneous environments

    Get PDF
    We consider the adaptive detection of a signal of interest embedded in colored noise, when the environment is nonhomogeneous, i.e., when the training samples used for adaptation do not share the same covariance matrix as the vector under test. A Bayesian framework is proposed where the covariance matrices of the primary and the secondary data are assumed to be random, with some appropriate joint distribution. The prior distributions of these matrices require a rough knowledge about the environment. This provides a flexible, yet simple, knowledge-aided model where the degree of nonhomogeneity can be tuned through some scalar variables. Within this framework, an approximate generalized likelihood ratio test is formulated. Accordingly, two Bayesian versions of the adaptive matched filter are presented, where the conventional maximum likelihood estimate of the primary data covariance matrix is replaced either by its minimum mean-square error estimate or by its maximum a posteriori estimate. Two detectors require generating samples distributed according to the joint posterior distribution of primary and secondary data covariance matrices. This is achieved through the use of a Gibbs sampling strategy. Numerical simulations illustrate the performances of these detectors, and compare them with those of the conventional adaptive matched filter

    Robust estimation of the clutter subspace for a Low Rank heterogeneous noise under high Clutter to Noise Ratio assumption

    Get PDF
    International audienceIn the context of an heterogeneous disturbance with a Low Rank (LR) structure (called clutter), one may use the LR approximation for filtering and detection process. These methods are based on the projector onto the clutter subspace instead of the noise covariance matrix. In such context, adaptive LR schemes have been shown to require less secondary data to reach equivalent performances as classical ones. The main problem is then the estimation of the clutter subspace instead of the noise covariance matrix itself. Maximum Likelihood estimator (MLE) of the clutter subspace has been recently studied for a noise composed of a LR Spherically Invariant Random Vector (SIRV) plus a white Gaussian Noise (WGN). This paper focuses on environments with a high Clutter to Noise Ratio (CNR). An original MLE of the clutter subspace is proposed in this context. A cross-interpretation of this new result and previous ones is provided. Validity and interest - in terms of performance and robustness - of the different approaches are illustrated through simulation results

    Numerical performances of low rank stap based on different heterogeneous clutter subspace estimators

    Get PDF
    International audienceSpace time Adaptive Processing (STAP) for airborne RADAR fits the context of a disturbance composed of a Low Rank (LR) clutter, here modeled by a Compound Gaussian (CG) process, plus a white Gaussian noise (WGN). In such context, the corresponding LR adaptive filters used to detect a target require less training vectors than classical methods to reach equivalent performance. Unlike the classical filter which is based on the Covariance Matrix (CM) of the noise, the LR filter is based on the clutter subspace projector, which is usually derived from a Singular Value Decomposition (SVD) of a noise CM estimate. Regarding to the considered model of LR-CG plus WGN, recent results are providing both direct estimators of the clutter subspace [1][2] and an exact MLE of the noise CM [3]. To promote the use of these new estimation methods, this paper proposes to apply them to realistic STAP simulations

    Asymptotic properties of robust complex covariance matrix estimates

    Full text link
    In many statistical signal processing applications, the estimation of nuisance parameters and parameters of interest is strongly linked to the resulting performance. Generally, these applications deal with complex data. This paper focuses on covariance matrix estimation problems in non-Gaussian environments and particularly, the M-estimators in the context of elliptical distributions. Firstly, this paper extends to the complex case the results of Tyler in [1]. More precisely, the asymptotic distribution of these estimators as well as the asymptotic distribution of any homogeneous function of degree 0 of the M-estimates are derived. On the other hand, we show the improvement of such results on two applications: DOA (directions of arrival) estimation using the MUSIC (MUltiple SIgnal Classification) algorithm and adaptive radar detection based on the ANMF (Adaptive Normalized Matched Filter) test

    Unit Circle Roots Based Sensor Array Signal Processing

    Get PDF
    As technology continues to rapidly evolve, the presence of sensor arrays and the algorithms processing the data they generate take an ever-increasing role in modern human life. From remote sensing to wireless communications, the importance of sensor signal processing cannot be understated. Capon\u27s pioneering work on minimum variance distortionless response (MVDR) beamforming forms the basis of many modern sensor array signal processing (SASP) algorithms. In 2004, Steinhardt and Guerci proved that the roots of the polynomial corresponding to the optimal MVDR beamformer must lie on the unit circle, but this result was limited to only the MVDR. This dissertation contains a new proof of the unit circle roots property which generalizes to other SASP algorithms. Motivated by this result, a unit circle roots constrained (UCRC) framework for SASP is established and includes MVDR as well as single-input single-output (SISO) and distributed multiple-input multiple-output (MIMO) radar moving target detection. Through extensive simulation examples, it will be shown that the UCRC-based SASP algorithms achieve higher output gains and detection probabilities than their non-UCRC counterparts. Additional robustness to signal contamination and limited secondary data will be shown for the UCRC-based beamforming and target detection applications, respectively

    CFAR property and robustness of the lowrank adaptive normalized matched filters detectors in low rank compound gaussian context

    Get PDF
    International audienceIn the context of an heterogeneous disturbance with a Low Rank (LR) structure (referred to as clutter), one may use the LR approximation for detection process. Indeed, in such context, adaptive LR schemes have been shown to require less secondary data to reach equivalent performances as classical ones. The LR approximation consists on cancelling the clutter rather than whitening the whole noise. The main problem is then the estimation of the clutter subspace instead of the noise covariance matrix itself. Maximum Likelihood estimators (MLE), under different hypothesis [1][2][3], of the clutter subspace have been recently proposed for a noise composed of a LR Compound Gaussian (CG) clutter plus a white Gaussian Noise (WGN). This paper focuses on the performances of the LR Adaptive Normalized Matched Filter (LR-ANMF) detector based on these different clutter subspace estimators. Numerical simulations illustrate its CFAR property and robustness to outliers

    Covariance matrix estimation with heterogeneous samples

    Get PDF
    We consider the problem of estimating the covariance matrix Mp of an observation vector, using heterogeneous training samples, i.e., samples whose covariance matrices are not exactly Mp. More precisely, we assume that the training samples can be clustered into K groups, each one containing Lk, snapshots sharing the same covariance matrix Mk. Furthermore, a Bayesian approach is proposed in which the matrices Mk. are assumed to be random with some prior distribution. We consider two different assumptions for Mp. In a fully Bayesian framework, Mp is assumed to be random with a given prior distribution. Under this assumption, we derive the minimum mean-square error (MMSE) estimator of Mp which is implemented using a Gibbs-sampling strategy. Moreover, a simpler scheme based on a weighted sample covariance matrix (SCM) is also considered. The weights minimizing the mean square error (MSE) of the estimated covariance matrix are derived. Furthermore, we consider estimators based on colored or diagonal loading of the weighted SCM, and we determine theoretically the optimal level of loading. Finally, in order to relax the a priori assumptions about the covariance matrix Mp, the second part of the paper assumes that this matrix is deterministic and derives its maximum-likelihood estimator. Numerical simulations are presented to illustrate the performance of the different estimation schemes
    • 

    corecore