101 research outputs found

    On Spectral Estimation and Bistatic Clutter Suppression in Radar Systems

    Get PDF
    Target detection serve as one of the primary objectives in a radar system. From observations, contaminated by receiver thermal noise and interference, the processor needs to determine between target absence or target presence in the current measurements. To enable target detection, the observations are filtered by a series of signal processing algorithms. The algorithms aim to extract information used in subsequent calculations from the observations. In this thesis and the appended papers, we investigate two techniques used for radar signal processing; spectral estimation and space-time adaptive processing.\ua0In this thesis, spectral estimation is considered for signals that can be well represented by a parametric model. The considered problem aims to estimate frequency components and their corresponding amplitudes and damping factors from noisy measurements. In a radar system, the problem of gridless angle-Doppler-range estimation can be formulated in this way. The main contribution of our work includes an investigation of the connection between constraints on rank and matrix structure with the accuracy of the estimates.Space-time adaptive processing is a technique used to mitigate the influence of interference and receiver thermal noise in airborne radar systems. To obtain a proper mitigation, an accurate estimate of the space-time covariance matrix in the currently investigated cell under test is required. Such an estimate is based on secondary data from adjacent range bins to the cell under test. In this work, we consider airborne bistatic radar systems. Such systems obtains non-stationary secondary data due to geometry-induced range variations in the angle-Doppler domain. Thus, the secondary data will not follow the same distribution as the observed snapshot in the cell under test. In this work, we present a method which estimates the space-time covariance matrix based upon a parametric model of the current radar scenario. The parameters defining the scenario are derived as a maximum likelihood estimate using the available secondary data. If used in a detector, this approach approximately corresponds to a generalized likelihood ratio test, as unknowns are replaced with their maximum likelihood estimates based on secondary data

    Single data set detection for multistatic doppler radar

    Get PDF
    The aim of this thesis is to develop and analyse single data set (SDS) detection algorithms that can utilise the advantages of widely-spaced (statistical) multiple-input multiple-output (MIMO) radar to increase their accuracy and performance. The algorithms make use of the observations obtained from multiple space-time adaptive processing (STAP) receivers and focus on covariance estimation and inversion to perform target detection. One of the main interferers for a Doppler radar has always been the radar’s own signal being reflected off the surroundings. The reflections of the transmitted waveforms from the ground and other stationary or slowly-moving objects in the background generate observations that can potentially raise false alarms. This creates the problem of searching for a target in both additive white Gaussian noise (AWGN) and highly-correlated (coloured) interference. Traditional STAP deals with the problem by using target-free training data to study this environment and build its characteristic covariance matrix. The data usually comes from range gates neighbouring the cell under test (CUT). In non-homogeneous or non-stationary environments, however, this training data may not reflect the statistics of the CUT accurately, which justifies the need to develop SDS methods for radar detection. The maximum likelihood estimation detector (MLED) and the generalised maximum likelihood estimation detector (GMLED) are two reduced-rank STAP algorithms that eliminate the need for training data when mapping the statistics of the background interference. The work in this thesis is largely based on these two algorithms. The first work derives the optimal maximum likelihood (ML) solution to the target detection problem when the MLED and GMLED are used in a multistatic radar scenario. This application assumes that the spatio-temporal Doppler frequencies produces in the individual bistatic STAP pairs of the MIMO system are ideally synchronised. Therefore the focus is on providing the multistatic outcome to the target detection problem. It is shown that the derived MIMO detectors possess the desirable constant false alarm rate (CFAR) property. Gaussian approximations to the statistics of the multistatic MLED and GMLED are derived in order to provide a more in-depth analysis of the algorithms. The viability of the theoretical models and their approximations are tested against a numerical simulation of the systems. The second work focuses on the synchronisation of the spatio-temporal Doppler frequency data from the individual bistatic STAP pairs in the multistatic MLED scenario. It expands the idea to a form that could be implemented in a practical radar scenario. To reduce the information shared between the bistatic STAP channels, a data compression method is proposed that extracts the significant contributions of the MLED likelihood function before transmission. To perform the inter-channel synchronisation, the Doppler frequency data is projected into the space of potential target velocities where the multistatic likelihood is formed. Based on the expected structure of the velocity likelihood in the presence of a target, a modification to the multistatic MLED is proposed. It is demonstrated through numerical simulations that the proposed modified algorithm performs better than the basic multistatic MLED while having the benefit of reducing the data exchange in the MIMO radar system

    Sparsity based methods for target localization in multi-sensor radar

    Get PDF
    In this dissertation, several sparsity-based methods for ground moving target indicator (GMTI) radar with multiple-input multiple-output (MIMO) random arrays are proposed. MIMO random arrays are large arrays that employ multiple transmitters and receivers, the positions of the transmitters and the receivers are randomly chosen. Since the resolution of the array depends on the size of the array, MIMO random arrays obtain a high resolution. However, since the positions of the sensors are randomly chosen, the array suffers from large sidelobes which may lead to an increased false alarm probability. The number of sensors of a MIMO random array required to maintain a certain level of peak sidelobes is studied. It is shown that the number of sensors scales with the logarithm of the array aperture, in contrast with a ULA where the number of elements scales linearly with the array aperture. The problem of sparse target detection given space-time observations from MIMO random arrays is presented. The observations are obtained in the presence of Gaussian colored noise of unknown covariance matrix, but for which secondary data is available for its estimation. To solve the detection problem two sparsity-based algorithms, the MP-STAP and the MBMP-STAP algorithms are proposed that utilizes knowledge of the upper bound on the number of targets. A constant false alarm rate (CFAR) sparsity based detector that does not utilize any information on the number of targets referred to as MP-CFAR and MBMP-CFAR are also developed. A performance analysis for the new CFAR detector is also derived, the metrics used to describe the performance of the detector are the probability of false alarm and the probability of detection. A grid refinement procedure is also proposed to eliminate the need for a dense grid which would increase the computational complexity significantly. Expressions for the computational complexity of the proposed CFAR detectors are derived. It is shown that the proposed CFAR detectors outperforms the popular adaptive beamformer at a modest increase in computational complexity

    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

    Facing channel calibration issues affecting passive radar DPCA and STAP for GMTI

    Get PDF
    This paper addresses the problem of clutter cancellation for ground moving target indication (GMTI) in multi-channel passive radar on mobile platforms. Specifically, the advantages of a space-time adaptive processing (STAP) approach are presented, compared to a displaced phase centre antenna (DPCA) approach, in the case of an angle-dependent imbalance affecting the receiving channels. The schemes are tested against simulated clutter data. Finally, a space-time GLRT detection scheme is proposed, where steering vector is not specified in the spatial domain, resulting in a non-coherent integration of target echoes across the receiving channels. Such solution offers comparable clutter cancellation capability and is more robust against significant calibration errors compared to a conventional GLRT detector, which suffers from spatial steering vector mismatches

    Adaptive processing with signal contaminated training samples

    Get PDF
    We consider the adaptive beamforming or adaptive detection problem in the case of signal contaminated training samples, i.e., when the latter may contain a signal-like component. Since this results in a significant degradation of the signal to interference and noise ratio at the output of the adaptive filter, we investigate a scheme to jointly detect the contaminated samples and subsequently take this information into account for estimation of the disturbance covariance matrix. Towards this end, a Bayesian model is proposed, parameterized by binary variables indicating the presence/absence of signal-like components in the training samples. These variables, together with the signal amplitudes and the disturbance covariance matrix are jointly estimated using a minimum mean-square error (MMSE) approach. Two strategies are proposed to implement the MMSE estimator. First, a stochastic Markov Chain Monte Carlo method is presented based on Gibbs sampling. Then a computationally more efficient scheme based on variational Bayesian analysis is proposed. Numerical simulations attest to the improvement achieved by this method compared to conventional methods such as diagonal loading. A successful application to real radar data is also presented

    Auto-regressive model based polarimetric adaptive detection scheme part II: Performance assessment under spectral model mismatch

    Get PDF
    This work addresses the problem of target detection in coherent radar systems equipped with multiple polarimetric channels. In “Part I” of this two-part study, a multi-channel auto-regressive model based polarimetric detection scheme has been developed and its performance has been studied against clutter with characteristics exactly matching the adopted parametric model. In this second part of the study, the performance assessment is extended, by means of theoretical and simulated analyses, to include the case of disturbance components with diverse spectral characteristics. Consequently, an appropriate modification is introduced to the detection scheme to make it robust to typical spectral mismatches occurring in practical situations. Finally, the effectiveness of the resulting detection scheme is proved against simulated and experimental data

    Improving Hyperspectral Subpixel Target Detection Using Hybrid Detection Space

    Full text link
    A Hyper-Spectral Image (HSI) has high spectral and low spatial resolution. As a result, most targets exist as subpixels, which pose challenges in target detection. Moreover, limitation of target and background samples always hinders the target detection performance. In this thesis, a hybrid method for subpixel target detection of an HSI using minimal prior knowledge is developed. The Matched Filter (MF) and Adaptive Cosine Estimator (ACE) are two popular algorithms in HSI target detection. They have different advantages in differentiating target from background. In the proposed method, the scores of MF and ACE algorithms are used to construct a hybrid detection space. First, some high abundance target spectra are randomly picked from the scene to perform initial detection to determine the target and background subsets. Then, the reference target spectrum and background covariance matrix are improved iteratively, using the hybrid detection space. As the iterations continue, the reference target spectrum gets closer and closer to the central line that connects the centers of target and background and resulting in noticeable improvement in target detection. Two synthetic datasets and two real datasets are used in the experiments. The results are evaluated based on the mean detection rate, Receiver Operating Characteristic (ROC) curve and observation of the detection results. Compared to traditional MF and ACE algorithms with Reed-Xiaoli Detector (RXD) background covariance matrix estimation, the new method shows much better performance on all four datasets. This method can be applied in environmental monitoring, mineral detection, as well as oceanography and forestry reconnaissance to search for extremely small target distribution in a large scene

    Detection algorithms for spatial data

    Get PDF
    This dissertation addresses the problem of anomaly detection in spatial data. The problem of landmine detection in airborne spatial data is chosen as the specific detection scenario. The first part of the dissertation deals with the development of a fast algorithm for kernel-based non-linear anomaly detection in the airborne spatial data. The original Kernel RX algorithm, proposed by Kwon et al. [2005a], suffers from the problem of high computational complexity, and has seen limited application. With the aim to reduce the computational complexity, a reformulated version of the Kernel RX, termed the Spatially Weighted Kernel RX (SW-KRX), is presented. It is shown that under this reformulation, the detector statistics can be obtained directly as a function of the centered kernel Gram matrix. Subsequently, a methodology for the fast computation of the centered kernel Gram matrix is proposed. The key idea behind the proposed methodology is to decompose the set of image pixels into clusters, and expediting the computations by approximating the effect of each cluster as a whole. The SW-KRX algorithm is implemented for a special case, and comparative results are compiled for the SW-KRX vis-à-vis the RX anomaly detector. In the second part of the dissertation, a detection methodology for buried mine detection is presented. The methodology is based on extraction of color texture information using cross-co-occurrence features. A feature selection methodology based on Bhattacharya coefficients and principal feature analysis is proposed and detection results with different feature-based detectors are presented, to demonstrate the effectiveness of the proposed methodology in the extraction of useful discriminatory information --Abstract, page iii
    corecore