Calculating the performance of linear and square-law detectors

A method is presented for calculating the performance of linear and square-law detectors in detection schemes that employ noncoherent integration. The method consists of transforming the coherent characteristic function, which is usually easy to obtain to a noncoherent moment generating function describing the test statistic of a linear or square-law detector. The method provides a single mathematical framework for many signal models (both classical and new) and can be implemented using standard numerical routines. Although the method is not always optimum in terms of computing speed for specific classical models, its common approach for all signal models makes it very efficient in term of learning and implementation times. Classical results as well as results for an extended set of target models consisting of an arbitrary number of constant amplitude random phase returns are presented to demonstrate the technique. It is shown for the signal parameters considered that the performance difference between the linear and square-law detectors is relatively insignificant     

Distributed CFAR detection in homogeneous and nonhomogeneousbackgrounds

The performance of distributed constant false alarm rate (CFAR) detection with data fusion both in homogeneous and nonhomogeneous Gaussian backgrounds is analyzed. The ordered statistics (OS) CFAR detectors are employed as local detectors. With a Swerling type I target model, in the homogeneous background, the global probability of detection for a given fixed global probability of false alarm is maximized by optimizing both the threshold multipliers and the order numbers of the local OS-CFAR detectors. In the nonhomogeneous background with multiple targets or clutter edges, the performance of the detection system is analyzed and its performance is compared with the performance of the distributed cell-averaging (CA) CFAR detection system     

Quickest detection for sequential decentralized decision systems

Quickest detection procedures are techniques used to detect sudden or abrupt changes (also called disorders) in the statistics of a random process. The goal is to determine as soon as possible that the change occurred, while at the same time minimizing the chance of falsely signaling the occurrence of a disorder before the change. In this work the distributed quickest detection problem when the disorder occurs at an unknown time is considered. The distributed local detectors utilize a simple summing device and threshold comparator, with a binary decision at the output. At the fusion center, the optimal maximum likelihood (ML) procedure is analyzed and compared with the more practical Page procedure for quickest detection. It is shown that the two procedures have practically equivalent performance. For the important case of unknown disorder magnitudes, a version of the Hinkley procedure is also examined. Next, a simple method for choosing the thresholds of the local detectors based on an asymptotic performance measure is presented. The problem of selecting the local thresholds usually requires optimizing a constrained set of nonlinear equations; our method admits a separable problem, leading to straightforward calculations. A sensitivity analysis reveals that the resulting threshold settings are optimal for practical purposes. The issue of which sample size to use for the local detectors is investigated, and the tradeoff between decision delay and communication cost is evaluated. For strong signals, it is shown that the relative performance deteriorates as the sample size increases, that is, as the system cost decreases. Surprisingly, for the weak signal case, lowering the system cost (increasing the sample size) does not necessarily result in a degradation of performance     

Optimal Detection and Performance of Distributed Sensor Systems

Global optimization of a distributed sensor detection system withfusion is considered, where the fusion rule and local detectors aresolved to obtain overall optimal performance. This yields coupledequations for the local detectors and the fusion center.The detection performance of the distributed system with fusionis developed. The globally optimal system performance is comparedwith two suboptimal systems. Receiver operating characteristics(ROCs) are computed numerically for the problem of detecting aknown signal embedded in non-Gaussian noise.     

Importance sampling for characterizing STAP detectors

This paper describes the development of adaptive importance sampling (IS) techniques for estimating false alarm probabilities of detectors that use space-time adaptive processing (STAP) algorithms. Fast simulation using IS methods has been notably successful in the study of conventional constant false alarm rate (CFAR) radar detectors, and in several other applications. The principal objectives here are to examine the viability of using these methods for STAP detectors, develop them into powerful analysis and design algorithms and, in the long term, use them for synthesizing novel detection structures. The adaptive matched filter (AMF) detector has been analyzed successfully using fast simulation. Of two biasing methods considered, one is implemented and shown to yield good results. The important problem of detector threshold determination is also addressed, with matching outcome. As an illustration of the power of these methods, two variants of the square-law AMF detector that are thought to be robust under heterogeneous clutter conditions have also been successfully investigated. These are the envelope-law and geometric-mean STAP detectors. Their CFAR property is established and performance evaluated. It turns out the variants have detection performances better than those of the AMF detector for training data contaminated by interferers. In summary, the work reported here paves the way for development of advanced estimation techniques that can facilitate design of powerful and robust detection algorithms     

Detection of Target Maneuver Onset

A classical maneuvering target tracking (MTT) problem (detection of the onset of a target maneuver) is presented in two parts. The first part reviews most traditional maneuver onset detectors and presents results from a comprehensive simulation study and comparison of their performance. Six algorithms for maneuver onset detection are examined: measurement residual chi-square, input estimate chi-square, input estimate significance test, generalized likelihood ratio (GLR), cumulative sum, and marginalized likelihood ratio (MLR) detectors. The second part proposes two novel maneuver onset detectors based on sequential statistical tests. Cumulative sums (CUSUM) type and Shiryayev sequential probability ratio (SSPRT) maneuver onset detectors are developed by using a likelihood marginalization technique to cope with the difficulty that the target maneuver accelerations are unknown. The proposed technique gives explicit solutions for Gaussian-mixture prior distributions, and can be applied to arbitrary prior distributions through Gaussian-mixture approximations. The approach essentially utilizes a~priori information about the maneuver accelerations in typical tracking engagements and thus allows to improve detection performance as compared with traditional maneuver detectors. Simulation results demonstrating the improved capabilities of the proposed onset maneuver detectors are presented.     

Performance analysis of linearly combined order statistic CFARdetectors

Linearly combined order statistic (LCOS) constant false-alarm rate (CFAR) detectors are examined for efficient and robust threshold estimation applied to exponentially distributed background observations for improved detection. Two optimization philosophies have been employed to determine the weighting coefficients of the order statistics. The first method optimizes the coefficients to obtain efficient estimates of clutter referred to the censored maximum likelihood (CML) and best linear unbiased (BLU) CFAR detectors. The second optimization involves maximizing the probability of detection under Swerling II targets and is referred to as the most powerful linear (MPL) CFAR detector. The BLU-CFAR detector assumes no knowledge of the target distribution in contrast to the MPL-CFAR detector which requires partial knowledge of the target distribution. The design of these CFAR detectors and the probability of detection performance are mathematically analyzed for background observations having homogeneous and heterogeneous distributions wherein the trade-offs between robustness and detection performance are illustrated     

Difference beam aided target detection in monopulse radar

The classical detection step in a monopulse radar system is based on the sum beam only,the performance of which is not optimal when target is not at the beam center. Target detection aided by the difference beam can improve the performance at this case. However, the existing difference beam aided target detectors have the problem of performance deterioration at the beam center, which has limited their application in real systems. To solve this problem, two detectors are proposed in this paper. Assuming the monopulse ratio is known, a generalized likelihood ratio test(GLRT) detector is derived, which can be used when targeting information on target direction is available. A practical dual-stage detector is proposed for the case that the monopulse ratio is unknown. Simulation results show that performances of the proposed detectors are superior to that of the classical detector.     

Optimum and mismatched detection against K-distributed plusGaussian clutter

We derive the optimum radar receiver to detect fluctuating and non-fluctuating targets against a disturbance which is modeled as a mixture of coherent K-distributed and Gaussian-distributed clutter. In addition, thermal noise, which is always present in the radar receiver, is considered. We discuss the implementation of the optimum coherent detector, which derives from the likelihood ratio test under the assumption of perfectly known disturbance statistics, and evaluate its performance via a numerical procedure, when possible, and via Monte Carlo simulation otherwise. Moreover, we compare the performance of the optimum detector with those of two detectors which are optimum for totally Gaussian and totally K-distributed clutter respectively, when they are fed with such a mixed disturbance. We conclude that, though the optimum detector has a larger computational cost, it provides sensibly better detection performance than the mismatched detectors in a number of operational situations. Thus, there is a need to derive suboptimum target detectors against the mixture of disturbances which trade-off the detection performance and the implementation complexity     

Multistatic-Radar Binomial Detection

The performance of multistatic-radar binomial detectors is investigated. Although conceptually similar to the well-knwn "M-out-of-N" detector frequently considered for monostatic systems, the multistatic detector must cope with false alarms generated by target et ghosting as well as by noise threshold crossings. A procedure for deriving the detection statistics of multistatic binomial detectors ors is presented. The procedure is applied to derive the detection probabilities for a spectrum of false alarm probabilities, target densities, and numbers of radar receivers.     

Optimum local decision space partitioning for distributed detection

A distributed detection system is considered that consists of a number of independent local detectors and a fusion center. The decision statistics and performance characteristics (i.e. the false alarm probabilities and detection probabilities) of the local detectors are assumed as given. Communication is assumed only between each local detector and the fusion center and is one-way from the former to the latter. The fusion center receives decisions from the local detectors and combines them for a global decision. Instead of a one-bit hard decision, the authors propose that each local detector provides the fusion center with multiple-bit decision value which represents its decision and, conceptually, its degree of confidence on that decision. Generating a multiple-bit local decision entails a subpartitioning of the local decision space the optimization of which is studied. It is shown that the proposed system significantly outperforms one in which each local detector provides only a hard decision. Based on optimum subpartitioning of local decision space, the detection performance is shown to increase monotonically with the number of partitions     

Optimum multisensor fusion of correlated local decisions

A distributed detection system consisting of a number of local detectors and a fusion center is considered. Each detector makes a decision for the underlying binary hypothesis testing problem based on its own observation and transmits its decision to the fusion center where the global decision is derived. The local decision rules are assumed to be given, but the local decisions are correlated. The correlation is generally characterized by a finite number of conditional probabilities. The optimum decision fusion rule in the Neyman-Pearson sense is derived and analyzed. The performance of the distributed detection system versus the degree of correlation between the local decisions is analyzed for a correlation structure that can be indexed by a single parameter. System performance as well as the performance advantage of using a larger number of local detectors degrade as the degree of correlation between local decisions increases     

The Detection Performance of the Siebert and Dicke-Fix CFAR Radar Detectors

The Siebert and the Dicke-fix CFAR radar detectors, used to maintain a constant false alarm rate (CFAR) in radar receivers under very similar circumstances, are considered. The Siebert detector represents the maximum-likelihood detection procedure for a signal in Gaussian noise of unknown power level, whereas the Dicke-fix makes use of a bandpass limiter to normalize the input and thus ensure a constant false alarm rate. The detection performance of the two detectors is determined and a comparison shows that over a wide range of parameters, the Dicke-fix introduces a loss which is approximately 1 B larger than for the Siebert detector.     

Optimal CFAR detection in Weibull clutter

Optimal, in the maximum likelihood sense, constant false-alarm rate (CFAR) detection for Weibull clutter statistics, is investigated. The proposed OW (optimal Weibull) estimator is proved to be an asymptotically efficient estimator of the mean power of the Weibull clutter. Theoretical analysis of the OW-CFAR detector is provided, while detection performance analysis is carried out using the Monte Carlo simulation method. The operation of the median and morphological (MEMO)-CFAR detector in Weibull clutter statistics is also explained. It performs almost optimally in uniform clutter and, simultaneously, it is robust in multitarget situations. The performance of the proposed OW-CFAR detector in uniformal Weibull clutter is used as a yardstick in the analysis of the MEMO cell-averager (CA) and ordered statistic (OS) CFAR detectors. Nonfluctuating and fluctuating (Swerling II) targets are considered in detection analysis. The performance of the detectors is also examined at clutter edges     

Nonparametric rank detectors under K-distributed clutter in radar applications

This correspondence deals with a comparative analysis of parametric detectors versus rank ones for radar applications, under K-distributed clutter and nonfluctuating and Swerling II target models. We show that the locally optimum detectors (LODs) (optimum for very low signal-to-clutter ratio (SCR)) under K-distributed clutter are not practical detectors; on the contrary, asymptotically optimum detectors (optimum for high SCR) are the practical ones. The performance analysis of the parametric log-detector and the nonparametric (linear rank) detector is carried out for independent and identically distributed (IID) clutter samples, correlated clutter samples, and nonhomogeneous clutter samples. Some results of Monte Carlo simulations for detection probability (P/sub d/) versus SCR are presented in curves for different detector parameter values.     

SRS-Net: Training object detectors from scratch for remote sensing images without pretraining

Most of the current object detection algorithms use pretrained models that are trained on ImageNet and then fine-tuned in the network, which can achieve good performance in terms of general object detectors. However, in the field of remote sensing image object detection, as pretrained models are significantly different from remote sensing data, it is meaningful to explore a train-from-scratch technique for remote sensing images. This paper proposes an object detection framework trained from scratch, SRS-Net, and describes the design of a densely connected backbone network to provide integrated hidden layer supervision for the convolution module. Then, two necessary improvement principles are proposed: studying the role of normalization in the network structure, and improving data augmentation methods for remote sensing images. To evaluate the proposed framework, we performed many ablation experiments on the DIOR, DOTA, and AS datasets. The results show that whether using the improved backbone network, the normalization method or training data enhancement strategy, the performance of the object detection network trained from scratch increased. These principles compensate for the lack of pretrained models. Furthermore, we found that SRS-Net could achieve similar to or slightly better performance than baseline methods, and surpassed most advanced general detectors.     

GLRT Detectors for Aircraft Wake Vortices in Clear Air

 In this article, radar echoes of aircraft wake vortices are modeled as weighted sums of the frequency components of the echoes with a special covariance matrix for the weighted coefficients. With a proposed detection scheme, two generalized likelihood ratio test (GLRT) detectors are derived respectively for aircraft wake vortices with time-varying and time-invariant Doppler spectra. Then the analytical expressions for detection and false alarm probabilities of the detectors are derived and three factors are investigated which mainly influence the detection performance, i.e., the Doppler extension and uncertainty of the aircraft wake vortex, and the number of the detection cells. The results indicate that, the signal-to-noise ratio (SNR) loss induced by Doppler extension is generally several decibels. The SNR loss due to Doppler uncertainty is approximately proportional to the logarithm of the number of spectrum lines in the uncertain Doppler spectrum intervals. For a large number of detection cells, the SNR gain is approximately proportional to the square root of the number of the detection cells.     

Adaptive cell-averaging CFAR detection in distributed sensornetworks

The problem of adaptive cell-averaging constant false-alarm rate (CFAR) detection is considered for two distributed sensor network topologies, namely the parallel and the tandem topologies. The compressed data transmitted amongst the detectors is assumed to be in the form of decisions. The overall systems are optimized to yield the maximum probability of detection for a fixed probability of false alarm. The performance of the systems is also analyzed     

Performance of a Two-Sample Mann-Whitney Nonparametric Detector in a Radar Application

The detection of signals in an unknown, typically non-Gaussian noise environment, while attempting to maintain a constant false-alarm rate, is a common problem in radar and sonar. The raw receiver data is commonly processed initially by a bank of frequency filters. The further processing of the outputs from the filter bank by a two-sample Mann-Whitney detector is considered. When the noise statistics in all filters are identical, the Mann-Whitney detector is distribution free, i. e., the false-alarm probability may be prescribed in advance regardless of the precise form of the noise statistics. The primary purpose of this paper is to demonstrate the potential advantage of nonparametric detectors over conventional detectors. The signal detection performance of the Mann-Whitney detector is compared to that of an ordinary linear envelope detector plus integrator in the presence of Gaussian and several hypothetical forms of non-Gaussian noise. This comparison is made for both uniform and nonuniform distributions of noise power across the filter bank. Besides providing a much more constant false-alarm rate than the conventional detector, the Mann-Whitney detector's signal detection performance is found also to be much less sensitive to the form of the noise statistics. In one case, its detection sensitivity is found to be 11 dB better than that of the conventional detector. Even when the noise power density is made moderately nonuniform across the filter bank, the detection performance of the Mann-Whitney detector is found not to be significantly affected.     

Local SNR considerations in decentralized CFAR detection

We consider the decentralized detection problem, involving N sensors and a central processor, in which the sensors transmit unquantized data to the fusion center. Assuming a homogeneous background for constant false-alarm rate (CFAR) analysis, we obtain the performances of the system for the Swerling I and Swerling III target models. We demonstrate that a simple nonparametric fusion rule at the central processor is sufficient for nearly optimum performance. The effect of the local signal-to-noise ratios (SNRs) on the performances of the optimum detector and two suboptimum detectors is also examined. Finally, we obtain a set of conditions, related to the SNRs, under which better performance may be obtained by using decentralized detection as compared with centralized detection