Fast estimation of false alarm probabilities of STAP detectors - the AMF

This paper describes an attempt to harness the power of adaptive importance sampling techniques for estimating false alarm probabilities of detectors that use space-time adaptive processing. Fast simulation using these techniques have been notably successful in the study of conventional constant false alarm rate radar detectors, and in several other applications. The principal task here is to examine the viability of using importance sampling methods for STAP detection. Though a modest beginning, the adaptive matched filter detection algorithm is analysed successfully using fast simulation. Of the two biasing methods considered, one is implemented and shown to yield excellent results. The important problem of detector threshold determination is also addressed, with matching outcome. The work reported here serves to pave the way to development of more advanced estimation techniques that can facilitate design of powerful and robust detection algorithms designed to counter hostile and heterogeneous clutter environments

Efficient Approach for OS-CFAR 2D Technique Using Distributive Histograms and Breakdown Point Optimal Concept applied to Acoustic Images

In this work, a new approach to improve the algorithmic efficiency of the Order Statistic-Constant False Alarm Rate (OS-CFAR) applied in two dimensions (2D) is presented. OS-CFAR is widely used in radar technology for detecting moving objects as well as in sonar technology for the relevant areas of segmentation and multi-target detection on the seafloor. OS-CFAR rank orders the samples obtained from a sliding window around a test cell to select a representative sample that is used to calculate an adaptive detection threshold maintaining a false alarm probability. Then, the test cell is evaluated to determine the presence or absence of a target based on the calculated threshold. The rank orders allows that OS-CFAR technique to be more robust in multi-target situations and less sensitive than other methods to the presence of the speckle noise, but requires higher computational effort. This is the bottleneck of the technique. Consequently, the contribution of this work is to improve the OS-CFAR 2D with the distributive histograms and the optimal breakdown point optimal concept, mainly from the standpoint of efficient computation. In this way, the OS-CFAR 2D on-line computation was improved, by means of speeding up the samples sorting problem through the improvement in the calculus of the statistics order. The theoretical algorithm analysis is presented to demonstrate the improvement of this approach. Also, this novel efficient OS-CFAR 2D was contrasted experimentally on acoustic images.Fil: Villar, Sebastian Aldo. Universidad Nacional del Centro de la Provincia de Buenos Aires. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires. - Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires. - Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires; Argentina. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ingeniería Olavarría. Departamento de Electromecánica. Grupo INTELYMEC; ArgentinaFil: Menna, Bruno Victorio. Universidad Nacional del Centro de la Provincia de Buenos Aires. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires. - Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires. - Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires; Argentina. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ingeniería Olavarría. Departamento de Electromecánica. Grupo INTELYMEC; ArgentinaFil: Torcida, Sebastián. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ciencias Exactas. Departamento de Matemática; ArgentinaFil: Acosta, Gerardo Gabriel. Universidad Nacional del Centro de la Provincia de Buenos Aires. Facultad de Ingeniería Olavarría. Departamento de Electromecánica. Grupo INTELYMEC; Argentina. Universidad Nacional del Centro de la Provincia de Buenos Aires. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires. - Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires. - Provincia de Buenos Aires. Gobernación. Comisión de Investigaciones Científicas. Centro de Investigaciones en Física e Ingeniería del Centro de la Provincia de Buenos Aires; Argentin

Reduced-Rank STAP Schemes for Airborne Radar Based on Switched Joint Interpolation, Decimation and Filtering Algorithm

In this paper, we propose a reduced-rank space-time adaptive processing (STAP) technique for airborne phased array radar applications. The proposed STAP method performs dimensionality reduction by using a reduced-rank switched joint interpolation, decimation and filtering algorithm (RR-SJIDF). In this scheme, a multiple-processing-branch (MPB) framework, which contains a set of jointly optimized interpolation, decimation and filtering units, is proposed to adaptively process the observations and suppress jammers and clutter. The output is switched to the branch with the best performance according to the minimum variance criterion. In order to design the decimation unit, we present an optimal decimation scheme and a low-complexity decimation scheme. We also develop two adaptive implementations for the proposed scheme, one based on a recursive least squares (RLS) algorithm and the other on a constrained conjugate gradient (CCG) algorithm. The proposed adaptive algorithms are tested with simulated radar data. The simulation results show that the proposed RR-SJIDF STAP schemes with both the RLS and the CCG algorithms converge at a very fast speed and provide a considerable SINR improvement over the state-of-the-art reduced-rank schemes

Automatic and semi-automatic extraction of curvilinear features from SAR images

Extraction of curvilinear features from synthetic aperture radar (SAR) images is important for automatic recognition of various targets, such as fences, surrounding the buildings. The bright pixels which constitute curvilinear features in SAR images are usually disrupted and also degraded by high amount of speckle noise which makes extraction of such curvilinear features very difficult. In this paper an approach for the extraction of curvilinear features from SAR images is presented. The proposed approach is based on searching the curvilinear features as an optimum unidirectional path crossing over the vertices of the features determined after a despeckling operation. The proposed method can be used in a semi-automatic mode if the user supplies the starting vertex or in an automatic mode otherwise. In the semi-automatic mode, the proposed method produces reasonably accurate real-time solutions for SAR images

Neural Network-Based Multi-Target Detection within Correlated Heavy-Tailed Clutter

This work addresses the problem of range-Doppler multiple target detection in a radar system in the presence of slow-time correlated and heavy-tailed distributed clutter. Conventional target detection algorithms assume Gaussian-distributed clutter, but their performance is significantly degraded in the presence of correlated heavy-tailed distributed clutter. Derivation of optimal detection algorithms with heavy-tailed distributed clutter is analytically intractable. Furthermore, the clutter distribution is frequently unknown. This work proposes a deep learning-based approach for multiple target detection in the range-Doppler domain. The proposed approach is based on a unified NN model to process the time-domain radar signal for a variety of signal-to-clutter-plus-noise ratios (SCNRs) and clutter distributions, simplifying the detector architecture and the neural network training procedure. The performance of the proposed approach is evaluated in various experiments using recorded radar echoes, and via simulations, it is shown that the proposed method outperforms the conventional cell-averaging constant false-alarm rate (CA-CFAR), the ordered-statistic CFAR (OS-CFAR), and the adaptive normalized matched-filter (ANMF) detectors in terms of probability of detection in the majority of tested SCNRs and clutter scenarios.Comment: Accepted to IEEE Transactions on Aerospace and Electronic System

Constant False Alarm Rate Target Detection in Synthetic Aperture Radar Imagery

Target detection plays a significant role in many synthetic aperture radar (SAR) applications, ranging from surveillance of military tanks and enemy territories to crop monitoring in agricultural uses. Detection of targets faces two major problems namely, first, how to remotely acquire high resolution images of targets, second, how to efficiently extract information regarding features of clutter-embedded targets. The first problem is addressed by the use of high penetration radar like synthetic aperture radar. The second problem is tackled by efficient algorithms for accurate and fast detection. So far, there are many methods of target detection for SAR imagery available such as CFAR, generalized likelihood ratio test (GLRT) method, multiscale autoregressive method, wavelet transform based method etc. The CFAR method has been extensively used because of its attractive features like simple computation and fast detection of targets. The CFAR algorithm incorporates precise statistical description of background clutter which determines how accurately target detection is achieved. The primary goal of this project is to investigate the statistical distribution of SAR background clutter from homogeneous and heterogeneous ground areas and analyze suitability of statistical distributions mathematically modelled for SAR clutter. The threshold has to be accurately computed based on statistical distribution so as to efficiently distinguish target from SAR clutter. Several distributions such as lognormal, Weibull, K, KK, G0, generalized Gamma (GGD) distributions are considered for clutter amplitude modeling in SAR images. The CFAR detection algorithm based on appropriate background clutter distribution is applied to moving and stationary target acquisition and recognition (MSTAR) images. The experimental results show that, CFAR detector based on GGD outmatches CFAR detectors based on lognormal, Weibull, K, KK, G0 distributions in terms of accuracy and computation time.