# Patent

## Title
Classification system for radar and sonar applications

## Abstract

A system and method for target classification for an aircraft surveillance radar is provided. In one implementation, the track classifier provides tracks with an updated probability value based on its likelihood to conform to aircraft and non-aircraft target behavior. The track classifier identifies false tracks that may arise from weather and biological targets, and can detect aircrafts lacking Secondary Surveillance Radar (SSR) data. Various features and combinations of features are evaluated using a proposed clustering performance index (CPI) and used to discriminate between aircrafts and false tracks.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This application claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Patent Application No. 60/669,874, entitled “CLASSIFICATION SYSTEM FOR RADAR AND SONAR APPLICATIONS,” filed on Apr. 11, 2005


FIELD OF THE INVENTION
The invention relates to a radar or sonar system. More particularly, the invention relates to a classifier for classifying targets detected by the radar and sonar systems.
BACKGROUND OF THE INVENTION
A Digital Airport Surveillance System (DASR) system consists of two electronic subsystems; namely a Primary Surveillance Radar (PSR) and a Secondary Surveillance Radar (SSR). The PSR typically includes a continually rotating antenna mounted on a tower to transmit electromagnetic waves that reflect or backscatter from the surface of a target typically up to a radial distance of 60 nmi. The PSR also provides data on six levels of rainfall intensity. The SSR typically includes a second radar antenna attached to the top of the PSR to transmit and receive area aircraft data for barometric altitude, identification code, and emergency conditions. The air traffic control uses this system to verify the location of an aircraft within a typical radial distance of 120-nmi from the radar site.
In the tracking stage, data received from the PSR and SSR are combined based on the proximity of range and azimuth values of targets detected by the PSR and SSR. To meet the combination criteria which determines whether or not targets are combined, the range and azimuth differences of corresponding targets detected by the two sensors are calculated. If each parameter difference is within certain predefined limits, the targets are combined.
Additional tests on speed and heading are performed to resolve ambiguity in potential PSR/SSR target pairs. This is accomplished by examining speed and heading differences for the ambiguous targets to determine if the ambiguous targets should be combined. SSR data typically takes precedence over PSR data. The SSR range and azimuth values are used in a combined report unless the preferred radar is set to the PSR.
There are several issues with the DASR system. These issues include a requirement to remove erroneous tracks related to weather-related, anomalous propagation (AP) and ground clutters plots. Another requirement is to increase the air traffic security and safety level by identifying small or non-cooperative aircrafts without SSR data either due to the lack of a transponder, or by the accidental or deliberate disablement of the transponder. Another requirement is to identify bird, insects, and other biological tracks to avoid biological hazards to commercial and military aircrafts. Another requirement to increase air traffic safety by identifying tracks from helicopters, Unmanned Aerial Vehicles (UAV), etc.
Identifying biological and weather tracks and detecting aircrafts without SSR data are the most important and demanding challenges in the above items. Relying on the presence of SSR data for aircraft detection can impose serious risks to air traffic security and safety since the SSR system relies solely on transmission from onboard transponders to identify aircraft. Accordingly, only by correctly classifying non-transponder transmitting targets, can the presence of unknown aircraft be reported.
The increase in erroneous tracks due to weather clutter can also severely affect the radar performance in aircraft detection in adverse weather conditions. Tracks and echoes from objects such as buildings and hills may also appear on the radar display. Other examples of ground clutter include vehicles and windmills. This ground clutter generally appears within a radius of 20 nautical miles (nmi) of the radar as a roughly circular region with a random pattern. The AP phenomenon is another source of false tracks. These tracks occur under highly stable atmospheric conditions (typically on calm, clear nights), where the radar beam is refracted almost directly into the ground at some distance from the radar, resulting in an area of intense-looking echoes. Examples include certain sites situated at low elevations on coastlines that regularly detect sea return, a phenomenon similar to ground clutter except that the echoes come from ocean waves.
For biological targets such as birds, the impact is more serious. Echoes from migrating birds regularly appear during night-time hours between late February and late May, and again from August through early November. Return from insects is sometimes apparent during July and August. The apparent intensity and aerial coverage of these features is partly dependent on radio propagation conditions, but they usually appear within 30 nmi of the radar and for weather radar produce reflectivities of less than 30 dBZ.
The existence of birds in the vicinity of airport runways and flight paths present serious hazards to air traffic, particularly during the take-off, climb and landing approach when the loss of one or more engines can jeopardize flight safety. Birds are a worldwide problem in aviation. The danger and costs involved in biological strikes to aircrafts are enormous. Approximately 3000 wildlife strike incidents occur yearly to military aircraft and over 2200 wildlife strikes on civilian aircrafts in the US alone. Notably, the bird problem received greater emphasis in the US following the crash of an Airborne Warning and Control System (AWACS) aircraft in November 1995.
The images of bird echoes can completely fill all radar bins. Bird tracks, especially in coastal environments, can form a substantial proportion of the track population of a radar picture. The number of birds close to coastal roost sites can range from 10,000 to 1,000,000 birds, with similar densities possible within well-vegetated non-coastal areas. At peak migration periods, the number of airborne birds can reach 1,000,000 within a 50 km radius with many of these birds travelling in flocks.
Current airport surveillance radars, such as the ASR-9, intentionally reject bird tracks as unwanted clutter. Having known that birds typically fly much slower than aircrafts, changing the “velocity editor” is one method of eliminating bird tracks. However, it has been shown that this technique also removes primary targets with airspeeds below the set threshold, including helicopters and small non-transponder aircrafts. For this reason, a robust classifier with the ability to correctly identify different classes of targets is needed.
SUMMARY OF THE INVENTION
The system and method described herein is directed toward a classifier for classifying targets detected by radar and sonar systems. An exemplary embodiment of a classification system is given for Digital Airport Surveillance Radar for discriminating between aircrafts and non-aircrafts targets. This classification may be generalized to an m-class classification system in which sub-classes may be defined for each of the main aircraft and non-aircraft classes.
In one aspect, at least one embodiment of the invention provides a classifier for classifying a given radar track segment obtained from a radar system. The radar system has a primary surveillance radar for providing primary radar data and a secondary surveillance radar for providing secondary radar data. The classifier comprises a pre-processing stage, the preprocessing stage forms the given radar track segment and generates principal data based on the primary radar data or a combination of secondary and primary radar data, and extension data based on the primary radar data; a feature extraction stage connected to the pre-processing stage, the feature extraction stage processes at least one of the primary and secondary radar data associated with the given radar track segment to provide a plurality of feature values; a classification stage connected to the feature extraction stage, the classification stage generates a principal classification result and an extension classification result for the given radar track segment based on at least a portion of the feature values; or the classification stage generates a combined classification result for combined principal and extension feature values; and, a combiner stage connected to the classification stage, the combiner stage combines the extension and principal classification results to provide a classification result for the given radar track segment when the classification stage provides the principal and extension classification results.
In another aspect, at least one embodiment of the invention provides a method for classifying a given radar track segment obtained from a radar system. The radar system has a primary surveillance radar for providing primary radar data and a secondary surveillance radar for providing secondary radar data. The method comprises:
a) forming the given radar track segment and generating principal data based on the primary and secondary radar data, and extension data based on the primary radar data;
b) processing at least one of the primary and secondary radar data associated with the given radar track segment and a portion of a previous associated radar track segment to provide a plurality of feature values;
c) generating either a principal classification result and an extension classification result or a combined classification result for combined principal and extension feature values for the given radar track segment based on at least a portion of the feature values; and,
d) combining the extension and principal classification results to provide a classification result for the given radar track segment when the principal and extension classification results are generated.



BRIEF DESCRIPTION OF THE DRAWINGS
The file of this patent contains at least one drawing executed in color. Copies of this patent with color drawing(s) will be provided by the Patent and Trademark Office upon request and payment of the necessary fee. For a better understanding of the invention and to show more clearly how it may be carried into effect, reference will now be made, by way of example only, to the accompanying drawings which show at least one exemplary embodiment of the invention and in which:
FIG. 1 is a block diagram of an exemplary embodiment of a radar system;
FIG. 2 is a block diagram of an exemplary embodiment of a trained track classifier, in accordance with the invention, that is used in the radar system of FIG. 1;
FIGS. 3a and 3b show two examples of different types of track segmentation that may be preformed by a pre-processing stage of the track classifier of FIG. 2;
FIGS. 4a and 4b show two examples of different types of feature value segmentation that may be preformed by a feature processing stages of the track classifier of FIG. 2;
FIGS. 5a and 5b show several CPI plots based on exponential and linear models respectively;
FIG. 6 shows a maximal separating hyperplane (solid line) used in a Support Vector Machine showing a distance (d) to each class and margin with the support vectors shaded for linearly separable data;
FIG. 7 shows a flow diagram of a training process that may be used for training the classifier of FIG. 2;
FIGS. 8a and 8b are plots of the distribution of aircraft track lengths and non-aircraft track lengths, respectively, for an exemplary dataset;
FIGS. 9a, 9b and 9c are graphs of recognition rate as a function of track length for parameter configuration group 1;
FIGS. 10a, 10b and 10c are graphs of recognition rate as a function of track length for parameter configuration group 2;
FIGS. 11a, 11b and 11c are graphs of recognition rate as a function of track length for parameter configuration group 3;
FIGS. 12a, 12b and 12c are graphs of recognition rate as a function of track length for parameter configuration group 4;
FIG. 13 is a graph showing sample target tracks for aircraft and non-aircraft tracks (x's) along with best-fit polynomial segments (solid lines);
FIGS. 14a and 14b show a series of plots for sample aircraft track segments and sample non-aircraft track segments, respectively, with track plots marked with x's and best-fit polynomial segments shown with solid lines;
FIGS. 15a and 15b show normalized histograms of the var_path feature (f1) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 16a and 16b show normalized histograms of the var_delpth feature (f2) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 17a and 17b show normalized histograms of the var_delsl feature (f3) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 18a and 18b show normalized histograms of the avg_path feature (f4) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 19a and 19b show normalized histograms of the var_delpth feature (f5) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 20a and 20b show normalized histograms of the avg_delsl feature (f6) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 21a and 21b show normalized histograms of the var_del2spd feature (f7) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 22a and 22b show normalized histograms of the var_delspd feature (f8) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 23a and 23b show normalized histograms of the sum_dist feature (f9) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 24a and 24b show normalized histograms of the avg_del2spd feature (f10) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 25a and 25b show normalized histograms of the avg_delspd feature (f11) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 26a and 26b show normalized histograms of the avg_spd feature (f12) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 27a and 27b show normalized histograms of the avg_scan feature (f13) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 28a and 28b show normalized histograms of the avg_mg feature (f14) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 29a and 29b show normalized histograms of the avg_ma feature (f15) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 30a and 30b show normalized histograms of the avg_pa (f16) feature for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 31a and 31b show normalized histograms of the avg_pa-ma feature (f17) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 32a and 32b show normalized histograms of the avg_dts feature (f18) for datasets one and three respectively with the solid red, and outlined blue histograms representing the aircraft and non-aircraft classes respectively;
FIGS. 33a and 33b show normalized histograms of the var_spd feature (f8) versus the var_delpth feature (f2) for datasets one and three respectively;
FIGS. 34a and 34b show normalized histograms of the avg_spd feature (f8) versus the avg_ma feature (f14) for datasets one and three respectively;
FIGS. 35a and 35b show normalized histograms of the avg_spd feature (f8) versus the sum_dist feature (f5) for datasets one and three respectively;
FIGS. 36a and 36b show normalized histograms of the avg_mg feature (f9) versus the avg_dts feature (f16) for datasets one and three respectively;
FIGS. 37a and 37b shows a Feature plot of the avg_spd feature (f8) versus the avg_ma feature (f14) and var_path feature (f1) for datasets one and three respectively;
FIG. 38 shows a plot of CPI2 values for various individual features;
FIG. 39 shows a plot of CPI2 values for various combinations of features;
FIG. 40 shows a plot of CPI2 values for various feature sets;
FIG. 41 shows PSR-solo tracks for dataset one;
FIG. 42 shows PSR-solo tracks for dataset two;
FIG. 43 shows PSR-solo tracks for dataset three;
FIG. 44 shows PSR-solo tracks for dataset four;
FIGS. 45a, 45b, and 45c show normalized histograms of correct recognition rates for data configuration 1, data configuration 2, data configuration 3, and data configuration 4 respectively;
FIG. 46 shows classification results for a subset of input tracks for data configuration 1;
FIG. 47 shows classification results for a subset of input tracks for data configuration 2;
FIG. 48 shows classification results for a subset of input tracks for data configuration 3; and,
FIGS. 49a, 49b, and 49c show misclassified aircraft and non-aircraft tracks for data configuration 1, data configuration 2, and data configuration 3 respectively.



DETAILED DESCRIPTION OF THE INVENTION
It will be appreciated that numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those of ordinary skill in the art that the invention may be practiced without these specific details. In other instances, well-known methods, procedures and components have not been described in detail so as not to obscure the invention.
One aspect of the invention provides for a real time automatic system for target classification using Support Vector Machines (SVM). Support Vector Machines find decision planes that define decision boundaries. A decision boundary is between a set of objects having different class memberships. Support Vector Machines are one example of learning techniques that can be used in the invention to perform classification of tasks by non-linearly mapping the n-dimensional input space into a high dimensional feature space. In this high dimensional feature space a linear classifier may be used. The feature set that is used affects the success of the classifier. The invention provides different feature sets that can be used for target classification in a DASR and a method to combine the features to generate a clustering performance index (CPI) that is used to evaluate feature combinations. In general, the classifier can work with trajectory and speed related features, i.e. the classifier can be applied to any track data that includes the position and speed of targets. The proposed classification technique of the invention has been implemented on a typical desktop PC and has the ability of doing real time classification of unlabeled input data.
Referring now to FIG. 1, shown therein is a block diagram of an exemplary embodiment of a radar system 10. The radar system 10 includes hardware associated with a PSR 12, and hardware that is associated with an SSR 14 which are both connected to a radar data processor 16. A detector 18, a plot extractor 20, a track generator 22, a classifier 24 and an output device 26 are connected downstream of the radar data processor 16 as shown. There may be some variations in this configuration. For instance, the classifier 24 may be additionally, or optionally, connected to at least one of the detector 18 and the plot extractor 20 to classify detected targets. This allows target classification to be done at various stages of target tracking; including during or after detection, plot extraction or track formation. It should be understood that transmission components (not shown) are also part of the radar system 10 as is commonly known to those skilled in the art.
The radar data processor 16 performs data processing on the data provided by the PSR 12 and the SSR 14 to provide radar data which typically is some combination of range, azimuth and Doppler data. The data processing includes conventional signal processing operations such as filtering to filter extraneous unwanted signals in the radar data and heterodyning to demodulate the filtered data from the RF band to an IF band where analog to digital conversion occurs. The radar data is then demodulated to the baseband where low-pass filtering and downsampling occurs. The pre-processed radar is complex (i.e. has real and imaginary components) and each of the signal processing components required to perform the above-mentioned operations are implemented to handle complex data. The pre-processed data may also be subjected to matched filtering. Alternatively, some spectral estimation may be employed by the radar data processor 16 so that radar signatures from clutter, or other interference, will not obscure radar signatures from targets. All of these techniques are known to those skilled in the art.
The detector 18 then locates candidate targets from noise and clutter from the range, doppler and beam information that is generated from the pre-processed radar data. The range information is used to provide an estimate of the target's distance from the receiving radar antenna. The beam information is used to provide an estimate of the angle of the target's location, and the doppler information is used to provide an estimate of the target's radial instantaneous velocity by measuring the target's doppler shift. The target's doppler shift is related to the change in frequency content of the EM pulse that is reflected by the target with respect to the original frequency content of that EM pulse.
The plot extractor 20 receives and combines the candidate targets to form plots through a process known as plot extraction. The plot extractor 20 filters the candidate targets to reject all of those candidate targets that do not conform to the range, doppler and beam properties that are expected for a true target. Detection and plot extraction rely on information from a single scan of the radar.
The track generator 22 receives the plots and generates tracks by accounting for the temporal information of a sequence of radar scans. More specifically, the track generator analyzes a sequence of radar scans and associates successive detections of a candidate target to form a track for the candidate target. Accordingly, the track generator 22 determines the movement of the candidate targets through a given surveillance area.
The classifier 24 receives the tracks generated by the track generator 22 and analyzes the tracks by measuring values for certain features of the tracks in order to classify the tracks as belonging to an aircraft, a school of birds, ground and weather clutter or other environmental interference. Another classifier may be trained to particular aircraft or non-aircraft targets and applied to the output of the classifier 24 to extract particular targets from aircraft or non-aircraft outputs. For instance, the non-aircraft class can be expanded to include birds, windmills, AP, etc. The aircraft class can be expanded to include helicopters, UAV, light aircrafts, etc. Alternatively, the classifier 24 may be trained to identify each of these sub-classes of the aircraft and non-aircraft classes. Target classification can be performed at a single stage, or alternatively data from multiple stages can be combined to produce a multi-source classifier. For instance, the classifier 24 may be used to simplify the output of the track generator 22 by examining plot data and candidate track data to perform pruning to remove datasets that are not of interest. An exemplary implementation of single-source target classification is described in more detail below.
One aspect of the invention is the provision of different types of feature extraction in order to obtain a diverse set of features that emphasize distinctiveness of the tracks. This is accomplished by extracting a set of features from the reported radar tracks taking advantage of the available temporal information inherit in tracks, and performing classification on extracted features using a supervised learning technique, for example. One example of such a supervised learning technique is a Support Vector Machine (SVM) which is described in further detail below. However, other types of supervised learning techniques can be used as well as other types of classifiers such as nearest neighbor, kernel-based discriminant analysis (LDA), kernel-based principal component analysis (PCA), etc.
The output device 26 receives the classified tracks from the classifier 24 and uses the information provided by the classifier 24 to discriminate aircraft tracks from initiated non-aircraft tracks to avoid displaying unwanted tracks, and/or to detect probable aircraft not transmitting SSR data. The output device 26 may be a computer monitor, a printer or some other suitable device as is well known to those skilled in the art.
Referring now to FIG. 2, shown therein is a block diagram of an exemplary embodiment of the classifier 24 in accordance with the invention. The classifier 24 includes a pre-processing stage 52, a feature extraction stage 54, an extension feature classifier path 56 and a principal feature extension path 58. The extension feature classifier path 56 includes an extension feature processing stage 60, and an extension classifier stage 62. The principal feature classifier path 58 includes a principal feature processing stage 64 and a principal classifier stage 66. The classifier 24 also includes a combiner stage 68 that combines the results of the extension feature classifier path 56 and the principal feature extension path 58.
In practice, tracks that contain data only from the PSR 12 are classified since the presence of SSR data indicates that the track belongs to an aircraft. Thus, all tracks that need to be classified have corresponding principal and extension data. As such, in one implementation, the two paths 56 and 58 may be combined into a single classification stage that operates on the output of the feature extraction stage 54 which is higher dimensional input data (i.e. the sum of the dimensions of the principal and extension input features). However, if a more detailed classification of an aircraft track is required, because one desires to know the type of aircraft that is associated with a given track, then the SSR data can be further classified and processed.
The pre-processing stage 52 receives raw radar track data generated by the track generator 22 and separates the raw radar track data into two types of data for an ASR; namely principal track data, and extension track data. Principal track data contains data obtained from at least one of the PSR 12 and the SSR 14, whereas extension track data contains data only from the PSR 12. Thus, only targets (aircraft and non-aircraft) detected by the PSR 12 can possess extension data. These targets will also have principal data components along with those aircrafts with track data obtained from the SSR 14 (i.e. not detected by the PSR 12). In other words, raw track data obtained from data provided by the PSR 12 can be used to provide principal track data and extension track data and may be an aircraft or non-aircraft target. Raw track data obtained from the SSR 14 may be used to provide principal track data only and may be an aircraft only. Accordingly, two separate classification stages or pathways 56 and 58 and the combiner stage 68 are preferably used in one implementation of the invention in order to utilize the breadth of data that is available especially when one desires to know the type of aircraft associated with a track that has been classified as being an aircraft.
The radar data processor 16 combines the SSR and PSR data to provide better accuracy for the principal data if both are available for a given track. However, this may not be guaranteed for the entire radar track since for some parts of the radar track there may not be any SSR data or even PSR data in some cases. However, many missed sequential detections will result in the radar track being split into two. In any event, the classifier 24 accepts the principal data without considering whether the data is PSR, SSR or combined PSR-SSR data.
The classification of unlabelled tracks is achieved segment-wise and in chronological order for a given track. Further classification results for a previous segment of a given track are used in the classification of the current segment of the given track. Accordingly, for a given track segment t, features are extracted and the principal and extension classifier stages 66 and 62 provide data that can be combined together with the classification result from the previous track segment t−1 at the combiner stage 68 to provide a classification result. The classification result for the current track segment t is then used in the classification of the next track segment t+1. Accordingly, the pre-processing stage 52 segments the raw track data for principal and extension radar data to provide a plurality of track segments for a given radar track.
The presence of SSR data for a given track segment t categorizes the target that is associated with this track as being an aircraft, thus eliminating the need to perform further classification during operation unless one wishes to know the type of aircraft associated with the track. However, in general, the SSR data is used to train the classifier 24 for aircraft targets. Accordingly, the pre-processing stage 52 may be connected directly to the combiner stage 68 as shown in the exemplary embodiment of FIG. 2.
In operation, feature extraction is preformed on the current track segment t by the feature extraction stage 54. Feature extraction includes calculating values for features as described in more detail below. The feature processing stages 60 and 64 then create extension and principal feature vectors based on the feature extraction values and process the extension and principal feature vectors. In one implementation, a whitening transformation may be applied to the principal and extension feature vectors based on predetermined parameters. Classification is then performed by the extension and principal classifier stages 62 and 66 respectively. In one implementation, classification is preferably performed by trained SVMs. The classification results for the current track segment t can be then aggregated and combined with the classification results from the previous track segment t−1, if it exists, in the combiner stage 68.
The pre-processor stage 52 segments the raw track data for further processing by the downstream stages of the classifier 24. Since, in this exemplary implementation, the classifier 24 processes tracks chronologically, the radar scan count may be used to chronologically order and timestamp plots. This later allows for variations in plot data to be calculated and used as features for classification. This introduces an issue not previously encountered in plot classification which is variable length data. To address the issue with variable length data, statistical means and variances may be used in various stages of the classifier 24 to capture information pertaining to fixed-length, possibly overlapping segments of a track, with classification being performed segment-wise and combined. In one implementation, combination may be based on a weighted majority-voting scheme.
Referring now to FIGS. 3a and 3b, shown therein are two examples of different types of track segmentation that may be preformed by the pre-processing stage 52. Each segment has been derived from n plots or radar scans with each subsequent segment overlapping the previous segment by kov plots. FIG. 3a shows a sample segment configuration with n=7 and kov=2. When kov=1, each segment begins with the last plot of the previous segment as illustrated in FIG. 3b with n=5.
To determine the characteristics of the features that should be used in the classifier to improve performance, the characteristics of elements that should be tracked as well as those that should not be tracked can be considered. Biological strikes are responsible for a number of air disasters and account for between 100-500 million dollars of annual damage in the US alone. Among biological strikes, 97% of strikes are due to birds and less than 3% are attributed to sources such as insects. The vast majority of birds fly below 6500 feet in altitude, however there are many examples of flocks of swan and geese that have been observed at altitudes of up to 30,000 feet, with the highest recorded bird altitude at 37,000 feet. These facts would support the occurrence of 96% of biological strikes at altitudes below 5000 ft. The major areas for bird strikes to civilian aircraft are in the vicinity of airport takeoff, climb, landing approach, and landing roll zones.
The kinematics characteristics of birds are often similar to those of some aircrafts. However, there are some distinctive features, such as greater variation in bird track directions with wind, suggesting partial drift or pseudo-drift of bird tracks in comparison to aircraft tracks. This is more evident for migrant birds as they follow a zigzag course of thermal drift in response to atmospheric conditions and subsequently glide to compensate for drift and to conserve energy. Another distinctive feature is related to bird flight speed that varies to a maximum of 43 m/s depending upon the size and shape of the bird, its activity such as migration, and the effects of wind. This maximum speed is less than the airspeed of a typical aircraft.
The aircraft beacon in ASR may be used along with radar data to discriminate between birds and aircraft targets. However, this is inapplicable when the aircraft lacks a transponder or it has accidentally or intentionally been turned off.
Researchers working on the Next Generation Weather Radar (NEXRAD) have identified features specific to bird data and other features specific to weather data. These features may be used to correctly identify and eliminate false tracks originating from severe weather conditions as well as bird tracks, while maintaining aircraft tracks.
For weather data, NEXRAD reports the presence of weather, only when there exists echoes aloft as well as in scans at the lowest elevation. For bird data, many features have been explored and it has been shown that biological targets do not conform to the model of water droplets. The returned power reduction for water droplets is approximately r−2 with range, whereas birds conform to individual point targets with a power loss factor of r−4. However, this does not extend well for flocks of birds which can mimic a volume scatter when they are clustered in large concentration near a roosting site. In addition, it is observed that the size of bird tracks may increase significantly by time, but the center of divergence remains the same. Bird echoes often exhibit an asymmetric reflectivity distribution, however strong environmental winds or strong updrafts or downdrafts would tend to skew the reflectivity distribution. The co-location of the maximum reflectivity and velocity is indicative of bird tracks. Another feature that may be used to distinguish birds from weather is the existence of maximum reflectivity within the first few range gates of the signature. Generally speaking, the reflectivity and velocity images of bird echoes do not completely fill all of the radar bins (they exhibits a graininess) while weather generates an echo region which is more widespread than birds.
Other features that may be useful include the degree of stipple in reflectivity, velocity, and spectral width of bird and weather data. The stipple is a measure of variability based on differentiating the expected slope from the actual slope between minimum and maximum values along a patch of an echo. It has been observed that the stipple degree is generally greater in biological targets than in weather for non-migrating birds. This is due to the fact that the velocity returns from weather typically exhibit more variability, while the velocity distribution from a bird echo is composed of similar values based on the flight speed for migratory birds.
The weather data recorded by a DASR may also be discriminated from aircraft and bird data based on differences in signal amplitude between the high and low elevation beams. The typical DASR's 3.5 degree offset between broad-elevation fan beams can provide a sufficient degree of altitude resolution to allow discrimination of aircraft and low-altitude biological targets from more vertically distributed targets such as weather. This fact has not been experimentally explored since simultaneous parallel access to both beams has not yet become operational. It is also possible to identify airplane and bird targets obscured by weather returns by switching from linear to circular polarization The PSR 12 has two beams: a high beam and a low beam. Relative amplitude information from the two beams may be used as a good feature to discriminate between targets of interest. For example, ground clutter typically appears on the low beam and aircrafts typically appear in the high beam. However, birds also appear in the high beam and weather-based clutter appears in both the high and low beams. Accordingly, the existence of targets in either the high or low beam or both and their relative amplitudes can be used as good features for classification.
In one implementation, the feature extraction stage 54 processes each track segment to extract values for features based on statistical moments of the first and second order. The sample mean calculation is used to obtain an estimate of the first order moment of a data series x as shown in equation 1.




  
    
      
        
          x
          _
        
        ⁢
        
          
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              x
              i
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




The unbiased variance estimate may be used to obtain the second order moment of the data series x as shown in equation 2.





  
    
      
        
          σ
          2
        
        =
        
          
            1
            
              n
              -
              1
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                (
                
                  
                    x
                    i
                  
                  -
                  
                    x
                    _
                  
                
                )
              
              2
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




Table 1 provides an exemplary listing of a set of features that may be used by the classifier 24 for a given track segment t. There are three types of features represented in Table 1. Features f1 to f11 represent first and second order statistics of processed principal data, features f12 to f14 represent statistics of raw principal data and features f15 to f18 represent statistics from raw extension data. It should be noted that extension data must be available for all plots within a track segment in order to calculate features f15 to f18. Thus, segments that contain plots only detected by the SSR will not have associated extension features. In each of the equations that are used to determine values for features f1 to f18, n is the length of the current track segment t, where data is obtained from n plots, and the indices i, j and k are used to step through the data obtained from the n plots.







TABLE 1







Exemplary Features Used In the Feature Extraction Stage









Feature
Name
Description





f1
var_path
Variance in the displacement of path from a




polynomial least-squares best-fit line


f2
var_delpth
Variance in the first difference of the




displacement of path from a polynomial




least-squares best-fit line


f3
var_delsl
Variance in the first difference of slope


f4
avg_path
Mean of the displacement of path from a




polynomial least-squares best-fit line


f5
avg_delpth
Mean of the first difference of the displacement




of path from a polynomial least-squares




best-fit line


f6
avg_delsl
Mean of the first difference of slope


f7
var_del2spd
Variance in the second difference of speed (jerk)


f8
var_delspd
Variance in the first difference of speed




(acceleration)


f9
sum_dist
Total of the distance covered by segment


f10
avg_del2spd
Mean of the second difference of speed (jerk)


f11
avg_delspd
Mean of the first difference of speed




(acceleration)


f12
avg_spd
Mean of speed


f13
avg_scan
Average number of scans between successive




plots


f14
avg_rng
Mean of range


f15
avg_ma
Mean of the mean amplitude of the plot


f16
avg_pa
Mean of the peak amplitude of the plot


f17
avg_pa-ma
Mean of the difference in peak and mean




amplitudes of the plot


f18
avg_dts
Mean of the total number of detection in the plot









The exemplary features obtained from the raw radar track segments can be categorized into one of the following three types: 1) Flight path trajectory related features, 2) Radar cross section related features and 3) Velocity related features.
Flight path trajectory related features are derived from the principal data consisting of the reported range, azimuth and heading for each plot of a track segment. A number of these features rely on a transformation to translate and reorient each segment to a common reference frame such that a comparison of the trajectory related features can be made. Such features are formulated to account for the jitter in flight pattern, the variation from a least-squares fitting polynomial, the axial movement of the target about its path of trajectory, and the point-wise distance traversed by the target. Specifically, these features are captured in the following set of exemplary features {f1, f2, f3, f4, f5, f6, f9, f13, f14} from Table 1.
The path related features, var_path (f1), var_delpth (f2), avg_path (f4), and avg_delpth (f5), are calculated after performing a transformation to eliminate the orientation of the current track segment t. This is accomplished by fitting a first order polynomial to the current track segment t under consideration, and performing a translation and rotation on the current track segment t such that the linear fit is horizontal and commences at the origin. Next, a pth order polynomial (g) is fitted to the transformed data points (xi, yi), to minimize the least-square error. The vertical displacement of each point from this best-fit curve is determined as follows:




  
    
      
        
          Δ
          ⁢
          
            
          
          ⁢
          
            y
            i
          
        
        =
        
          
            [
            
              
                
                  s
                  n
                
                -
                
                  s
                  1
                
                +
                1
              
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  
                    n
                    -
                    1
                  
                
                ⁢
                
                  
                    
                      
                        (
                        
                          
                            x
                            
                              j
                              +
                              1
                            
                          
                          -
                          
                            x
                            j
                          
                        
                        )
                      
                      2
                    
                    +
                    
                      
                        (
                        
                          
                            y
                            
                              j
                              +
                              1
                            
                          
                          -
                          
                            y
                            j
                          
                        
                        )
                      
                      2
                    
                  
                
              
            
            ]
          
          ⁢
          
            (
            
              
                y
                i
              
              -
              
                g
                ⁡
                
                  (
                  
                    y
                    i
                  
                  )
                
              
            
            )
          
        
      
    
    
      
        (
        3
        )
      
    
  




where si represents the scan number for the ith detection or ith plot. The term in the square brackets represents a normalization factor to take into account the scale of the detections. The variance of this displacement is used as the var_path feature as shown in equation 4





  
    
      
        
          f
          1
        
        =
        
          
            1
            
              n
              -
              1
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                [
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      y
                      i
                    
                  
                  -
                  
                    
                      1
                      n
                    
                    ⁢
                    
                      
                        ∑
                        
                          j
                          =
                          1
                        
                        n
                      
                      ⁢
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          y
                          j
                        
                      
                    
                  
                
                ]
              
              2
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




whereas the mean of this displacement is used as the avg_path feature as shown in equation 5.





  
    
      
        
          f
          4
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              Δ
              ⁢
              
                
              
              ⁢
              
                y
                i
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




With regards to features f2 and f5, the variance of the first difference:

ΔYi=Δyi+1−Δyi  (6)

is used as the var_delpth feature as shown in equation 7,





  
    
      
        
          f
          2
        
        =
        
          
            1
            
              n
              -
              2
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              
                n
                -
                1
              
            
            ⁢
            
              
                [
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Y
                      i
                    
                  
                  -
                  
                    
                      1
                      
                        n
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          j
                          =
                          1
                        
                        
                          n
                          -
                          1
                        
                      
                      ⁢
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          Y
                          j
                        
                      
                    
                  
                
                ]
              
              2
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




and the mean used as the avg_delpth feature as shown in equation 8.





  
    
      
        
          f
          5
        
        =
        
          
            1
            
              n
              -
              1
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              
                n
                -
                1
              
            
            ⁢
            
              Δ
              ⁢
              
                
              
              ⁢
              
                Y
                i
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




The var_delsl feature f3 is obtained according to equation 9:





  
    
      
        
          f
          3
        
        =
        
          
            1
            
              n
              -
              2
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              
                n
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                [
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      sl
                      i
                    
                  
                  -
                  
                    
                      1
                      
                        n
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          j
                          =
                          1
                        
                        
                          n
                          -
                          1
                        
                      
                      ⁢
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          sl
                          j
                        
                      
                    
                  
                
                ]
              
              2
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




where

Δsli=sli+1−sli  (10)

Specifically, sli is obtained from the transformed data using the average slope, which is calculated as shown in equation 11.





  
    
      
        
          sl
          i
        
        =
        
          
            tan
            
              -
              1
            
          
          ⁡
          
            (
            
              
                
                  y
                  
                    i
                    +
                    1
                  
                
                -
                
                  y
                  i
                
              
              
                
                  x
                  
                    i
                    +
                    1
                  
                
                -
                
                  x
                  i
                
              
            
            )
          
        
      
    
    
      
        (
        11
        )
      
    
  




Similarly, the avg_delsl feature f6 is obtained as shown in equation 12.





  
    
      
        
          f
          6
        
        =
        
          
            1
            
              n
              -
              1
            
          
          ⁢
          
            
              ∑
              
                j
                =
                1
              
              
                n
                -
                1
              
            
            ⁢
            
              Δ
              ⁢
              
                
              
              ⁢
              
                sl
                j
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




The average range (avg_mg), feature is derived from the range, r, reported by the radar as shown in equation 13:




  
    
      
        
          f
          14
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              r
              i
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




The sum_dist feature represents the total distance covered by the target as determined by the location of the points in the track segment as shown in equation 14.




  
    
      
        
          f
          9
        
        =
        
          
            ∑
            
              i
              =
              1
            
            
              n
              -
              1
            
          
          ⁢
          
            
              
                
                  (
                  
                    
                      x
                      
                        i
                        +
                        1
                      
                    
                    -
                    
                      x
                      i
                    
                  
                  )
                
                2
              
              +
              
                
                  (
                  
                    
                      y
                      
                        i
                        +
                        k
                      
                    
                    -
                    
                      y
                      i
                    
                  
                  )
                
                2
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




The avg_scan feature represents the average number of radar scans required to record a single plot for the track segment in question. The number of radar scans (Δsi) is determined as the number of scans elapsed since the previous detection was recorded as shown in equation 15:

Δsi=si+1−si  (15)

where si represents the scan number for the current detection and the index i is used to step through the number of detections. The average simplifies as shown in equation 16.





  
    
      
        
          
            
              
                f
                13
              
              =
              
                
                  1
                  
                    n
                    -
                    1
                  
                
                ⁢
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    
                      n
                      -
                      1
                    
                  
                  ⁢
                  
                    (
                    
                      Δ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        s
                        i
                      
                    
                    )
                  
                
              
            
          
        
        
          
            
              =
              
                
                  1
                  
                    n
                    -
                    1
                  
                
                ⁢
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    
                      n
                      -
                      1
                    
                  
                  ⁢
                  
                    (
                    
                      
                        s
                        
                          i
                          +
                          1
                        
                      
                      -
                      
                        s
                        i
                      
                    
                    )
                  
                
              
            
          
        
        
          
            
              =
              
                
                  1
                  
                    n
                    -
                    1
                  
                
                ⁡
                
                  [
                  
                    
                      
                        ∑
                        
                          i
                          =
                          2
                        
                        n
                      
                      ⁢
                      
                        s
                        i
                      
                    
                    -
                    
                      
                        ∑
                        
                          i
                          =
                          1
                        
                        
                          n
                          -
                          1
                        
                      
                      ⁢
                      
                        s
                        i
                      
                    
                  
                  ]
                
              
            
          
        
        
          
            
              =
              
                
                  
                    s
                    n
                  
                  -
                  
                    s
                    1
                  
                
                
                  n
                  -
                  1
                
              
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




The radar cross-section related features are derived from the first and second order statistical moments of the extension data and may include normalization factors. These features are obtained from the mean (ma) and peak (pa) radar returns, each normalized with the squared range of the target, and the number of detection points (dts) which can be related to the size of target but more generally to the number of detections passing a predefined threshold, such as a CFAR threshold for example, that are combined to form each resultant plot. Specifically, these features include {f15, f16, f17, f18} as detailed below.
The mean of the mean amplitude (avg_ma) may be defined according to equation 17.




  
    
      
        
          f
          15
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                ma
                i
              
              ⁢
              
                r
                i
                2
              
            
          
        
      
    
    
      
        (
        17
        )
      
    
  




The mean of the peak amplitude (avg_pa) may be defined according to equation 18.





  
    
      
        
          f
          16
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                pa
                i
              
              ⁢
              
                r
                i
                2
              
            
          
        
      
    
    
      
        (
        18
        )
      
    
  




The mean difference of peak and mean amplitudes (avg_pa-ma) may be defined according to equation 19.





  
    
      
        
          f
          17
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              
                (
                
                  
                    pa
                    i
                  
                  -
                  
                    ma
                    i
                  
                
                )
              
              ⁢
              
                r
                i
                2
              
            
          
        
      
    
    
      
        (
        19
        )
      
    
  




The average number of detection points (avg_dts) may be defined according to equation 20.





  
    
      
        
          f
          18
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              dts
              i
            
          
        
      
    
    
      
        (
        20
        )
      
    
  




As shown, the avg_ma, avg_pa and avg_pa-ma terms include range-based normalization factors to take into account the power loss that occurs with range as was previously described.

In this exemplary implementation of the classifier 24, some of the features are velocity related, and are derived from the first and second order statistical moments of principal data related to the speed, acceleration and jerk of the target. More specifically, average acceleration and jerk values are derived from the temporal differences in the velocity returns of the target. The var_delspd (f3) feature represents the variance in the second difference in speed which is equivalent to the non-normalized average jerk (ji) among data points of a track segment. The radar reports the speed (vi) at each point along the track segment, from which the non-normalized average acceleration can be determined according to equation 21.

ai=vi+1−vi  (21)

The non-normalized average jerk is the change in acceleration and is calculated as follows





  
    
      
        
          
            
              
                j
                i
              
              =
              
                
                  a
                  
                    i
                    +
                    1
                  
                
                -
                
                  a
                  i
                
              
            
          
        
        
          
            
              =
              
                
                  (
                  
                    
                      v
                      
                        i
                        +
                        2
                      
                    
                    -
                    
                      v
                      
                        i
                        +
                        1
                      
                    
                  
                  )
                
                -
                
                  (
                  
                    
                      v
                      
                        i
                        +
                        1
                      
                    
                    -
                    
                      v
                      i
                    
                  
                  )
                
              
            
          
        
        
          
            
              =
              
                
                  v
                  
                    i
                    +
                    2
                  
                
                -
                
                  2
                  ⁢
                  
                    v
                    
                      i
                      +
                      1
                    
                  
                
                +
                
                  v
                  i
                
              
            
          
        
      
    
    
      
        (
        22
        )
      
    
  




resulting in the var_del2spd feature as shown in equation 23





  
    
      
        
          f
          7
        
        =
        
          
            1
            
              n
              -
              3
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              
                n
                -
                2
              
            
            ⁢
            
              
                [
                
                  
                    j
                    i
                  
                  -
                  
                    
                      1
                      
                        n
                        -
                        2
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          k
                          =
                          1
                        
                        
                          n
                          -
                          2
                        
                      
                      ⁢
                      
                        j
                        k
                      
                    
                  
                
                ]
              
              2
            
          
        
      
    
    
      
        (
        23
        )
      
    
  




and the var_delspd feature as shown in equation 24





  
    
      
        
          f
          8
        
        =
        
          
            1
            
              n
              -
              2
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              
                n
                -
                1
              
            
            ⁢
            
              
                [
                
                  
                    a
                    i
                  
                  -
                  
                    
                      1
                      
                        n
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        ∑
                        
                          k
                          =
                          1
                        
                        
                          n
                          -
                          1
                        
                      
                      ⁢
                      
                        a
                        k
                      
                    
                  
                
                ]
              
              2
            
          
        
      
    
    
      
        (
        24
        )
      
    
  




Similar to the variance features, the avg_del2spd feature is calculated as shown in equation 25





  
    
      
        
          f
          10
        
        =
        
          
            1
            
              n
              -
              2
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              
                n
                -
                2
              
            
            ⁢
            
              j
              i
            
          
        
      
    
    
      
        (
        25
        )
      
    
  




and the avg_delspd feature as shown in equation 26.





  
    
      
        
          f
          11
        
        =
        
          
            1
            
              n
              -
              1
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              
                n
                -
                1
              
            
            ⁢
            
              a
              i
            
          
        
      
    
    
      
        (
        26
        )
      
    
  




The avg_spd is calculated as shown in equation 27.





  
    
      
        
          f
          12
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              v
              i
            
          
        
      
    
    
      
        (
        27
        )
      
    
  




Features f1 to f18 are provided as examples of features that may be used by the classifier 24. In addition to the formulations presented, variants of each feature may also be used. For example non-linear functions, such as the logarithm or exponential functions, can be applied to increase class separability. Furthermore, various combinations of these features may provide better classification performance as described in more detail below. During the design of the classifier 24, a subset of the features f1 to f18 may be selected and during operation, the feature extraction stage 54 calculates values for the selected features.
Both of the extension and principal feature processing stages 60 and 64 generate a feature vector. For a given feature, indexed by i, a multidimensional feature vector, Fi, can be constructed from the feature values, fi, of related track segments, indexed by j, extracted from a single track. As such, each feature vector consists of m elements of the same feature taken from j consecutive segments of a track, i.e.

Fi(k)={fi(j), fi(j+1), . . . , fi(j+m−1)}T  (28)

with the subsequent feature vector overlapping the previous one by lov feature values, resulting in

Fi(k+1)={fi(j+m−l), fi(j+m+1−l), . . . , fi(j+2m−1−l)}T  (29)

FIG. 4A illustrates a feature vector configuration consisting of m=4 elements, and lov=2 overlapping features. When lov=0, each feature vector begins with the feature value of the next segment following the last feature value of the previous feature vector. This exemplary non-overlapping configuration is shown in FIG. 4B with an m=3 element feature vector.

Multidimensional feature vectors encompass more information with increased dimensionality for the same track segmentation parameters. Although this results in multiple feature values for the same feature, it comes at the cost of increased segment length required to form a feature vector. The number of plots, tp, required to construct a feature vector can be determined by the segmentation parameters, namely the segment size n and the segment overlap kov, and feature vector parameters, being the number of elements m and feature vector overlap lov, as shown in equation 30.

tp=nm−kov(m−1)=m(n−kov)+kov  (30)

As such, the classifier uses the first tp plots before an initial decision on the classification of a portion of a given track segment can be made. By setting m=1, this decision can be obtained after the first n plots, and updated with the next n−kov plots.

It has been observed that classification performance can be improved by increasing tp, the number of plots that are used to form a feature vector. This increase can be achieved by various means including increasing n, the number of plots used per track segment, or m, the number of track segments used per feature vector. The improved classification performance can be attributed to more data being available to form better feature estimates, thus helping to discriminate among classes of interest. However, with increased number of plots tp, the initial decision is delayed as well, thus resulting in a trade off between incremental classification performance and update rate of target classification. It should be noted that an increase in n is only effective while the changes in target behaviour are minimal with the increased track segment length. For instance, an increase in track segment length for a maneuvering aircraft may result in a variance of the path feature that is more in line with the non-aircraft class. The amount of data that is required for optimal classification performance can be determined through experimentation on recorded radar data.
To determine which feature vectors result in better classification performance for the classifier 24, the inventors propose a Cluster Performance Index (CPI), defined according to equation 31:




  
    
      
        
          
            
              
                CPI
                β
              
              =
              
                
                  ∑
                  
                    c
                    =
                    1
                  
                  CI
                
                ⁢
                
                  
                    
                      P
                      c
                    
                    
                      I
                      c
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        i
                        =
                        1
                      
                      
                        I
                        c
                      
                    
                    ⁢
                    
                      [
                      
                        
                          
                            (
                            
                              β
                              +
                              1
                            
                            )
                          
                          ⁢
                          
                            
                              p
                              ic
                            
                            
                              
                                log
                                ⁡
                                
                                  (
                                  
                                    β
                                    
                                      β
                                      +
                                      1
                                    
                                  
                                  )
                                
                              
                              
                                log
                                ⁢
                                
                                  
                                
                                ⁢
                                
                                  P
                                  c
                                
                              
                            
                          
                        
                        -
                        β
                      
                      ]
                    
                  
                
              
            
          
        
        
          
            
              =
              
                
                  
                    
                      β
                      +
                      1
                    
                    
                      (
                      
                        
                          ∑
                          
                            d
                            =
                            1
                          
                          CI
                        
                        ⁢
                        
                          I
                          d
                        
                      
                      )
                    
                  
                  ⁡
                  
                    [
                    
                      
                        ∑
                        
                          c
                          =
                          1
                        
                        CI
                      
                      ⁢
                      
                        
                          ∑
                          
                            i
                            =
                            1
                          
                          
                            I
                            c
                          
                        
                        ⁢
                        
                          
                            p
                            ic
                          
                          
                            
                              log
                              ⁡
                              
                                (
                                
                                  β
                                  
                                    β
                                    +
                                    1
                                  
                                
                                )
                              
                            
                            
                              log
                              ⁢
                              
                                
                              
                              ⁢
                              
                                P
                                c
                              
                            
                          
                        
                      
                    
                    ]
                  
                
                -
                β
              
            
          
        
      
    
    
      
        (
        31
        )
      
    
  




where Cl is the number of classes c, lc is the number of track segments in class c, Pc is the probability of a track segment belonging to class c as defined by equation 32:





  
    
      
        
          P
          c
        
        =
        
          
            I
            c
          
          
            (
            
              
                ∑
                
                  d
                  =
                  1
                
                CI
              
              ⁢
              
                I
                d
              
            
            )
          
        
      
    
    
      
        (
        32
        )
      
    
  




and pic is the empirical likelihood of track segment i belonging to a class c, as defined by equation 33:





  
    
      
        
          p
          ic
        
        =
        
          
            N
            ic
          
          M
        
      
    
    
      
        (
        33
        )
      
    
  




in which M is the number of nearest neighbours used in the CPI calculation; and Nic is the number of nearest neighbours (to track segment i) within M belonging to class c. In the feature space under consideration (i.e. individual/combination of features), for each data point, the M nearest neighbours are the closest M data points as determined by some measure of distance (e.g. Euclidean distance). This may include normalization of individual dimensions prior to performing distance measures to equate the relative influence of each dimension (i.e. each calculated feature). The parameter β controls the degree to which the CPI penalizes for poor performance as determined by an empirical likelihood less than Pc. This may be achieved through a non-linear mapping of the empirical likelihood pic, using an exponential function of the form H:[0,1]→[−β,1], constrained such that:

H(0)=−β

H(Pc)=0

H(1)=1  (34)

which permits evaluation of features relative to the distribution of classes in the dataset. In addition, by selecting an exponential function as the basis for the CPI, the model becomes more sensitive to variations in the pic near pc for small values of Pc. This is illustrated in FIG. 5a for the exponential case parameterized by β=2 in comparison to the linear model constrained by H(Pc)=0 and H(1)=1 as shown in FIG. 5b. As observed, this form of feature evaluation better accounts for poor performance in relatively less probable classes than a linear model.

A number of classes of targets can be distinguished given a suitable set of features by training the classifier 24 with such features. In this description, experimental results are shown for two classes: aircraft and non-aircraft. However, as mentioned previously these classes can be expanded to include several sub-classes such as birds, windmills, AP, etc. in the non-aircraft class, and helicopters, small planes, etc. in the aircraft class.
The CPI calculation relies on a distance measure to determine the set of M nearest neighbours. Each dimension within the input space includes normalized features to avoid undue bias introduced by a magnitude difference in features. In one implementation, the median value of each feature may be used as the normalization constant in the CPI calculation. The median, i.e. the value that minimizes the sum of absolute deviations for a given distribution, is preferably used since it is less susceptible to influence by noisy outliers in comparison to the mean.
In one exemplary embodiment, the classifier stages 62 and 66 use a support vector machine (SVM) to perform classification. The SVM was introduced by Vapnik and is based on the principle of Structural Risk Minimization (SRM). In contrast to Empirical Risk Minimization techniques where the aim is the minimization of the error in the training dataset, the objective in SRM is to minimize the upper bound on the generalization error. An SVM can be formulated to handle linearly separable and non-separable data, and has a structure that allows for non-linear classification with minor modifications. In addition, since SVMs are known to generalize well and have been applied to a wide range of applications, they serve as a good candidate for target track classification in advanced ASR systems.
Linear SVM Classification
Given a dataset xi∈Rn with corresponding labels yi∈{−1, +1} for i=1 . . . l, the objective of an SVM is to find the maximal separating hyperplane. The variable l is the number of data points (i.e. track segments). The −1 and +1 are data labels used to refer to non-aircraft and aircraft classes. This set of data labels may be expanded to include more classes. For the linearly separable case, this optimal hyperplane maximizes the margin, being the sum of the distance to the closest data point(s), also known as support vectors, of each class. The distance (d) to each class, along with the total margin is shown in FIG. 6 for an exemplary case with the support vectors shaded.
The equation of the maximal separating hyperplane w·xi+b=0 is used to ensure that elements from each class lie on the correct side of the hyperplane as follows:

w·xi+b≧1 for yi=+1

w·xi+b≦1 for yi=−1  (35)

or equivalently,

yi(w·xi+b)≧1 for i=1 . . . l  (36)

The value of 1 on the right hand side of equations 35 and 36 maintains non-zero distances to each class. The optimal separating hyperplane can be determined by maximizing the distance d to each class:





  
    
      
        d
        =
        
          1
          
            w
            ·
            w
          
        
      
    
    
      
        (
        37
        )
      
    
  




or equivalently minimizing the inverse of the margin,





  
    
      
        
          w
          ·
          w
        
        2
      
    
    
      
        (
        38
        )
      
    
  




Thus, the constrained minimization of equation 38 subject to equation 36 yields the optimal separating hyperplane for linearly separable data.

SVM is a binary classifier. Accordingly, to use a binary classifier for multiple classes, a combination of several classifiers may be used in a suitable configuration (e.g. binary tree format, one-against-others). For instance, the first classifier can distinguish aircraft targets from non-aircraft targets, with the next classifier identifying birds in what has already been classified as non-aircraft by the first classifier, and so on and so forth.
In the case of linearly non-separable data, slack variables, ξi, are introduced to penalize for misclassified data points resulting in the following (primal) optimization problem:




  
    
      
        
          minimize
          ⁢
          
            :
          
        
        ⁢
        
          

        
        ⁢
        
          
            F
            ⁡
            
              (
              
                w
                ,
                b
                ,
                ξ
              
              )
            
          
          =
          
            
              
                w
                ·
                w
              
              2
            
            +
            
              C
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  I
                
                ⁢
                
                  ξ
                  i
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          subject
          ⁢
          
            
          
          ⁢
          to
          ⁢
          
            :
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  
                    y
                    i
                  
                  ⁡
                  
                    (
                    
                      
                        w
                        ·
                        
                          x
                          i
                        
                      
                      +
                      b
                    
                    )
                  
                
                ≥
                
                  1
                  -
                  
                    ξ
                    i
                  
                
              
            
            
              
                
                  for
                  ⁢
                  
                    
                  
                  ⁢
                  i
                
                =
                
                  1
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  l
                
              
            
          
          
            
              
                
                  ξ
                  i
                
                >
                0
              
            
            
              
                
                  for
                  ⁢
                  
                    
                      
                    
                    ⁢
                    
                      
                    
                  
                  ⁢
                  i
                
                =
                
                  1
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  l
                
              
            
          
        
      
    
    
      
        (
        39
        )
      
    
  




where C, represents a control parameter to allow for a trade off between increased training error with smaller C, and higher margin with larger C. The quadratic problem presented in equation 39 can be expressed in its dual form by introducing Lagrange multipliers ai, for i=1 . . . l, to account for the constraints in the primal formulation as follows:





  
    
      
        
          maximize
          ⁢
          
            :
          
        
        ⁢
        
          

        
        ⁢
        
          
            G
            ⁡
            
              (
              a
              )
            
          
          =
          
            
              
                ∑
                
                  i
                  =
                  1
                
                I
              
              ⁢
              
                a
                i
              
            
            -
            
              
                1
                2
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  I
                
                ⁢
                
                  
                    ∑
                    
                      j
                      =
                      1
                    
                    I
                  
                  ⁢
                  
                    
                      a
                      i
                    
                    ⁢
                    
                      a
                      j
                    
                    ⁢
                    
                      y
                      i
                    
                    ⁢
                    
                      y
                      j
                    
                    ⁢
                    
                      
                        x
                        i
                      
                      ·
                      
                        x
                        j
                      
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          subject
          ⁢
          
            
          
          ⁢
          to
          ⁢
          
            :
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    I
                  
                  ⁢
                  
                    
                      a
                      i
                    
                    ⁢
                    
                      y
                      i
                    
                  
                
                =
                0
              
            
            
              
                
                  for
                  ⁢
                  
                    
                  
                  ⁢
                  i
                
                =
                
                  1
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  l
                
              
            
          
          
            
              
                0
                <
                
                  a
                  i
                
                ≤
                C
              
            
            
              
                
                  for
                  ⁢
                  
                    
                  
                  ⁢
                  i
                
                =
                
                  1
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  l
                
              
            
          
        
      
    
    
      
        (
        40
        )
      
    
  




Non-Linear SVM Classification

The extension of the linear SVM classification into non-linear classification is achieved by non-linearly mapping the input data into a high dimensional space and performing linear classification in this new space. The linear SVM in the new feature space corresponds to a non-linear SVM in the original input space. Formally, the non-linear mapping Φ:Rn→X, may be implicitly incorporated into the objective function through a positive definite symmetric kernel function K(xi,xj)=Φ(xi)·Φ(xj). Using a kernel function alleviates the need to explicitly evaluate the Φ mapping which can be computationally inefficient. Common kernel functions that may be used include the polynomial, radial basis function, and sigmoid kernels which are summarized in equation set 41.




  
    
      
        
          
            
              K
              poly
            
            ⁡
            
              (
              
                
                  x
                  i
                
                ,
                
                  x
                  j
                
              
              )
            
          
          =
          
            
              (
              
                
                  
                    sx
                    i
                  
                  ·
                  
                    x
                    j
                  
                
                +
                c
              
              )
            
            d
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              K
              rbf
            
            ⁡
            
              (
              
                
                  x
                  i
                
                ,
                
                  x
                  j
                
              
              )
            
          
          =
          
            exp
            ⁢
            
              {
              
                -
                
                  
                    
                      (
                      
                        
                          x
                          i
                        
                        -
                        
                          x
                          j
                        
                      
                      )
                    
                    ·
                    
                      (
                      
                        
                          x
                          i
                        
                        -
                        
                          x
                          j
                        
                      
                      )
                    
                  
                  
                    2
                    ⁢
                    
                      σ
                      2
                    
                  
                
              
              }
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              K
              sigmoid
            
            ⁡
            
              (
              
                
                  x
                  i
                
                ,
                
                  x
                  j
                
              
              )
            
          
          =
          
            tanh
            ⁡
            
              (
              
                
                  
                    sx
                    i
                  
                  ·
                  
                    x
                    j
                  
                
                +
                c
              
              )
            
          
        
      
    
    
      
        (
        41
        )
      
    
  




As such, the modified optimization problem for the non-linear SVM is shown in equation 42.





  
    
      
        
          
            maximize
            ⁢
            
              :
            
          
          ⁢
          
            

          
          ⁢
          
            G
            ⁡
            
              (
              a
              )
            
          
          =
          
            
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                
                I
              
              ⁢
              
                a
                i
              
            
            -
            
              
                1
                2
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  I
                
                ⁢
                
                  
                    ∑
                    
                      j
                      =
                      1
                    
                    I
                  
                  ⁢
                  
                    
                      a
                      i
                    
                    ⁢
                    
                      a
                      j
                    
                    ⁢
                    
                      y
                      i
                    
                    ⁢
                    
                      y
                      j
                    
                    ⁢
                    
                      K
                      ⁡
                      
                        (
                        
                          
                            x
                            i
                          
                          ·
                          
                            x
                            j
                          
                        
                        )
                      
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          subject
          ⁢
          
            
          
          ⁢
          to
          ⁢
          
            :
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    I
                  
                  ⁢
                  
                    
                      a
                      i
                    
                    ⁢
                    
                      y
                      i
                    
                  
                
                =
                0
              
            
            
              
                
                  for
                  ⁢
                  
                    
                  
                  ⁢
                  i
                
                =
                
                  1
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  l
                
              
            
          
          
            
              
                0
                <
                
                  a
                  i
                
                ≤
                C
              
            
            
              
                
                  for
                  ⁢
                  
                    
                  
                  ⁢
                  i
                
                =
                
                  1
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  l
                
              
            
          
        
      
    
    
      
        (
        42
        )
      
    
  




The feature extraction stage 54 and the feature processing stages 60 and 64 convert each radar track into a number of feature vectors through segmentation and feature vector formulation. The classifier stages 62 and 66 then classify each feature vector independently of the source tracks, with feature vector classification results of the same track segment t being combined in the combiner stage 68. In one instance, the combination may be done using a linear weighted function.
The feature processing stages 60 and 64 generate data vectors, xj, for the jth track, from the feature vectors Fi(j), where the index i typically ranges along all principal and extension features, f1 to f14 and f15 to f18 respectively, as shown in equation 43 for principle data

xj={F1(j), F2(j), . . . , F14(j)}T  (43)

and equation 44 for extension data.

xj={F15(j), F16(j), . . . , F18(j)}T  (44)

As is the case for the CPI calculation, normalization of data vectors may be performed to avoid undue bias in the SVM calculations. In this case, the inventors have found that it is preferable to apply a whitening transform to the feature data by forming the unbiased sample covariance matrix (Σ) of the data as follows:





  
    
      
        ∑
        
          =
          
            
              
                1
                N
              
              ⁢
              
                (
                
                  X
                  -
                  
                    X
                    _
                  
                
                )
              
              ⁢
              
                
                  (
                  
                    X
                    -
                    
                      X
                      _
                    
                  
                  )
                
                T
              
            
            =
            
              V
              ⁢
              
                
              
              ⁢
              Λ
              ⁢
              
                
              
              ⁢
              
                V
                T
              
            
          
        
      
    
    
      
        (
        45
        )
      
    
  




where

X={x1, x2, . . . , xn}  (46)

represents the 14×N or 4×N dimensional data matrix for principle and extension data respectively, and,





  
    
      
        
          X
          _
        
        =
        
          
            1
            N
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              x
              i
            
          
        
      
    
    
      
        (
        47
        )
      
    
  




N represents the total number of feature vectors extracted from all tracks within the training set that is used to train the classifier 24 where X is the mean vector of the data values. The resulting whitening transform may then be calculated as follows:

W=Λ−1/2VT  (48)

where Λ is the 14×14 or 4×4 diagonal matrix of the eigenvalues of Σ, and V is the 14×14 or 4×4 matrix composed of the eigenvectors vi of Σ defined by equation 49, for principle and extension data respectively.





  
    
      
        V
        =
        
          {
          
            
              
                
                  [
                  
                    
                      
                        
                          v
                          1
                        
                      
                      
                        
                          v
                          2
                        
                      
                      
                        ⋯
                      
                      
                        
                          v
                          14
                        
                      
                    
                  
                  ]
                
              
              
                
                  For
                  ⁢
                  
                    
                  
                  ⁢
                  principal
                  ⁢
                  
                    
                  
                  ⁢
                  data
                
              
            
            
              
                
                  [
                  
                    
                      
                        
                          v
                          15
                        
                      
                      
                        
                          v
                          16
                        
                      
                      
                        ⋯
                      
                      
                        
                          v
                          18
                        
                      
                    
                  
                  ]
                
              
              
                
                  For
                  ⁢
                  
                    
                  
                  ⁢
                  extension
                  ⁢
                  
                    
                  
                  ⁢
                  data
                
              
            
          
        
      
    
    
      
        (
        49
        )
      
    
  




In one implementation of the invention, the whitened training data matrix may be obtained according to equation 50,

X′=WX  (50)

and for any test data, Xtest, the same whitening transformation matrix (obtained from the training data), W, is preferably used to pre-process the test data according to equation 51.

X′test=WXtest  (51)

The combiner stage 68 not only combines the results of each classifier stage 62 and 66 but also the results from the previous track segment t−1. Accordingly, the combiner stage 68 provides an aggregate classification result over time. Each classification stage 62 and 66 produces a resulting data label, yijt∈{−1, +1}, (for two exemplary classes) for the ith track and the track segment t associated with the feature vector j used with the classifier 24. Further, the presence of SSR data for a track segment t is denoted as follows.




  
    
      
        
          λ
          it
        
        =
        
          {
          
            
              
                
                  +
                  1
                
              
              
                
                  
                    
                      
                        if
                        ⁢
                        
                          
                        
                        ⁢
                        SSR
                        ⁢
                        
                          -
                        
                        ⁢
                        sourced
                        ⁢
                        
                          
                        
                        ⁢
                        data
                        ⁢
                        
                          
                        
                        ⁢
                        exist
                        ⁢
                        
                          
                        
                        ⁢
                        in
                      
                    
                  
                  
                    
                      
                        the
                        ⁢
                        
                          
                        
                        ⁢
                        
                          t
                          th
                        
                        ⁢
                        
                          
                        
                        ⁢
                        segment
                        ⁢
                        
                          
                        
                        ⁢
                        of
                        ⁢
                        
                          
                        
                        ⁢
                        the
                        ⁢
                        
                          
                        
                        ⁢
                        
                          i
                          th
                        
                        ⁢
                        
                          
                        
                        ⁢
                        track
                      
                    
                  
                
              
            
            
              
                
                  -
                  1
                
              
              
                otherwise
              
            
          
        
      
    
    
      
        (
        52
        )
      
    
  




These labels are aggregated to produce track label YiT for the current time instant T as follows:





  
    
      
        
          
            Y
            iT
          
          =
          
            sign
            ⁢
            
              
            
            ⁢
            
              (
              
                
                  ∑
                  
                    t
                    =
                    1
                  
                  T
                
                ⁢
                
                  max
                  ⁡
                  
                    (
                    
                      
                        ρ
                        it
                      
                      ,
                      
                        λ
                        it
                      
                    
                    )
                  
                
              
              )
            
          
        
        ⁢
        
          

        
        ⁢
        
          where
          ,
        
      
    
    
      
        (
        53
        )
      
    
  
  
    
      
        
          sign
          ⁢
          
            
          
          ⁢
          
            (
            x
            )
          
        
        =
        
          {
          
            
              
                
                  
                    
                      +
                      1
                    
                  
                  
                    
                      
                        for
                        ⁢
                        
                          
                        
                        ⁢
                        x
                      
                      ≥
                      0
                    
                  
                
                
                  
                    0
                  
                  
                    otherwise
                  
                
              
              ⁢
              
                

              
              ⁢
              and
            
            ,
          
        
      
    
    
      
        (
        54
        )
      
    
  
  
    
      
        
          ρ
          it
        
        =
        
          
            ∑
            
              j
              =
              1
            
            2
          
          ⁢
          
            
              [
              
                
                  
                    θ
                    it
                  
                  ⁢
                  
                    k
                    j
                  
                
                +
                
                  
                    (
                    
                      1
                      -
                      
                        θ
                        it
                      
                    
                    )
                  
                  ⁢
                  
                    (
                    
                      2
                      -
                      j
                    
                    )
                  
                
              
              ]
            
            ⁢
            
              y
              ijt
            
          
        
      
    
    
      
        (
        55
        )
      
    
  




where,

is the classification result for track i and segment t. The variable θit is an indicator variable for the presence of extension data formally defined as,





  
    
      
        
          θ
          it
        
        =
        
          {
          
            
              
                1
              
              
                
                  
                    
                      
                        if
                        ⁢
                        
                          
                        
                        ⁢
                        extension
                        ⁢
                        
                          
                        
                        ⁢
                        data
                        ⁢
                        
                          
                        
                        ⁢
                        exist
                        ⁢
                        
                          
                        
                        ⁢
                        for
                        ⁢
                        
                          
                        
                        ⁢
                        the
                      
                    
                  
                  
                    
                      
                        
                          t
                          th
                        
                        ⁢
                        
                          
                        
                        ⁢
                        segment
                        ⁢
                        
                          
                        
                        ⁢
                        of
                        ⁢
                        
                          
                        
                        ⁢
                        the
                        ⁢
                        
                          
                        
                        ⁢
                        
                          i
                          th
                        
                        ⁢
                        
                          
                        
                        ⁢
                        track
                      
                    
                  
                
              
            
            
              
                0
              
              
                otherwise
              
            
          
        
      
    
    
      
        (
        56
        )
      
    
  




Moreover, kj, j=1, 2 is the relative proportion of principal and extension features with respect to all features, used in the classification stages 62 and 66. Given P principal features and E extension features, kj, j=1, 2 is defined according to equations 57 and 58.





  
    
      
        
          k
          1
        
        =
        
          P
          
            P
            +
            E
          
        
      
    
    
      
        (
        57
        )
      
    
  
  
    
      
        
          k
          2
        
        =
        
          
            1
            -
            
              k
              1
            
          
          =
          
            E
            
              P
              +
              E
            
          
        
      
    
    
      
        (
        58
        )
      
    
  




The variable θit is a switching variable to select the multiplier for yijt; namely, kj, when extension features are available for the current feature vector, and {1,0} for j=1, 2 respectively, when extension features are not available for the current feature vector. In an alternative implementation, the sign(x) operation in equation 53 may be replaced with a time-dependent normalization constant and a bias, as follows:





  
    
      
        
          Y
          iT
        
        =
        
          
            1
            2
          
          ⁢
          
            ⌊
            
              
                
                  1
                  T
                
                ⁢
                
                  
                    
                      ∑
                      
                        t
                        =
                        1
                      
                    
                    T
                  
                  ⁢
                  
                    max
                    ⁡
                    
                      (
                      
                        
                          ρ
                          it
                        
                        ,
                        
                          λ
                          it
                        
                      
                      )
                    
                  
                
              
              +
              1
            
            ⌋
          
        
      
    
    
      
        (
        59
        )
      
    
  




to obtain an updated probability value based on the likelihood of the target's behaviour to conform to aircraft and non-aircraft classes.

In another alternative implementation, independence among the segment ranges can be further instilled in addition to the overlapping feature and segment regions. This is achieved by moving away from the uniform distribution assumed in equations 53 and 59, and introducing a statistical distribution factor, Ψit, as shown in equations 60 and 61.




  
    
      
        
          Y
          iT
        
        =
        
          sign
          ⁡
          
            (
            
              
                ∑
                
                  t
                  =
                  1
                
                T
              
              ⁢
              
                
                  ψ
                  it
                
                ⁢
                
                  max
                  ⁡
                  
                    (
                    
                      
                        ρ
                        it
                      
                      ,
                      
                        λ
                        it
                      
                    
                    )
                  
                
              
            
            )
          
        
      
    
    
      
        (
        60
        )
      
    
  
  
    
      
        
          ψ
          it
        
        =
        
          
            H
            iT
          
          ⁡
          
            (
            
              ρ
              it
            
            )
          
        
      
    
    
      
        (
        61
        )
      
    
  




HiT(ρit), is a weight for ρit based on some weighting function HiT defined for the ith track segment by the all ρit, t=1 . . . T. The weighting function HiT is used to decrease the contribution of noisy outliers based on all available observations for the given track segment t. This may also be extended to obtain an updated probability value based on likelihood target behaviour to conform to aircraft and non-aircraft classes as shown in equation 62.





  
    
      
        
          Y
          iT
        
        =
        
          
            1
            2
          
          ⁢
          
            ⌊
            
              
                
                  1
                  
                    (
                    
                      
                        ∑
                        
                          τ
                          =
                          1
                        
                        T
                      
                      ⁢
                      
                        ψ
                        
                          i
                          ⁢
                          
                            
                          
                          ⁢
                          τ
                        
                      
                    
                    )
                  
                
                ⁢
                
                  
                    ∑
                    
                      t
                      =
                      1
                    
                    T
                  
                  ⁢
                  
                    
                      ψ
                      it
                    
                    ⁢
                    
                      max
                      ⁡
                      
                        (
                        
                          
                            ρ
                            it
                          
                          ,
                          
                            λ
                            it
                          
                        
                        )
                      
                    
                  
                
              
              +
              1
            
            ⌋
          
        
      
    
    
      
        (
        62
        )
      
    
  




The combiner stage 68 may provide the final classification result as defined by equation 53. In an alternative embodiment, the combiner stage 68 may provide the final classification result as defined by equation 60.

Referring now to FIG. 7, shown therein a flow diagram of a training process 80 that may be used to establish the classification that occurs in the extension classifier stage 62 and the principal classifier stage 66. As shown, the training process 80 uses labeled tracks. Data pre-processing is performed on the labeled tracks in step 82 which includes segmenting the labeled track segments. The pre-processed labeled track segments are then processed to obtain values for the features in step 84. The formation of principal and extension feature spaces, as well as processing on these spaces such as performing whitening transformations, as previously described, occurs in steps 86 and 90. After processing the principal and extension feature spaces, the classifiers are trained in steps 88 and 92 and the system parameters for the principal and extension data are stored. Training may be performed by solving the optimization problem outlined in equation 40 for the linear SVM, or equation 42 for the non-linear SVM respectively. For training, SSR data may be used to confirm aircraft ground truth and data with no probable aircraft may be used to train the classifier 24 for non-aircraft targets
Real data from two different DASR sites were processed to evaluate the classifier 24. Dataset one includes 237 aircraft and 529 non-aircraft tracks recorded over 364 real radar scans and includes an abundant number of bird tracks. Dataset two includes data collected over three days with the characteristics of the data as summarized in Table 2.







TABLE 2







Characteristics of datasets














Non-aircraft



Site
Name
Aircraft tracks
tracks
Scans














1
Dataset one
244
592
364


2
Dataset two
155
4905
7000


2
Dataset three
236
2686
5000


2
Dataset four
117
52
500









These datasets are good candidates for pattern analysis due to the nature of the data captured. Specifically, nearly all aircraft tracks within the datasets can be identified through the presence of SSR information. The SSR information is used, in part, for training purposes and also to calculate the performance of the classifier 24 in test mode, once it has been trained, before being used in general operation. There are also a small number of tracks that adhere to the behaviour of an aircraft, but lack associated SSR information. In the results presented, ground truth has been inferred with the presence of SSR data within a given track.
Several different test configurations may be used for the datasets to evaluate the performance of the classifier 24. In a first configuration, a portion of the dataset is selected randomly for training with the remaining left for testing the classifier 24. In second and third configurations, the classifier 24 is trained from a portion of a dataset taken from a site, and tested on datasets taken from different days from the same location. In a fourth configuration, the same trained classifier 24 from configurations two and three is tested on data from a different site. The training and testing procedures are repeated for a number of iterations based on random selection of the training data to obtain statistically reliable results and to avoid biasing the classifier 24 on a chosen data sequence. Successful classification results have been obtained by giving each track an updated probability value based on its likelihood of behaving like an aircraft or non-aircraft target.
In order to perform track segmentation and feature vector parameter selection, a set of candidate values were selected and used in training and testing of the classifier 24 using dataset one. In an effort to minimize the delay for the initial classification decision, the maximum number of plots forming a feature vector were limited to 8, which also represents the minimum track length encountered in the dataset as shown in the distribution plots of track length in FIGS. 8a and 8b for the aircraft and non-aircraft classes respectively.
In order to find the optimum classification parameter set, four different candidate configuration sets of parameters were considered, each with its constituents, limited to a maximum of 8 plots when forming a feature vector. These candidate sets are shown in Tables 3 to 6. These configuration parameter sets were selected to achieve the maximum segment and feature vector overlap for all valid segment and feature vector size pairs. This constraint translates to fixed values for kov and lov when n and m are set, as shown in equation 63.

kov=n−1

lov=m−1  (63)

Thus, the only free parameters become the track segment size, n, and the feature vector size, m, values of which are shown in Tables 3 through 6. Each parameter set is characterized uniquely by a quadruplet [n, m, kov−1, lov], where kov−1 has been used for notational purposes only. Also included in Tables 3 through 6 is the value of tp, the number of plots forming the feature vector, as determined by equation 30.








TABLE 3







Segmentation and feature vector parameters for group 1










Configuration parameter set















Parameter
[3-1-1-0]
[4-1-2-0]
[5-1-3-0]
[6-1-4-0]
[7-1-5-0]
[8-1-6-0]
Description





n
3
4
5
6
7
8
Segment size


kov
2
3
4
5
6
7
Segment overlap


m
1
1
1
1
1
1
Feature vector size


lov
0
0
0
0
0
0
Feature vector overlap


tp
3
4
5
6
7
8
Plots forming feature









vector
















TABLE 4







Segmentation and feature vector parameters for group 2










Configuration parameter set















Parameter
[3-2-1-1]
[3-3-1-2]
[3-4-1-3]
[4-2-2-1]
[4-3-2-2]
[5-2-3-1]
Description





n
3
3
3
4
4
5
Segment size


kov
2
2
2
3
3
4
Segment overlap


m
2
3
4
2
3
2
Feature vector size


lov
1
2
3
1
2
1
Feature vector overlap


tp
4
5
6
5
6
6
Plots forming feature









vector
















TABLE 5







Segmentation and feature vector parameters for group 3










Configuration parameter set















Parameter
[3-5-1-4]
[3-6-1-5]
[4-4-2-3]
[4-5-2-4]
[5-3-3-2]
[5-4-3-3]
Description





n
3
3
4
4
5
5
Segment size


kov
2
2
3
3
4
4
Segment overlap


m
5
6
4
5
3
4
Feature vector size


lov
4
5
3
4
2
3
Feature vector overlap


tp
7
8
7
8
7
8
Plots forming feature









vector
















TABLE 6







Segmentation and feature vector parameters for group 4










Configuration parameter set












Parameter
[6-2-4-1]
[6-3-4-2]
[7-2-5-1]
Description





n
6
6
7
Segment size


kov
5
5
6
Segment overlap


m
2
3
2
Feature vector size


lov
1
2
1
Feature vector overlap


tp
7
8
8
Plots forming feature






vector









For each candidate configuration parameter set, the resulting correct recognition rates were collected as a function of track length measured from the first plot of each track (i.e. track initiation). As such, the overall recognition rate as a function of the progression of track length was determined, and used to evaluate each configuration parameter set. For instance, given a track consisting of 30 plots, the classification results for this track will only be accounted for up to the 30th detection. For the range of detection values beyond 30, this track becomes inactive and its classification result will no longer be incorporated into the recognition rate calculation. Thus as the number of detections increase, the number of active tracks (with at least the required minimum number of plots) decreases and results in the average recognition rate being based on a smaller number of candidate tracks. As such, to avoid undue influence on the recognition rate due to a small number of active tracks, the maximum number of detections were limited such that at least 5% of all track segments for a given class remain unclassified for the current number of detections. In other words, the number of segments yet unclassified for all active tracks must account for no less than 5% of all segments. This 5% threshold is referred to as the active segment proportion threshold.
The results for parameter configuration group 1 as set out in Table 3 are shown in FIG. 9a for the aircraft class, FIG. 9b for the non-aircraft class, and for all classes in FIG. 9c. It can be observed that the recognition rate decreases with increased number of detections for the non-aircraft class. This is attributed to a small number of long-lived non-SSR sourced tracks that mimic aircraft behaviour as the number of detections increases. In fact, as will be shown below, these tracks may actually belong to small non-transponder aircraft, and as such are being classified correctly. However, due to the assumption that all aircraft tracks have SSR-sourced data, although the correct classification is made by the classifier 24, the recognition rate as a function of the number of detections is negatively affected. A higher active segment proportion threshold, which is the proportion of track segments that belong to tracks that are at least of a certain length, would alleviate such an anomaly. The results for parameter configuration groups 2, 3 and 4 are shown in FIGS. 10a-10c, 11a-11c and 12a-12c respectively. Similar to configuration group 1, the effects of long-lived non-SSR sourced tracks can be observed for the non-aircraft class.
The segmentation and feature vector parameter selection used by the classifier 24 is preferably adapted to obtain low false-rejection of aircraft targets while minimizing the false-acceptance rate of the non-aircraft targets. Moreover, the values of the parameter configuration set are selected to exhibit high recognition rates starting from the first few decisions for a given track, and to minimize the number of detections required for the initial decision. In addition, as shown in FIG. 8a, the proportion of short-lived tracks for the non-aircraft class is relatively high, and as such, the classifier 24 should preferably have good recognition rates within the first 50 detections for this class. With these issues in mind and based on the results of FIGS. 9a to 12c, the track segmentation and feature vector parameters of the classifier 24 may be selected as shown in Table 7.







TABLE 7







Exemplary segmentation and feature vector parameters











Parameter
Value
Description







n
5
Segment size



kov
4
Segment overlap



m
1
Feature vector size



lov
0
Feature vector overlap



p
2
Degree of fitting polynomial










For sample datasets one and three from Table 2, the features outlined in Table 1 were extracted, from which histogram plots were generated. The intent is to illustrate the distribution of classes among individual features in order to a select number of feature combinations limited to a maximum of three features per combination, for example, to facilitate illustration. FIGS. 15 through 32 illustrate the distribution of feature values among all feature vectors composed of a single feature for the datasets under consideration. The figures show the normalized histograms of the distributions either on a linear or log scale range. The purpose of the log scaling is to allow the overlap in feature space among the two classes to be observed. In this example, all feature values fed are the original unaltered linear values. In FIGS. 15 to 32, the solid red and outlined blue histograms represent the aircraft and non-aircraft classes respectively. The cluster distributions are evaluated using the proposed CPI.
As observed in FIGS. 15a and 15b, the variance in the normalized displacement of path shows that the aircraft class has less variance than the non-aircraft class. This is expected since non-aircraft targets are observed to have greater relative lateral movement in relation to their direction of movement, as can be observed in FIG. 13 from the sample tracks extracted from the dataset. It should be noted that to avoid overlap of track segments for the sample tracks presented, the segment overlap parameters were modified to a value of one. The lateral movement observed is quantified by fitting a second degree polynomial to each track segment, as shown in FIGS. 14a and 14b for the sample tracks shown in FIG. 13, and measuring the distance from the best fit trajectories for each track segment. The higher variance for non-aircraft targets also translates into a higher variance for this class when the sequential change in the displacement of path, var_delpth, from a fitting polynomial is determined. The resulting feature histogram plot is shown in FIG. 16. Similar observations can be made for the mean in the normalized displacement of path, avg_path, as shown in FIGS. 18a and 18b, and the sequential change in the displacement of path feature, avg_delpth, as shown in FIGS. 19a and 19b respectively.
The variance in the change of slope in relation to the direction of movement is lower for the aircraft class as shown in FIGS. 17a and 17b. This can be attributed to higher jitter in flight pattern by non-aircraft targets, which also results in the mean of the change of slope to be higher for the non-aircraft class as shown in FIGS. 20a and 20b. 
In FIGS. 21a and 21b, the variance in the second change of speed (jerk) is shown for the two classes. The high variance for the aircraft class can be attributed to the relatively higher velocity for this class in comparison to non-aircraft targets. As a result, other speed related features also exhibit higher variance and mean values for the aircraft class. Specifically, this relates to the variance in acceleration, the mean jerk, acceleration and speed features as shown in FIGS. 22a/22b, 24a/24b, 25a/25b and 26a/26b respectively. The mean speed feature histogram plot shown in FIGS. 26a and 26b confirms the notion that aircraft targets travel at higher velocities in comparison to non-aircraft targets, which consists mainly of birds for the dataset one and birds, AP and ground clutter for dataset three. It is observed that for this feature, the distributions across datasets are less consistent than those of other features, however, contradictory regions are not observed and classification is still feasible.
As expected from the higher velocity of aircrafts, the distance traveled by the target within a duration of a segment results in a larger sum for the aircraft class, with some overlap among the classes attributed to slower moving aircrafts. The feature histogram plot for the sum of distance traveled is shown in FIGS. 23a and 23b. It should be noted that for dataset three, although the aircraft targets are concentrated about the 2.5 nmi distance, in comparison to dataset one, the same range in distance is covered by the class. In comparison, the non-aircraft class has a consistent distribution among the two datasets.
The aircraft class consists of larger targets with transponders, which are more easily detected by the radar. As such, missed detections are less frequent for the aircraft class in comparison to the non-aircraft class as observed in FIGS. 27a and 27b. 
The type of non-aircraft has an influence on the mean range features as shown in FIGS. 28a and 28b, in which the non-aircraft class is undetected beyond a range of 41 nmi. This can also be attributed to the type of non-aircraft target observed in the dataset. Although the returns from birds or flocks of birds at long ranges may be detected by the radar, due to the presence of noise and the non-rigid form of the target (in the case of flocks), the targets may become untrackable.
For the cross sectional features, namely mean amplitude, peak amplitude and the number of detections combined to form a plot, the variance and mean of the features have observably inconsistent behaviour across the two datasets as shown in FIGS. 29a through 32b. This is attributed to the abundant presence of AP in dataset three. Specifically, two distributions can be observed for the non-aircraft class, with one corresponding to AP, and the other to the birds within the dataset.
It should be noted that although individual features may exhibit more or less discriminatory and consistent behaviour, it is the combination of features that determines the performance of a classifier. It may be the case that two features, each with overlapping class histograms, combine to form separable class clusters, whereas another two features with little overlap result in a combined feature space with some overlapping class clusters. In one exemplary implementation, the combination of three features will be described below. Although a select number of two feature combinations are shown herein, other combinations are possible.
FIGS. 33a through 36b extend the feature histogram plots to two features. As in the single feature case, the histograms have been normalized, however, only the class of interest, as labelled above each diagram, is shown in each plot. The overlap of clusters must be inferred by comparing histograms of the same features for the different classes. For instance, FIGS. 33a to 35b show feature combinations with some cluster overlap. Conversely, the histograms shown in FIG. 36a have poor separability as observed by the overlapped non-aircraft class by the aircraft class features, and are inconsistent with dataset three shown in FIG. 36b. These observations also help to validate the effectiveness of the proposed CPI.
In FIGS. 33a and 33b, the cluster overlap in the variance of speed feature is shown to have improved separation with the inclusion of the variance in the change of displacement of path feature. The addition of a feature space cannot reduce separability or increase class overlap due to the orthogonal combination of the feature spaces. In the case of the combination shown in FIGS. 33a and 33b, improvement in the cluster separation and reduced overlap are evident, however, the combination of the mean of speed and mean of the mean amplitude features shown in FIG. 34a show very little improvement in separability in comparison to the mean speed feature alone. In contrast, FIG. 34b illustrates the case of improved separability over the mean of speed feature alone. FIGS. 35a and 35b show similar overlap to FIGS. 33a and 33b, whereas the separability is greatly improved. However, for the combination of the mean range and mean detection features shown in FIG. 36a, there is poor separability and a high degree of overlap for the classes. More notably, the non-aircraft class shows inconsistent behaviour among the datasets for the features shown in FIGS. 36a and 36b. 
FIGS. 37a and 37b show the feature plots for three select features. In contrast to the histogram distribution plots presented in FIGS. 15 through 36, the feature distribution and class overlap must be inferred for the three feature plots. As shown, the feature combination exhibits good separability with slight overlap. This feature combination can be evaluated using the proposed CPI2.
Feature evaluation was performed to obtain CPI2 values for individual features, feature combinations, and various feature sets as shown in FIGS. 38 to 40 respectively. For individual features, combination of features, and feature sets that include any extension derived features, segments without extension data are excluded in the CPI2 calculation. This applies namely to features f15 through f18, and thus also to the all features and radar cross section sets, resulting in the exclusion of up to 45% of aircraft track segments in the datasets. This limitation only applies to feature evaluation from labeled data. In the case of an unknown track, the lack of extension data implies an SSR source, and thus it is definitively known that the target is in fact an aircraft. To illustrate feature evaluation without exclusion of any track segments, all principal sourced features have been combined into the Trajectory of path and velocity set shown in FIG. 40. In addition, by formally defining the function C(F) as the CPI2 calculation on a combination of features F, where F=[Fl1, Fl2 . . . Fln] and {li, i=1 . . . n}⊂{1 . . . 18}, herein defined,

C(F)=C([Fl1 Fl2 . . . Fln])  (64)

comparisons can be made on the feature average,





  
    
      
        
          
            C
            F
          
          _
        
        =
        
          
            1
            n
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              n
            
            ⁢
            
              C
              ⁡
              
                (
                
                  F
                  
                    l
                    i
                  
                
                )
              
            
          
        
      
    
    
      
        (
        65
        )
      
    
  




for the features under consideration.

The experimental results in FIGS. 38 through 40 show that principal features outperform extension derived features. However, the inventors have found that the combination of all features results in the most distinguishing feature set, indicating the robustness of the feature sets in capturing the unique characteristics of the data. This is further supported by observing that all combination of features shown outperform their individual constituents when comparing C(F) to the feature average, CF. More specifically, the CPI2 for all observed feature sets well outperform the mean of CPI2 values for individual features.
In one implementation, based on the experimental results shown herein, a non-linear SVM using the radial basis function kernel outlined in equation set 41 may be used to implement the classifier stages 62 and 66. Using a non-linear SVM to implement the classifier stages 62 and 66 should allow for non-linearly separable data to be classified better than by means of a linear classifier. Further, based on the experimental results herein, the SVM parameters have been empirically set to the values shown in Table 8. The values chosen provided good overall performance, without undue bias towards a single class.







TABLE 8







SVM parameters











Parameter
Value
Description







σ
2
RBF kernel parameter



C
1
SVM control parameter










The training procedure for the SVM classifiers 62 and 66 used to generate the experimental results is as outlined previously. The results presented herein have been obtained by randomly selecting a portion of the dataset for training with the remaining data left for testing the classifiers 62 and 66 in the case of test configuration 1, and distinct training sets for test configurations 2 through 4. This process has been repeated for random and independent iterations to obtain statistically reliable results as outlined in Table 9.







TABLE 9







Training and testing configuration parameters











Config. 1
Config. 2
Config. 3














Training set
Dataset one
Dataset one
Dataset one


Proportion of aircraft
25%
Up to 1000
Up to 1000


in training set

segments
segments


Proportion of non-
25%
Up to 1000
Up to 1000


aircraft in training

segments taken
segments taken


set

from 250 random
from 250




tracks
random tracks


Testing set
Dataset one
Dataset two
Dataset three


Proportion of aircraft
75%
100%
100%


in testing set


Proportion of non-
75%
100%
100%


aircraft in testing set


Iterations
100
100
100









To illustrate the behaviour of PSR-solo targets encountered in each dataset, time-elapsed track history plots have been generated as shown in FIGS. 41 to 44. In dataset one shown in FIG. 41, the PSR-solo targets appear to be migratory birds with the exception of one non-transponder aircraft track as indicated. The bird tracks possess a consistent heading indicative of migratory flight behaviour. For dataset two shown in FIG. 42, the PSR-solo data is typical of small birds and insects. Also as indicated in the figure, data from 0.25 nmi to 6.5 nmi are mainly attributed to false targets due to ground clutter and AP with some birds. It should be noted that the false targets generated by the short pulse Sensitivity Time Control (STC) steps exhibit themselves as rings within the 6.5 nmi range. These false targets become more evident in dataset three as shown in FIG. 43. The remainder of the PSR-solo tracks within this dataset can be attributed to large birds. Finally, FIG. 44 shows PSR-solo tracks belonging to birds within the regions outlined in the figure for dataset four.
As previously mentioned, these dataset are useful candidates for facilitating pattern analysis whereby ground truth can be reasonably inferred from the data by the presence of SSR data. Although this assumption fares well for these datasets, it may not be valid for other datasets. As such, ground truth may need to be established for subsequent training sets by other means, including manual classification. As an exercise to examine the robustness of the classifier 24 based on dataset four, the trained classifier 24 was tested against unlabelled data from other sources, and the classification results are presented herein as track labels in the form of probability values.
The evaluation of the experimental results is based on the correct recognition rate of entire tracks within the dataset. As such, classification of a track is taken as the accumulated result obtained after an entire track is processed by the classifier 24. In terms of the track label for a given track, this is represented by:




  
    
      
        
          Y
          iT
        
        =
        
          sign
          ⁡
          
            (
            
              
                ∑
                
                  t
                  =
                  
                    T
                    0
                  
                
                
                  T
                  1
                
              
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  2
                
                ⁢
                
                  
                    [
                    
                      
                        
                          θ
                          it
                        
                        ⁢
                        
                          k
                          j
                        
                      
                      +
                      
                        
                          (
                          
                            1
                            -
                            
                              θ
                              it
                            
                          
                          )
                        
                        ⁢
                        
                          (
                          
                            2
                            -
                            j
                          
                          )
                        
                      
                    
                    ]
                  
                  ⁢
                  
                    y
                    ijt
                  
                
              
            
            )
          
        
      
    
    
      
        (
        66
        )
      
    
  




where the relative proportion of the features used are 0.778 for k1 and 0.222 for k2, T0 represents the time instant of the first track segment, and T1 is the time instant of the last segment for the track. The relative proportion of the features may be tuned for other embodiments for making the classifier 24 more sensitive to identifying certain types of target tracks. This is equivalent to equation 53 given yijt is zero outside of this interval (i.e. yijt=0 for t∉[T0, T1]). Histograms of individual class and overall correct recognition rates are shown in FIGS. 45a to 45c. The mean recognition rates are indicated on each normalized histogram and summarized in Tables 10 through 13 along with the standard deviation and range of recognition rates. For results for each configuration shown, the range values have been given for all recognition rates, [0,100], and after ignoring the highest and lowest 10% of values, [10,90].








TABLE 10







Recognition rate statistics for data configuration 1









Track
Standard
Percentile Range











Class
Mean
Deviation
[0, 100]
[10, 90]





Aircraft
96.86%
1.6229
[89.62%, 98.91%]
[94.54%, 98.91%]


Non-
99.14%
0.3159
[98.12%, 100.0%]
[98.65%, 99.55%]


aircraft


All
98.48%
0.4874
[96.33%, 99.68%]
[97.93%, 99.04%]
















TABLE 11







Recognition rate statistics for data configuration 2









Track
Standard
Percentile Range











Class
Mean
Deviation
[0, 100]
[10, 90]





Aircraft
98.70%
0.0908
[98.06%, 98.71%]
[98.71%, 98.71%]


Non-
95.74%
0.9360
[92.56%, 97.57%]
[94.72%, 96.94%]


aircraft


All
95.83%
0.9067
[92.75%, 97.59%]
[94.84%, 97.00%]
















TABLE 12







Recognition rate statistics for data configuration 3









Track
Standard
Percentile Range











Class
Mean
Deviation
[0, 100]
[10, 90]





Aircraft
98.53%
0.2787
[97.46%, 99.15%]
[98.31%, 98.73%]


Non-
97.97%
1.0861
[93.82%, 99.44%]
[96.57%, 99.18%]


aircraft


All
98.02%
0.9905
[94.18%, 99.38%]
[96.75%, 99.11%]









FIG. 46 shows a randomly selected 25% subset of the tracks in the dataset with the corresponding classification results for configuration 1. Similarly, FIGS. 47 through 48 show the same results for a random 10% subset of configurations 2 through 4 respectively. In each case, a subset of the dataset has been selected to help in the presentation of the results without excessive obstruction of tracks due to congestion. In the figures, the color bar represents the degree of conformity to aircraft behaviour with 100 representing a classified aircraft track and 0 representing a classified non-aircraft track. Tracks classified as non-aircraft have lower colour value as indicated on the colour bar, and may be shown on a separate radar screen. The classification is based on a threshold value, which has been set at 50, for example, in this case. Other values may also be used for the classification. As shown by the experimental results for configuration 1 in Table 10, the mean recognition rates for the classes are in excess of 98% with low variance.
The false acceptance rate for a class is inferred by the incorrect recognition rate of the opposite class, and the false rejection rate inferred by the incorrect recognition rate of the class itself. The results favour the intended task of identifying aircraft. Specifically, the aircraft class has a false rejection rate of 3.14%, and a false acceptance rate of 0.86%. The relatively higher false acceptance rate is permissible when classifying to suppress excess tracks, since possible aircraft-like tracks will not be discarded. The false acceptance and rejection rates for all configurations are summarized in Table 13.







TABLE 13







False acceptance and rejection rates for the aircraft class









Data Configuration












Metric
1
2
3







False acceptance rate
0.86%
4.26%
2.03%



False rejection rate
3.14%
1.30%
1.47%










The moderate false acceptance rate for data configurations 2 and 3 may be attributed to the presence of false tracks within the datasets resulting in non-SSR sourced high speed tracks, which are classified as behaving more closely to aircraft. These observations may change based on improved feature lists.
It is also observed that some non-aircraft tracks can arguably belong to a small aircraft or a large flock of birds, whereas the remaining tracks are too short to belong to any aircraft. It should be noted that the total length of an active track is unknown a priori and as such a criteria for the minimum length of a track cannot be used in classification, as it would not be applicable for a real-time system. For misclassified aircraft tracks, the short-lived or highly maneuvering behaviour is evident.
FIGS. 49a, 49b, and 49c show that the misclassified tracks appeared in at least 30% of the total trials. The color bar in these Figures represents the degree of nonconformity to the actual behaviour of the class, with 100 representing a misclassified track and 0 representing a correctly classified track. An exemplary threshold of 50 has been used in this exemplary implementation to distinguish between true and false classification. Misclassified aircraft tracks are inferred by the presence of SSR data, whereas misclassified non-aircraft tracks are inferred by the absence of SSR data, as shown for data configuration 1 (FIG. 49a), data configuration 2 (FIG. 49b), and data configuration 3 (FIG. 49c).
The experimental classification results provide good evidence that machine target classification is viable and can work in real time. An SVM-based classifier only requires support vectors to be saved and thus represents a data reduction from the original training set. This also reduces memory requirements during classification. The datasets used have provided a means of instantiating ground truth using SSR data, however in working with other datasets, other means to determine ground truth may be required.
The elements of the radar system 10 described herein may be implemented through any means known in the art although the use of dedicated hardware such as a digital signal processor may be preferable. Alternatively, discrete components such as filters, comparators, multipliers, shift registers, memory and the like may also be used. Furthermore, certain components of the radar system 10 may be implemented by the same structure and augmented to operate on different data such as providing a single classification stage that performs processing of the extension and principal feature processing stages 60 and 64, as well as the extension and principal classifier stages 62 and 66. The elements of the radar system 10 disclosed herein may also be implemented via computer programs which may be written in Matlab, C, C++, LabviewTM or any other suitable programming language embodied in a computer readable medium on a computing platform having an operating system and the associated hardware and software that is necessary to implement the radar system 10. Such computer programs comprise computer instructions that are adapted to perform the steps performed by the classifier 24. The computer programs may comprise modules or classes, as is known to those skilled in object oriented programming, that are implemented and structured according to the structure of the classifier 24 and other components of the radar system 10.
It should be noted that it is optional to include the classification of previous track segments for a given radar track to classify the current radar track segment. Further, the pre-processing stage may be attached to the plot extractor or the detector and form a track segment from a number of previous detections belonging to a radar track in online operation or it may segment a given radar track into a plurality of radar track segments in off-line operation. There may also be a delay that is used so that the pre-processing stage segments a given radar track into a plurality of radar track segments. In addition, it should be noted that principal data includes velocity, range and beam information common to both the primary and secondary radar data. Also, extension data includes amplitude information.
It should be understood that various modifications can be made to the embodiments described and illustrated herein, without departing from the invention, the scope of which is defined in the appended claims.

## Claims

1. A classifier for classifying a given radar track segment obtained from a radar system, the radar system having a primary surveillance radar for providing primary radar data and a secondary surveillance radar for providing secondary radar data, wherein the classifier comprises:
a) a pre-processing stage, the preprocessing stage forms the given radar track segment and generates principal data based on the primary radar data or a combination of secondary and primary radar data, and extension data based on the primary radar data;
b) a feature extraction stage connected to the pre-processing stage, the feature extraction stage processes at least one of the primary and secondary radar data associated with the given radar track segment to provide a plurality of feature values;
c) a classification stage connected to the feature extraction stage, the classification stage generates a principal classification result and an extension classification result for the given radar track segment based on at least a portion of the feature values; or the classification stage generates a combined classification result for combined principal and extension feature values; and,
d) a combiner stage connected to the classification stage, the combiner stage combines the extension and principal classification results to provide a classification result for the given radar track segment when the classification stage provides the principal and extension classification results.

2. The classifier of claim 1, wherein one of the features calculated by the feature extraction stage includes at least one of:
(1) calculating a variance in the second difference of the speed (jerk) of the target associated with the given radar track segment;
(2) calculating a mean of the second difference of the speed (jerk) of the target associated with the given radar track segment;
(3) calculating a variance in the first difference of the speed (acceleration) of the target associated with the given radar track segment;
(4) calculating the total distance covered by the given radar track segment;
(5) calculating a mean of the first difference of the speed (acceleration) of the target associated with the given radar track segment;
(6) calculating the mean speed of the target associated with the given radar track segment;
(7) calculating the mean number of radar scans between successive plots used to generate the given radar track segment;
(8) calculating the mean range of the target associated with the given radar track segment;
(9) calculating a mean of the range-compensated mean amplitude of the data points in plots associated with the given radar track segment;
(10) calculating a mean of the range-compensated peak amplitude of the data points in plots associated with the given radar track segment;
(11) calculating a mean difference of the range-compensated peak and mean amplitudes of the data points in plots associated with the given radar track segment;
(12) calculating a mean of the total number of detection points in plots associated with the given radar track segment;
(13) calculating a variance in the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line;
(14) calculating a variance in the first difference of the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line;
(15) calculating a variance in the first difference of the slope of the given radar track segment;
(16) calculating a mean of the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line;
(17) calculating a mean of the first difference of the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line; or
(18) calculating a mean of the first difference of the slope of the given radar track segment.

3. A method for classifying a given radar track segment obtained from a radar system, the radar system having a primary surveillance radar for providing primary radar data and a secondary surveillance radar for providing secondary radar data, wherein the method comprises:
a) forming the given radar track segment and generating principal data based on the primary and secondary radar data, and extension data based on the primary radar data;
b) processing at least one of the primary and secondary radar data associated with the given radar track segment and a portion of a previous associated radar track segment to provide a plurality of feature values;
c) generating either a principal classification result and an extension classification result or a combined classification result for combined principal and extension feature values for the given radar track segment based on at least a portion of the feature values; and,
(d) combining the extension and principal classification results to provide a classification result for the given radar track segment when the principal and extension classification results are generated.

4. The method of claim 3, wherein step (b) includes one of:
calculating one of the features based on a variance in the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line;
calculating one of the features based on a variance in the first difference of the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line;
calculating one of the features based on a variance in the first difference of the slope of the given radar track segment;
calculating one of the features based on a mean of the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line;
calculating one of the features based on a mean of the first difference of the displacement of the path of the given radar track segment from a polynomial least-squares best-fit line;
calculating one of the features based on a mean of the first difference of the slope of the given radar track segment;
calculating one of the features based on a variance in the second difference of the speed (jerk) of the target associated with the given radar track segment;
calculating one of the features based on a variance in the first difference of the speed (acceleration) of the target associated with the given radar track segment;
calculating one of the features based on the total distance covered by the given radar track segment;
calculating one of the features based on a mean of the second difference of the speed (jerk) of the target associated with the given radar track segment;
calculating one of the features based on a mean of the first difference of the speed (acceleration) of the target associated with the given radar track segment;
calculating one of the features based on a mean speed of the target associated with the given radar track segment;
calculating one of the features based on the mean number of radar scans between successive plots used to generate the given radar track segment;
calculating one of the features based on the mean range of the target associated with the given radar track segment;
calculating one of the features based on a mean of the range-compensated mean amplitude of the data points in plots associated with the given radar track segment;
calculating one of the features based on a mean of the range-compensated peak amplitude of the data points in plots associated with the given radar track segment;
calculating one of the features based on a mean difference of the range-compensated peak and mean amplitudes of the data points in plots associated with the given radar track segment; or
calculating one of the features based on a mean of the total number of detection points in plots associated with the given radar track segment.

5. The method of claim 3, wherein the method includes receiving a given radar track from a track generator of the radar system and step (a) includes segmenting the given radar track to provide the given radar track segment and associated radar track segments.

6. A classifier comprising:
a) a pre-processing stage adapted to receive raw track data and to segment the raw track data to provide a plurality of track segment data for a given track;
b) a feature extraction stage coupled to receive the track segment data from said pre-processing stage and to operate upon the track segment data to provide a plurality of feature values; and
c) a classification stage coupled to operate upon the plurality of feature values provided by said feature extraction stage to provide a classification result.

7. The classifier of claim 6 adapted to classify a target obtained from a system having a sensor subsystem which provides primary data and optionally secondary data to the classifier.

8. A classifier comprising:
a) a pre-processing stage adapted to receive raw track data and to segment the raw track data to provide a plurality of track segment data for a given track;
b) a feature extraction stage coupled to receive the track segment data from said pre-processing stage and to operate upon the track segment data to provide a plurality of feature values; and
c) a classification stage coupled to operate upon the plurality of feature values provided by said feature extraction stage to provide a classification result wherein the classifier is adapted to classify a target obtained from a system having a sensor subsystem which provides primary data and optionally secondary data to the classifier and wherein the sensor subsystem includes a transponder subsystem for providing the optional secondary data.

9. The classifier of claim 7 wherein:
the preprocessing stage forms a track segment for the given track and generates principal data based upon the primary data or a combination of secondary and primary data, and extension data based upon the primary data;
the feature extraction stage processes at least one of the primary and secondary data associated with the given track to provide a plurality of feature values; and
the classification stage generates a principal classification result and an extension classification result for the track segment of the given track based upon at least a portion of the feature values or the classification stage generates a combined classification result based upon at least a portion of the feature values.

10. The classifier of claim 9 further comprising a combiner stage coupled to said classification stage wherein the combiner stage combines the extension and principal classification results to provide a classification result for the track segment when the classification stage provides the principal and extension classification results.

11. The classifier of claim 10 wherein the sensor subsystem comprises a radar system having a primary surveillance radar and a secondary surveillance radar and wherein the primary data corresponds to primary radar data provided by the primary surveillance radar and the secondary data corresponds to secondary radar data provided by the secondary surveillance radar and each track segment corresponds to a radar track segment.

12. The classifier of claim 11, wherein the combiner stage further combines the combined classification result or the extension and principal classification results with the classification result of at least one previous radar track segment associated with the given radar track segment to provide a classification result for the given radar track segment.

13. The classifier of claim 12, wherein the classification stage includes:
a) a principal feature classifier path coupled to the feature extraction stage, the principal feature classifier path generates the principal classification result; and,
b) an extension feature classifier path coupled to the feature extraction stage, the extension feature classifier path generates the extension classification result.

14. The classifier of claim 13, wherein the extension feature classifier path includes:
a) an extension feature processing stage coupled to the feature extraction stage, the extension feature processing stage receives the plurality of feature values based upon the extension data for the given radar track segment to generate an extension feature vector wherein each entry in the extension feature vector is calculated from either the given radar track segment or the given radar track segment and associated radar track segments, and post-processes the extension feature vector to determine characteristics that should be provided to a classifier; and,
b) an extension feature classifier stage coupled to the extension feature processing stage, the extension feature classifier stage classifies the post-processed extension feature vector to provide the extension classification result.

15. The classifier of claim 13, wherein the principal feature classifier path includes:
a) a principal feature processing stage coupled to the feature extraction stage, the principal feature processing stage receives the plurality of feature values based upon the principal data for the given radar track segment to generate a principal feature vector wherein each entry in the principal feature vector is calculated from either the given radar track segment or the given radar track segment and associated radar track segments, and post-processes the principal feature vector; and,
b) a principal feature classifier stage coupled to the principal feature processing stage, the principal feature classifier stage classifies post-processed principal feature vector to provide the principal classification result.

16. The classifier of claim 13, wherein at least one of the extension feature classifier path and the principal feature classifier path employ a machine learning technique for performing classification.

17. The classifier of claim 16, wherein the machine learning technique for performing classification includes at least one of: (a) a linear Support Vector machine; and (b) a non-linear Support Vector machine.

18. The classifier of claim 11, wherein the pre-processing stage is coupled to the combiner stage for providing an indication of whether secondary radar data is associated with the given radar track segment, wherein the indication is used to forego the feature extraction and classification stages and classify the given track segment as being indicative of an aircraft.

19. The classifier of claim 6, wherein the pre-processing stage generates the track segment data for the given track segment to overlap at least one previously related track segment.

20. The classifier of claim 15, wherein at least one of the feature processing stages generates one of the feature vectors based upon at least one of:
(a) the track segment for the given track and overlapping associated radar track segments; and
(b) a portion of the feature values for the track segment for the given radar track.

21. The classifier of claim 11, wherein the classifier is coupled to a track generator of the radar system to receive a given radar track and the pre-processing stage segments the given radar track to provide the given radar track segment and associated radar track segments.

22. The classifier of claim 11, wherein:
the classifier is coupled to a plot extractor of the radar system to receive a plurality of detections from a series of plots, the plurality of detections being associated with a given target; and
the pre-processing stage forms the given radar track segment and associated radar track segments from the plurality of detections.

23. The classifier of claim 7, wherein at least one of the primary radar data and the secondary radar data are used for training and testing at least one of: (1) the feature extraction stage; (2) the classification stage; and (3) the combiner stage.

24. A method for classifying a given observation obtained from a sensor system, the sensor system having a sensor subsystem for providing primary data and optionally a transponder system for providing secondary data, wherein the method comprises:
a) receiving raw track data;
b) segmenting the raw track data to provide a plurality of track segment data for a given track;
c) operating on the track segment data to provide a plurality of feature values; and
d) operating on the plurality of feature values to provide a classification result for the given track segment.

25. A method for classifying a given observation obtained from a sensor subsystem, the sensor system having a sensor subsystem for providing primary data and optionally a transponder system for providing secondary data, wherein the method comprises:
a) receiving new track data;
b) segmenting the raw track data to provide a plurality of tract segment data for a given track;
c) operating on the track segment data to provide a plurality of feature values; and
d) operating on the plurality of feature values to provide a classification result for the given track segment wherein segmenting the raw track data to provide a plurality of track segment data for a given track includes:
(1) generating principal data based upon the primary and secondary data; and
(2) generating extension data based upon the primary data.

26. The method of claim 25 wherein operating on the plurality of feature values to provide a classification result for the given track segment includes:
generating a principal classification result;
generating an extension classification result;
combining the extension classification result and the principal classification result to provide a classification result for the given track when the principal and extension classification results are generated and the method further comprises:
combining one of the combined classification result or the extension and principal classification results with the classification result of at least one previous track segment associated with the given track segment to provide a classification result for the given track segment.

27. The method of claim 26, wherein (d) includes:
1) receiving a plurality of feature values based upon the extension data for the given track segment;
2) generating an extension feature vector using at least a plurality of feature values based upon the extension data wherein each entry in the extension feature vector is calculated from either the given track segment or the given track segment and associated track segments;
3) post-processing the extension feature vector to determine characteristics that should be provided to a classifier; and
4) classifying the post-processed extension feature vector to provide the extension classification result.

28. The method of claim 27 wherein step (d) further includes:
5) receiving a plurality of feature values based upon the principal data for the given track segment;
6) generating a principal feature vector using at least the plurality of feature values based upon the extension data wherein each entry in the principal feature vector is calculated from either the given track segment or the given track segment and associated track segments; 7) post-processing the principal feature vector to determine characteristics that should be provided to a classifier; and
8) classifying the post-processed principal feature vector to provide the principal classification result.

29. The method of claim 28, wherein the sensor system is a radar system having a primary surveillance radar and a secondary surveillance radar and wherein the primary data corresponds to primary radar data and the secondary radar corresponds to secondary radar data and wherein (a) includes providing an indication of whether secondary radar data is associated with the given radar track segment, wherein the indication is used to forego processing and classification performed by (b)-(c) and classifying the given radar track segment as being indicative of an aircraft in (d).

30. The method of claim 29, wherein (b) includes forming the given track segment such that the given track segment overlaps at least one previous related track segment.

31. The method of claim 30, wherein at least one of (d)(2) and (d)(6) include at least one of:
a) generating the feature vector based upon the given track segment and overlapping associated radar track signals; and
b) generating the feature vector based upon repeating a portion of the feature values for the given radar track segment.

32. The method of claim 24, wherein the method includes assessing the features according to:
a) calculating a plurality of feature values for several of the features based upon a plurality of training radar track segments;
b) partitioning the plurality of feature values calculated for at least one feature into a plurality of classes;
c) randomly picking classified points for each class and calculating the number of mis-classified radar track segments; and,
d) computing a performance index based upon the number of mis-classified radar track segments for assessing either one of the features or a combination of the features.