Optical moving target detection with 3-D matched filtering

Three-dimensional (3-D) matched filtering has been suggested as a powerful processing technique for detecting weak, moving optical targets immersed in a background noise field. The procedure requires the processing of entire sequences of frames of optical scenes containing the moving targets. The 3-D processor must be properly matched to the target signature and its velocity vector, but will simultaneously detect all targets to which it is matched. The results of a study to evaluate the 3-D processor are presented. Simulation results are reported which show the ability of the processor to detect targets well below the background level. These results demonstrate the capability and robustness of the processor, and show that the algorithms, although somewhat complicated, can be implemented readily. Some effects on the number of frames processed, target flight scenarios, and velocity and signature mismatch are also presented. The ability to detect multiple targets is demonstrated     

Application of Three-Dimensional Filtering to Moving Target Detection

The standard approach to the detection of a stationary target immersed within an optically observed scene is to use integration to separate the target energy from the background clutter. When the target is nonstationary and moves with fixed velocity relative to the clutter, the procedure for integrating the target signal is no longer obvious. In this paper it is shown that the problem of tracking a target having a fixed velocity can be cast into a general framework of three-dimensional filter theory. From this point of view, the target detection problem reduces to the problem of finding optimal three-dimensional filters in the three-dimensional transform domain and processing the observed scene via this filtering. The design of these filters is presented, taking into account the target, clutter, and optical detection models. Performance is computed for a basic clutter model, showing the effective increase in detectability as a function of the target velocity. The three-dimensional transform approach is readily compatible with VLSI array processing technology.     

A flexible processor for a digital adaptive array radar

A digital beamforming processor for an adaptive array radar is described. The functionality and the architecture of the processor are strongly driven by a goal of achieving adaptive null depths in the 60-dB to 70-dB range, which necessitates substantial preprocessing of each channel. In particular, conversion to baseband quadrature channels is accomplished digitally using a single A/D converter per channel, and FIR (finite impulse response) equalizing filters are employed in each channel to match channel transfer functions. The processor is highly modular, and this not only distributes the total processing load, but also the I/O (input/output) bandwidth requirement. This is accomplished by distributing the adaptive beamforming algorithm systolically across a linear array of processing nodes. The processor is expandable to a different number of channels and sufficiently flexible to be applied to other problems of an array signal processing nature. Experimental data presented demonstrate that the processor is capable of supporting channel-to-channel cancellation of interfering signals to the level of -65 dB     

Efficient multisensor fusion using multidimensional dataassociation

We present the development of a multisensor fusion algorithm using multidimensional data association for multitarget tracking. The work is motivated by a large scale surveillance problem, where observations from multiple asynchronous sensors with time-varying sampling intervals (electronically scanned array (ESA) radars) are used for centralized fusion. The combination of multisensor fusion with multidimensional assignment is done so as to maximize the “time-depth” in addition to “sensor-width” for the number S of lists handled by the assignment algorithm. The standard procedure, which associates measurements from the most recently arrived S-1 frames to established tracks, can have, in the case of S sensors, a time-depth of zero. A new technique, which guarantees maximum effectiveness for an S-dimensional data association (S⩾3), i.e., maximum time-depth (S-1) for each sensor without sacrificing the fusion across sensors, is presented. Using a sliding window technique (of length S), the estimates are updated after each frame of measurements. The algorithm provides a systematic approach to automatic track formation, maintenance, and termination for multitarget tracking using multisensor fusion with multidimensional assignment for data association. Estimation results are presented for simulated data for a large scale air-to-ground target tracking problem     

Discrete extended Kalman filter for radar point error reduction

A recently proposed method of reducing target glint errors in radar systems is further enhanced with the development of a discrete target model and discrete Kalman filter (DKF). Simulation results demonstrating the DKF are presented, and the limits of the usefulness of this method are investigated. The major advantage of the DKF is that it can be implemented in software in the digital processor of the radar offering flexibility over continuous-time filters     

基于多维航迹特征的异常行为检测方法

在信息融合领域,利用数据挖掘中的异常检测技术,可以基于目标的多维航迹特征来挖掘目标的异常行为。现有轨迹异常检测方法主要检测目标的位置异常,没有充分利用目标的属性、类型、位置、速度和航向等多维特征,在挖掘目标的异常行为时具有局限性。通过定义多因素定向Hausdorff距离和构造多维度局部异常因子,提出了一种基于多维航迹特征的异常行为检测方法,通过对多维航迹数据的异常检测,实现对目标异常行为的挖掘。在仿真军事场景和真实的民用场景上进行了实验分析,所提方法都能有效的检测出目标的异常行为。     

Self-calibrating SSR monopulse receiver

An extension of the monopulse technique for estimating the target azimuth in a secondary surveillance radar (SSR) is considered. The idea is to associate in pairs monopulse measurements coming from the amplitude processor (AP) at the dwell time processing level. This allows the automatic compensation of the bias errors due to the misalignments in the receiver channels, thus eliminating the necessity for periodic system calibration. This dual-pulse technique also allows for the practical use of the dot product receiver as a modification of the AP receiver. This, in turn, implies that the variance of each dual-pulse estimate is uniformly maintained at the monopulse maximum-likelihood level over the whole off-boresight angle (OBA) range     

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     

Further results on radar pointing error reduction using discreteextended Kalman filtering

A recently proposed method of reducing target glint errors in radar systems using extended Kalman filtering is further extended with the inclusion of and compensation for clutter effects. A discrete target model and discrete Kalman filter (DKF) are used. Simulation results demonstrating the DKF are presented, and the limits on the effectiveness of the method are investigated. The major advantage of the DKF is that it can be implemented in software in the digital processor of the radar, offering flexibility over continuous time filters. The ability of the filter to reduce clutter effects further demonstrates the usefulness of this technique for radar pointing error reduction     

Noncoherent Detection of Split-Phase FSK by Multiple Predetection Filtering

When the cumulative drift in the center frequency of a binary split-phase FSK signal exceeds the peak deviation of the signal, a conventional noncoherent receiver (i.e., one provided with only two IF filters) may be unable to achieve the probability of error per bit which the designer desires. This limitation may be overcome if the receiver is provided with a bank of more than two contiguous filters (each followed by an envelope detector) tospan the total IF band the instantaneous IF signal might occupy. It is shown that the probability of error per bit for such a receiver is a function of 1) the ratio F of peak frequency deviation to peak frequency drift, 2) the number M of IF filter/detectors, and 3) the signal-to-noise ratio ? in the output of the filter containing the signal. It is further shown thatfor a given value of F an increase in M reduces the amount of transmitter power the communication system designer must provide to yield a given probability of error per bit.     

Asynchronous distributed detection

Binary parallel distributed-detection architectures employ a bank of local detectors to observe a common volume of surveillance, and form binary local decisions about the existence or nonexistence of a target in that volume. The local decisions are transmitted to a central detector, the data fusion center (DEC), which integrates them to a global target or no target decision. Most studies of distributed-detection systems assume that the local detectors are synchronized. In practice local decisions are made asynchronously and the DFC has to update its global decision continually. In this study the number of local decisions observed by the central detector within any observation period is Poisson distributed. An optimal fusion rule is developed and the sufficient statistic is shown to be a weighted sum of the local decisions collected by the DFC within the observation interval. The weights are functions of the individual local detector performance probabilities (i.e., probabilities of false alarm and detection). In this respect the decision rule is similar to the one developed by Chair and Varshney for the synchronized system. Unlike the Chair-Varshney rule, however, the DFC's decision threshold in the asynchronous system is time varying. Exact expressions and asymptotic approximations are developed for the detection performance with the optimal rule. These expressions allow performance prediction and assessment of tradeoffs in realistic decision fusion architectures which operate over modern communication networks     

ATS-6 Spacecraft Attitude Precision Pointing & Slewing Adaptive Control Experiment

The primary objective of the Spacecraft Attitude Precision Pointing and Slewing Adaptive Control (SAPPSAC) Experiment is to establish feasibility and evaluate capabilities of a ground-based spacecraft attitude control system, wherein RF command and telemetry links, together with a ground station on-line minicomputer, perform closed loop attitude control of the Applications Technology Satellite -6 (ATS-6). The ground processor is described, including operational characteristics and the controller software. Attitude maneuvers include precision pointing to fixed targets, slewing between targets, and generation of prescribed ground tracks. Test results show high performance and reliability for over 30 h of on-line control with no serious anomalies. Attitude stabilization relative to a prescribed target has been achieved to better than 0.007° in pitch and roll and 0.020° in yaw for a period of 43 min. Ground tracks were generated which had maximum latitude/longitude deviations less than 0.150 from reference.     

JTIDS relative navigation and data registration

The Joint Tactical Information Distribution System (JTIDS), an integrated communication, navigation, and identification system, provides a solution to the critical data registration problem facing the joint US military services today, namely, the establishment, in real-time, of accurately correlated positions and tracks for all friendly, unknown, and hostile targets in an operational area, thus providing the total situation awareness required for tactical and C² operations. The fundamental relationships of JTIDS navigation and the error analysis for target registration and target hand-off in both geodetic and relative grid coordinates are presented. Simulation results are provided for two scenarios to demonstrate the level of improvement that JTIDS navigation can have on situation awareness, target acquisition, and weapon delivery. Specifically, it is shown that accurate data registration can be achieved by as few as two JTIDS members, with or without accurate knowledge of geodetic position     

Multipath Angle Error Reduction Using Multiple-Target Methods

The usual methods of reducing multipath angle errors in monopulse tracking radar achieve only limited success because they do not attack the root of the problem. A more correct approach is to accept the multipath signal as a second target and utilize a two-target signal processor which angle tracks both wavefronts. The processor will decouple the return signals so that relatively interference-free data on both waves are obtained. In this paper a signal processor for separating signal from (N - 1) multipath components is developed. The processor is then specialized to the case of only one multipath signal and evaluated by a computer simulation. Data show that large improvements are possible as compared to the usual monopulse tracking system. In particular, the usual large bias errors at low elevation angles are eliminated. Tracking precision compares favorably with the theoretically best possible for two-target tracking systems.     

Median cascaded canceller for robust adaptive array processing

A median cascaded canceller (MCC) is introduced as a robust multichannel adaptive array processor. Compared with sample matrix inversion (SMI) methods, it is shown to significantly reduce the deleterious effects of impulsive noise spikes (outliers) on convergence performance of metrics; such as (normalized) output residue power and signal to interference-plus-noise ratio (SINR). For the case of no outliers, the MCC convergence performance remains commensurate with SMI methods for several practical interference scenarios. It is shown that the MCC offers natural protection against desired signal (target) cancellation when weight training data contains strong target components. In addition, results are shown for a high-fidelity, simulated, barrage jamming and nonhomogenous clutter environment. Here the MCC is used in a space-time adaptive processing (STAP) configuration for airborne radar interference mitigation. Results indicate the MCC produces a marked SINR performance improvement over SMI methods.     

Improved target classification using optimum polarimetric SARsignatures

We present a new method for automatic target/object classification by using the optimum polarimetric radar signatures of the targets/objects of interest. The state-of-the-art in radar target recognition is based mostly either on the use of single polarimetric pairs or on the four preset pairs of orthogonal polarimetric signatures. Due to these limitations, polarimetric radar processing has been fruitful only in the area of noise suppression and target detection. The use of target separability criteria for the optimal selection of radar signal state of polarizations is addressed here. The polarization scattering matrix is used for the derivation of target signatures at arbitrary transmit and receive polarization states (arbitrary polarization inclination angles and ellipticity angles). Then, an optimization criterion that minimizes the within-class distance and maximizes the between-class metrics is used for the derivation of optimum sets of polarimetric states. The results of the application of this approach on real synthetic aperture radar (SAR) data of military vehicles are obtained. The results show that noticeable improvements in target separability and consequently target classification can be achieved by the use of the optimum over nonoptimum signatures     

Reiterative median cascaded canceler for robust adaptive array processing

A new robust adaptive processor based on reiterative application of the median cascaded canceler (MCC) is presented and called the reiterative median cascaded canceler (RMCC). It is shown that the RMCC processor is a robust replacement for the sample matrix inversion (SMI) adaptive processor and for its equivalent implementations. The MCC, though a robust adaptive processor, has a convergence rate that is dependent on the rank of the input interference-plus-noise covariance matrix for a given number of adaptive degrees of freedom (DOF), N. In contrast, the RMCC, using identical training data as the MCC, exhibits the highly desirable combination of: 1) convergence-robustness to outliers/targets in adaptive weight training data, like the MCC, and 2) fast convergence performance that is independent of the input interference-plus-noise covariance matrix, unlike the MCC. For a number of representative examples, the RMCC is shown to converge using ~ 2.8N samples for any interference rank value as compared with ~ 2N samples for the SMI algorithm. However, the SMI algorithm requires considerably more samples to converge in the presence of outliers/targets, whereas the RMCC does not. Both simulated data as well as measured airborne radar data from the multichannel airborne radar measurements (MCARM) space-time adaptive processing (STAP) database are used to illustrate performance improvements over SMI methods.     

Adaptive Tracker Field-of-View Variation Via Multiple Model Filtering

Adaptive estimation using multiple model filtering is investigated as a means of changing the field of view as well as the bandwidth of an infrared image tracker when target acceleration can vary over a wide range. The multiple models are created by tuning filters for best performance at differing conditions of exhibited target behavior and differing physical size of their respective fields of view. Probabilistically weighted averaging provides the adaptation mechanism. Each filter involves online identification of the target shape function, so that this algorithm can be used against ill-defined and/or multiple-hot-spot targets. When each individual filter has the form of an enhanced correlator/linear Kalman filter, computational loading is very low. In contrast, an extended Kalman filter processing the raw infrared data directly and assuming a nonlinear constant turn-rate dynamics model provides superior tracking capability, especially for harsh maneuvers, at the cost of a larger computational burden.     

Filtering of moving targets using SBIR sequential frames

In this paper three-dimensional (3-D) finite-impulse response (FIR) filters are proposed for moving target detection and tracking from multiframe space-based infrared (SBIR) data. An optimal, in the l_p sense, 3-D FIR filter design technique is proposed which is suitable for the above application. This technique is the first 3-D FIR design of its kind presented in the open literature. Directional, matched, and adaptive 3-D filtering techniques are proposed. Prior to the filtering, clutter mean estimation and mean subtraction are required. Real time implementation of directional and/or matched filters for processing maneuvering targets is discussed and filter design methods are proposed. Finally, performance comparisons of the proposed and other available 3-D FIR and infinite-impulse response (IIR) filters, on real SBIR data, are presented in which the advantages of the proposed 3-D filters are shown     

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.