Target selection is the task of assigning a value or priority to various targets in a scenario. This priority is usually determined by the threat the target poses on the defender in addition to its vulnerability to po...
详细信息
ISBN:
(纸本)0819444782
Target selection is the task of assigning a value or priority to various targets in a scenario. This priority is usually determined by the threat the target poses on the defender in addition to its vulnerability to possible measures to be taken by the defender. In this study, we describe a target selection technique based on neural networks. The utility or value of each target is assumed to be an unknown function acting on certain features of the target such as size, intensity, speed and direction of movement. Neural networks used in the context of function estimation is a viable candidate for determining this unknown function for generating target priorities. Various. neural network configurations are examined and simulation results are presented.
This paper presents the results of a study of tracking algorithms for maneuvering targets. The design focuses on alternative algorithms to track two-dimensional targets during maneuvers. The algorithms explored includ...
详细信息
ISBN:
(纸本)0819444782
This paper presents the results of a study of tracking algorithms for maneuvering targets. The design focuses on alternative algorithms to track two-dimensional targets during maneuvers. The algorithms explored include a standard Kalman algorithm, an extended Kalman algorithm in which the target turn rate is an additional state variable, an interactive multiple model (IMM) algorithm consisting of two models with varying plant noise, a three-model IMM specifying three distinct target turn rates, and a constant gain alpha-beta filter. The IMM trackers tended to work the best in this study, with the three-model IMM performing the best overall.
The problem of maintaining track on a primary target in the presence spurious objects is addressed. Recursive and batch filtering approaches are developed. For the recursive approach, a Bayesian track splitting filter...
详细信息
ISBN:
(纸本)0819444782
The problem of maintaining track on a primary target in the presence spurious objects is addressed. Recursive and batch filtering approaches are developed. For the recursive approach, a Bayesian track splitting filter is derived which spawns candidate tracks if there is a possibility of measurement misassociation. The filter evaluates the probability of each candidate track being associated with the primary target. The batch filter is a Markov-chain Monte Carlo (MCMC) algorithm which fits the observed data sequence to models of target dynamics and measurement-track association. Simulation results are presented.
The similarity between the multiple-target radar ranging problem and the multi-user detection problem in CDMA is drawn: in CDMA, users' bits modulate distinct but correlated signature signals;while, in radar, the ...
详细信息
ISBN:
(纸本)0819444782
The similarity between the multiple-target radar ranging problem and the multi-user detection problem in CDMA is drawn: in CDMA, users' bits modulate distinct but correlated signature signals;while, in radar, the "bits" are range-bin occupancies and the "signatures" correspond to the known transmitted signal translated to be centered on the appropriate range bin. The analogy is useful: there has been a great deal of recent experience in CDMA, and one of the best and fastest algorithms uses a variant of probabilistic data association (PDA, the target-tracking philosopk). PDA can be augmented by group decision feedback (GDF) - another idea from CDMA - to refine the target delay- estimates;and finally minimum description length (MDL) is applied to estimate the munber of targets. Simulation examples are given to illustrate the resolution of closely-spaced targets within what would normally- be thought the same range bin. Its performance is also compared with the Cramer-Rao lower bound (CRLB) and the alternating projection (AP) algorithm.
In the presence of sea-surface multipath monopulse radar signals from a low elevation target have three alternative paths in addition to the direct (radar-to-target) path due to reflections from the sea surface. The s...
详细信息
ISBN:
(纸本)0819444782
In the presence of sea-surface multipath monopulse radar signals from a low elevation target have three alternative paths in addition to the direct (radar-to-target) path due to reflections from the sea surface. The specular reflection causes significant signal fading. The diffuse reflection causes an approximately constant bias to the in-phase component of the monopulse ratio, which is the standard extractor of the direction of arrival (DOA) in the monopulse processing. The diffuse reflection also causes higher standard deviation to the in-phase component of the monopulse ratio. In this paper we propose a maximum likelihood (ML) angle extraction technique for low elevation targets of known average signal strength having a Rayleigh fluctuation. The results show that this method reduces the error of the estimated angle compared to the conventional monopulse ratio estimator. Subsequently, the ML angle extractor is modified for the unknown average signal strength case. This modified angle extractor has only a small performance degradation compared with the known average signal strength case, but it performs much better than the monopulse ratio based estimator. This angle extractor reduces the root mean square error (RMSE) by more than 50% in the signalprocessing stage when used in a low flying target (sea skimmer) tracking scenario.
The proceedings contain 47 papers from the conference of signal and dataprocessing of smalltargets 2002. Topics discussed include: detection of small IR objects using wavelets;matched subspace detectors and registra...
详细信息
The proceedings contain 47 papers from the conference of signal and dataprocessing of smalltargets 2002. Topics discussed include: detection of small IR objects using wavelets;matched subspace detectors and registration;modeling of aliasing effects for point target detection in undersampled IR imaging systems;target selection using neural networks;radar detection of multiple moving targets in clutter using time-frequency radon transform;and the optimal detector.
Since the time and energy of phased array radars are under great demand in modem combat systems, methods that conserve those resources are very important. Two opportunities for conserving radar resources that have not...
详细信息
ISBN:
(纸本)0819444782
Since the time and energy of phased array radars are under great demand in modem combat systems, methods that conserve those resources are very important. Two opportunities for conserving radar resources that have not been fully exploited when tracking closely-spaced objects with currently deployed systems are revisit time selection (i.e., time to make a measurement) and beam boresight placement. While these two functions are somewhat coupled, this paper addresses only the problem of beam pointing. Previously, a methodology for track management for phased array radars hinged on the concept of organizing tracks into, so called, dwell groups that included closely-spaced targets that could be illuminated with a single beam. Pointing angle for a dwell group was determined using a geometry-based approach. While the geometry-based approach was useful in improving the entire track management function, it was known to be sub-optimal in that the detection characteristics of the targets were not considered. This paper addresses an improved methodology for assigning membership in dwell groups and selecting dwell pointing angles.
Since the early 1990s, significant research has been done on a relatively new algorithm called the Probabilistic MultiHypothesis Tracker (PMHT). The majority of this research has concluded that there are a few weaknes...
详细信息
ISBN:
(纸本)0819444782
Since the early 1990s, significant research has been done on a relatively new algorithm called the Probabilistic MultiHypothesis Tracker (PMHT). The majority of this research has concluded that there are a few weaknesses with this approach to tracking targets in the presence of clutter. First, the number of targets that are being tracked needs to be known a priori. Second, in order for the algorithm to operate properly, a very good initiation must be performed. Without a very close initiation, the PMHT usually fails to "lock on" to the target correctly. To address both of these issues, a hybrid approach is proposed. This hybrid approach will use a Multi-Hypothesis Tracking (MHT) algorithm to initiate new tracks and to continue tracking them until a track is stable. Then it will hand these tracks off to the PMHT to maintain. The MHT is very good at initiating new tracks, and the PMHT is best at maintaining multiple tracks because the algorithm's complexity with tracking additional targets grows linearly as opposed to exponentially'.
A particular method of detecting unresolved targets using simulated monopulse radar data is examined in detail. The system is assumed to be correctly calibrated i.e. the decision boundary is calculated based on the tr...
详细信息
ISBN:
(纸本)0819444782
A particular method of detecting unresolved targets using simulated monopulse radar data is examined in detail. The system is assumed to be correctly calibrated i.e. the decision boundary is calculated based on the true values governing the hypothesis that only a single target is present in the range cell. The system performance is analyzed under varying values for target ranges, angles between the beam pointing direction and the actual off-boresight angle of the targets, waveform power and number of pulses. It is shown that these parameters have a pronounced impact on the Boundary, Metric and Decision Surfaces. The False Alarm probability for a single target as a function of waveform power is considered, as also are the detection probabilities when two targets are present. The important issue of locating the decision point on the Boundary Surface is briefly discussed.
Particle filtering (PF) is a relatively new method to solve the nonlinear filtering problem, which is very general and easy to code. The main issue with PF is the large computational complexity. In particular, for typ...
详细信息
ISBN:
(纸本)0819444782
Particle filtering (PF) is a relatively new method to solve the nonlinear filtering problem, which is very general and easy to code. The main issue with PF is the large computational complexity. In particular, for typical low dimensional tracking problems, the PF requires 2 to 4 orders of magnitude more computer throughput than the EKF, to achieve the same accuracy. It has been asserted that the PF avoids the curse of dimensionality, but there is no formula or theorem that bounds or approximates the computational complexity of the PF as a function of dimension (d). In this paper, we will derive a simple back-of-the-envelope formula that explains why a carefully designed PF should mitigate the curse of dimensionality for typical tracking problems, but that it does not avoid the curse of dimensionality in general. This new theory is related to the fact that the volume of the d dimensional unit sphere is an amazingly small fraction of the d dimensional unit cube, for large d.
暂无评论