Detectors for Multiomial Input

The binary detection problem is considered. Under an arbitrary noise environment, the input sample space can be transformed into a multinomial vector. Based on observations of this vector, the Neyman-Pearson optimal detector is developed for a known signal. When the signal strength is unknown, the likelihood ratio principle is followed to obtain consistent tests which use the Pearson's chisquare statistic. The resulting detectors are compared to others in terms of asymptotic relative efficiency under some actual noise distributions.     

Structures for radar detection in compound Gaussian clutter

The problem of coherent radar target detection in a background of non-Gaussian clutter modeled by a compound Gaussian distribution is studied here. We show how the likelihood ratio may be recast into an estimator-correlator form that shows that an essential feature of the optimal detector is to compute an optimum estimate of the reciprocal of the unknown random local power level. We then proceed to show that the optimal detector may be recast into yet another form, namely a matched filter compared with a data-dependent threshold. With these reformulations of the optimal detector, the problem of obtaining suboptimal detectors may be systematically studied by either approximating the likelihood ratio directly, utilizing a suboptimal estimate in the estimator-correlator structure or utilizing a suboptimal function to model the data-dependent threshold in the matched filter interpretation. Each of these approaches is studied to obtain suboptimal detectors. The results indicate that for processing small numbers of pulses, a suboptimal detector that utilizes information about the nature of the non-Gaussian clutter can be implemented to obtain quasi-optimal performance. As the number of pulses to be processed increases, a suboptimal detector that does not require information about the specific nature of the non-Gaussian clutter may be implemented to obtain quasi-optimal performance     

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.     

Decision fusion rules in multi-hop wireless sensor networks

The decision fusion problem for a wireless sensor network (WSN) operating in a fading environment is considered. In particular, we develop channel-aware decision fusion rules for resource-constrained WSNs where binary decisions from local sensors may need to be relayed through multi-hop transmission in order to reach a fusion center. Each relay node employs a binary relay scheme whereby the relay output is inferred from the channel impaired observation received from its source node. This estimated binary decision is subsequently transmitted to the next node until it reaches the fusion center. Under a flat fading channel model, we derive the optimum fusion rules at the fusion center for two cases. In the first case, we assume that the fusion center has knowledge of the fading channel gains at all hops. In the second case, we assume a Rayleigh fading model, and derive fusion rules utilizing only the fading channel statistics. We show that likelihood ratio (LR) based optimum decision fusion statistics for both cases reduce to respective simple linear test statistics in the low channel signal-to-noise ratio (SNR) regime. These suboptimum detectors are easy to implement and require little a priori information. Performance evaluation, including a study of the robustness of the fusion statistics with respect to unknown system parameters, is conducted through simulations.     

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     

Decentralized detection over multiple-access channels

We study the decentralized detection problem in a general framework where arbitrary number of quantization levels at the local sensors are allowed, and transmission from the sensors to the fusion center is subject to both noise and interchannel interference. We treat both Bayesian and Neyman-Pearson approaches to the problem, and develop an iterative descent algorithm to design the optimal quantizers and fusion rule. Some numerical examples for both approaches are also presented     

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.     

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.     

Prior-guided GAN-based interactive airplane engine damage image augmentation method

Deep learning-based methods have achieved remarkable success in object detection, but this success requires the availability of a large number of training images. Collecting sufficient training images is difficult in detecting damages of airplane engines. Directly augmenting images by rotation, flipping, and random cropping cannot further improve the generalization ability of existing deep models. We propose an interactive augmentation method for airplane engine damage images using a prior-guide...     

Coherent detection in Laplace noise

The discrete-time detection of a time-varying, additive signal in independent Laplace noise is considered. Previous efforts in this area have been restricted to the constant signal, and identically distributed noise case. Theoretical (closed form) expressions for the false alarm and detection probabilities are developed for both the Neyman-Pearson optimal detector and the classical matched filter detector. Comparisons between the two detectors are made which illustrate the effects of signal-to-noise power ratio and sample size for certain false alarm and detection probability constraints. In view of the fact that the optimal Laplace detector is not UMP, we also investigate the effect of signal amplitude mismatch     

Optimal m-ary data fusion with distributed sensors

An optimal data fusion rule is derived for an m-ary detection problem. Each detector determines a local decision using a local decision rule and transmits the local decision to the fusion center. Considering the reliability of local detectors, local decisions are combined to produce the final decision. In this study, based upon the maximum posterior probability concept, optimal decision rules for m-ary detection problems are proposed for the local detector and the data fusion center     

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     

Two-step optimal estimator for three dimensional target tracking

This study presents an adaptation of a novel estimation methodology to the general nonlinear three-dimensional problem of tracking a maneuvering target. The two-step optimal estimator (TSE) suggests an attractive alternative to the standard extended Kalman filter (EKF). A superior performance is accomplished by dividing the estimation problem into two steps: a linear first step and a nonlinear second step. The target tracking performance of the TSE is shown to be better than an EKF implemented in either inertial or modified spherical coordinates. In the passive case, where bearing/elevation angles only are measured, the TSE yields excellent range and target acceleration estimates. In the active case, where range measurement is available as well, a homing missile employing closed-loop optimal guidance based on the TSE state estimates obtains smaller miss distances than with either versions of the EKF.     

Optimal distributed decision fusion

The problem of decision fusion in distributed sensor systems is considered. Distributed sensors pass their decisions about the same hypothesis to a fusion center that combines them into a final decision. Assuming that the sensor decisions are independent of each other for each hypothesis, the authors provide a general proof that the optimal decision scheme that maximizes the probability of detection at the fusion for fixed false alarm probability consists of a Neyman-Pearson test (or a randomized N-P test) at the fusion and likelihood-ratio tests at the sensors     

Asymptotic Performance of Sparse Signal Detection Using Convex Programming Method

The detection of sparse signals against background noise is considered. Detecting signals of such kind is difficult since only a small portion of the signal carries information. Prior knowledge is usually assumed to ease detection. In this paper, we consider the general unknown and arbitrary sparse signal detection problem when no prior knowledge is available. Under a Neyman-Pearson hypothesis-testing framework, a new detection scheme is proposed by combining a generalized likelihood ratio test (GLRT)-like test statistic and convex programming methods which directly exploit sparsity in an underdetermined system of linear equations. We characterize large sample behavior of the proposed method by analyzing its asymptotic performance. Specifically, we give the condition for the Chernoff-consistent detection which shows that the proposed method is very sensitive to the 2 norm energy of the sparse signals. Both the false alarm rate and the miss rate tend to zero at vanishing signal-to-noise ratio (SNR), as long as the signal energy grows at least logarithmically with the problem dimension. Next we give a large deviation analysis to characterize the error exponent for the Neyman-Pearson detection. We derive the oracle error exponent assuming signal knowledge. Then we explicitly derive the error exponent of the proposed scheme and compare it with the oracle exponent. We complement our study with numerical experiments, showing that the proposed method performs in the vicinity of the likelihood ratio test (LRT) method in the finite sample scenario and the error probability degrades exponentially with the number of observations.     

Optimal Decision Fusion in Multiple Sensor Systems

The problem of optimal data fusion in the sense of the Neyman-pearson (N-P) test in a centralized fusion center is considered. The fusion center receives data from various distributed sensors. Each sensor implements a N-P test individually and independently of the other sensors. Due to limitations in channel capacity, the sensors transmit their decision instead of raw data. In addition to their decisions, the sensors may transmit one or more bits of quality information. The optimal, in the N-P sense, decision scheme at the fusion center is derived and it is seen that an improvement in the performance of the system beyond that of the most reliable sensor is feasible, even without quality information, for a system of three or more sensors. If quality information bits are also available at the fusion center, the performance of the distributed decision scheme is comparable to that of the centralized N-P test. Several examples are provided and an algorithm for adjusting the threshold level at the fusion center is provided.     

缺损平板贴补加强后的效果

 本文在N.I.Muskhelishvili关于无限大板受集中力作用问题一般表达式的基础上,导出了用于保角变换的一般表达式。应用一般表达式,并取级数前几项作为变换关系式,获得了几个典型情况的封闭解,利用这些封闭解分析了胶贴的效果。     

Joint sensor registration and track-to-track fusion for distributed trackers

Sensor registration deals with the correction of registration errors and is an inherent problem in all multisensor tracking systems. Traditionally, it is viewed as a least squares or a maximum likelihood problem independent of the fusion problem. We formulate it as a Bayesian estimation problem where sensor registration and track-to-track fusion are treated as joint problems and provide solutions in cases 1) when sensor outputs (i.e., raw data) are available, and 2) when tracker outputs (i.e., tracks) are available. The solution to the latter problem is of particular significance in practical systems as band limited communication links render the transmission of raw data impractical and most of the practical fusion systems have to depend on tracker outputs rather than sensor outputs for fusion. We then show that, under linear Gaussian assumptions, the Bayesian approach leads to a registration solution based on equivalent measurements generated by geographically separated radar trackers. In addition, we show that equivalent measurements are a very effective way of handling sensor registration problem in clutter. Simulation results show that the proposed algorithm adequately estimates the biases, and the resulting central-level trucks are free of registration errors.     

A noncoherent adaptive detection technique

An adaptive detection technique suitable for both stationary and nonstationary noise environments based upon a generalized likelihood ratio test (GLRT) formulation is presented. The detector, which is statistically equivalent to a special form of the Wilks's lambda test, noncoherently combines the information contained in a pulse train of arbitrary length for decision-making purposes. The probability density function of the test under the noise only hypothesis is shown to be central χ². Under the signal plus noise hypothesis, an exact statistical characterization of the test cannot be obtained, and, therefore, a Chernoff bound is derived. Results in terms of the probability of detection versus signal-to-noise ratio (SNR) obtained from Monte Carlo simulation, the Chernoff bound, and the optimal matched filter case are examined. The performance of the noncoherent detector is shown to be a function of the covariance matrix estimate and the number of data samples     

Surrogate role of machine learning in motor-drive optimization for more-electric aircraft applications

Motor drives form an essential part of the electric compressors, pumps, braking and actuation systems in the More-Electric Aircraft (MEA). In this paper, the application of Machine Learning (ML) in motor-drive design and optimization process is investigated. The general idea of using ML is to train surrogate models for the optimization. This training process is based on sample data collected from detailed simulation or experiment of motor drives. However, the Surrogate Role (SR) of ML may vary for different applications. This paper first introduces the principles of ML and then proposes two SRs (direct mapping approach and correction approach) of the ML in a motor-drive optimization process. Two different cases are given for the method comparison and validation of ML SRs. The first case is using the sample data from experiments to train the ML surrogate models. For the second case, the joint-simulation data is utilized for a multi-objective motor-drive optimization problem. It is found that both surrogate roles of ML can provide a good mapping model for the cases and in the second case, three feasible design schemes of ML are proposed and validated for the two SRs. Regarding the time consumption in optimizaiton, the proposed ML models can give one motor-drive design point up to 0.044 s while it takes more than 1.5 mins for the used simulation-based models.