Abstract:
A moving object is classified by transmitting, by a linear array of transmit antenna elements, a microwave into a surveillance area. A scattered microwave backprojected from a moving object is received by a linear array of receive antenna elements. Features are extracted from the scattered microwave related to a spiral evolution of the scattered microwave. The moving object is then classified as one of a set of possible classes according to the extracted features, and an alarm signal can be generated indicating the selected class.

Description:
FIELD OF THE INVENTION 
       [0001]    This invention relates generally to microwave back-projection radar, and more particularly to using microwave back-projection radar for surveillance. 
       BACKGROUND OF THE INVENTION 
       [0002]    Sensors, e.g., infrared sensors and cameras, are most frequently used for surveillance. Infrared sensors are relatively cheap. However, infrared sensors can only detect binary events, i.e., whether there is an intrusion or not. Cameras are relatively expensive, and based surveillance system become complex when it is desired to identify and classify objects in their field of view. 
         [0003]    In both cases, the detection area is limited by a relatively small field of view, and therefore a large number of sensors must be used for wide-area surveillance. 
         [0004]    Microwave back-projection can also be used for wide-area surveillance. Microwaves are electromagnetic (EM) waves with wavelengths shorter than one meter and longer than one millimeter, or frequencies between 300 megahertz and 300 gigahertz. (UHF, SHF, EHF). 
         [0005]    An incident microwave is transmitted by a transmitting antenna array, which is a “leaky” coaxial cable. The leaky coaxial cable has slots punched into the outer conductor sheath that radiate the microwave, which is received by a receiver antenna array that is also a leaky coaxial cable with slots. 
         [0006]    A moving object “scatters” the received signal, see Inomata et al., “Microwave back-projection radar for wide-area surveillance system,” 34th European Microwave Conference, 2004. Volume 3, Issue, 11-15, pages 1425-1428, October 2004, incorporated herein by reference. They used a spread spectrum technique that combines IQ demodulation with complex FFT to obtain a two-dimensional space representation of the scattered wave. The spread of the microwave in this space was used to detect intruders. However, because their technique only analyzes the overall level of the electromagnetic field, they can only detect binary intrusion events, like an infrared sensor. That is, they cannot distinguish the kind of intruder (human, vehicle, animal, etc.) that entered the observed space. 
       SUMMARY OF THE INVENTION 
       [0007]    A receiver acquires a microwave scattered by a moving object in the complex space. Signal features are extracted. The features are classified to determine a class for the moving object. Then, an alarm signal can be generated according to the class of the moving object. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0008]      FIG. 1  is a block diagram of a surveillance system according to an embodiment of the invention; 
           [0009]      FIG. 2  is a block diagram of a sliding time-window used by the invention; and 
           [0010]      FIG. 3  is a flow diagram of a surveillance method according to an embodiment of the invention. 
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
       [0011]      FIG. 1  shows a microwave back-projection radar system according to an embodiment of our invention. The system includes a transmitter  110  and a receiver  120 . The transmitter and receiver are connected to “leaky” coaxial cables  111  and  121 , respectively. The coaxial cables act as a transceiver antenna array. The cables can be arranged at a perimeter of an area  105  to be placed under surveillance. 
         [0012]    The first cable  111  transmits an incident microwave  101 , and the second cable  121  receives  120  a microwave  102  scattered by a moving object  103  between the two cables. The scattered microwave  102  is classified  130  as described below by extracting features from the received microwave. Depending on the classification, an alarm signal  140  can be generated identifying the moving object as, e.g., a man or a mouse. It should be noted that multiple different objects can be detected and classified concurrently. 
         [0013]    The presence of the object is indicated by a measured displacement  104  in the received microwave. When the object  103  is moving, the representation of the received microwave signal in the complex space translates and rotates. That is, its phase changes proportionally to the movement of the object and the phase moves away from its “no-motion” position in the complex space. This generates the spiral displacement  104 . Therefore, the features that we extract relate to the spiral evolution  104  of the scattered microwave. The features that we extract can be based on curvilinear distances (CURVD) or kernel principal component analysis (KPCA) of the spiral evolution. 
         [0014]    It should be noted, that Inomata et al. do not extract spiral based features, and do not classify moving objects. 
         [0015]    The displacement measurements can then be used by any classifier, such as support vector machines (SVM), k-nearest neighbor (k-NN), or a naïve Bayes classifier to classify an object scattering the microwave. A naïve Bayes classifier is a simple probabilistic classifier based on applying Bayes&#39; theorem with strong (naïve) independence assumptions. We also describe a sorted naïve Bayes classifier (SNBC), which can effectively classify the type the object without being affected by a position of the object along the receiving antenna array  121 . 
         [0016]    As shown in  FIG. 2 , we use a sliding time-window  200 . The window can be fixed or variable, depending dynamic conditions in the surveillance area, or the detecting precision desired. A size of the sliding window is N samples x 1 , x 2 , . . . x N , where x 1  is the first sample  201 , and x N  the last sample  202  in the window. For each next sample, the first is sample is discarded, and the next sample becomes the last sample. 
         [0017]    Curvilinear Distance (CURVD) 
         [0018]    In one embodiment, the features to be classified are total curvilinear distance traversed as a result of scattering and is expressed as 
         [0000]    
       
         
           
             CURVD 
             = 
             
               
                 ∑ 
                 
                   i 
                   = 
                   2 
                 
                 N 
               
                
               
                   
               
                
               
                 
                   
                     ( 
                     
                       
                         x 
                         
                           i 
                           - 
                           1 
                         
                       
                       - 
                       
                         x 
                         i 
                       
                     
                     ) 
                   
                   2 
                 
                 . 
               
             
           
         
       
     
         [0019]    Because the samples are generated and analyzed continuously, the CURVD features can be efficiently updated as new samples are received. CURVD old  is the current distance measure over the contents of the sliding window of size N. To include the last sample x new  into the sliding window, the first sample x 1  is discarded. The new curvilinear distance CURVD new  is 
         [0000]      CURVD new =CURVD old +( x   N   −x   new ) 2 −( x   1   −x   2 ) 2    
         [0020]    After a new curvilinear distance is obtained, x 1  is discarded. This makes x 2  the first sample in the window, and sample x new  is inserted as the last sample in the sliding time-window. 
         [0021]    Kernel Principal Component Analysis (KPCA) 
         [0022]    In another embodiment, the features are eigen-values obtained by a linear eigen-value analysis given a measure of the displacement of the samples along a rectangular axis. However as we described above, the axis of displacement is along a spiral. To measure the displacement along a curvilinear axis, we use the eigen-values from a kernel principal component analysis (KPCA), see Schölkopf et al., “Kernel principal component analysis,” Advances in Kernel Methods—Support Vector Learning, pages 327-352. MIT Press, Cambridge, Mass., 1999, incorporated herein by reference. 
         [0023]    KPCA is a method of non-linear feature extraction. The eigen-values obtained using the KPCA yield a more accurate measure of displacement along the curvilinear axis. 
         [0024]    An input sample set is {{right arrow over (x)}ε           n }, for x 1  to x N . The distribution of the samples is along a non-linear axis. The samples can be linearized by non-linearly mapping the samples to a feature space Φ({right arrow over (x)})εF. The mapping Φ is defined implicitly, by specifying the form of the dot product in the feature space. So, for an arbitrary pair of mapped samples {right arrow over (x)} and {right arrow over (y)}, the dot product is defined in terms of some kernel function. Thus, 
         [0000]      Φ({right arrow over ( x )})Φ({right arrow over ( y )})≡ K ({right arrow over ( x )},{right arrow over ( y )}). 
         [0000]    An example of a common kernel is the Gaussian kernel 
         [0000]    
       
         
           
             
               
                 K 
                  
                 
                   ( 
                   
                     
                       x 
                       → 
                     
                     , 
                     
                       y 
                       → 
                     
                   
                   ) 
                 
               
               = 
               
                 exp 
                 ( 
                 
                   - 
                   
                     
                        
                       
                         
                           x 
                           → 
                         
                         - 
                         
                           y 
                           → 
                         
                       
                        
                     
                     
                       2 
                        
                       
                         σ 
                         2 
                       
                     
                   
                 
                 ) 
               
             
             , 
           
         
       
     
         [0025]    where σ 2  is the bandwidth of the Gaussian kernel. 
         [0026]    In this embodiment, we used the highest eigen-value of the kernel matrix K, as the measure of the spread of the data. Given the samples in the sliding time-window, the N×N kernel matrix K is 
         [0000]        K   ij =φ( x   i ).φ( x   j )=κ( x   i   ,x   j ), 
         [0000]    where i and j index the sample pairs. An appropriate kernel function and its parameter can be selected according to characteristics of the samples. 
         [0027]    Sorted Naïve Bayes Classifier (SNBC) 
         [0028]    In one embodiment, we use the SNBC. The SNBC is a simple probabilistic classifier based on applying Bayes&#39; theorem with strong feature-independence assumptions. One can work with the naïve Bayes model without using any Bayesian methods. In spite of the naïve design and over-simplified assumptions, naïve Bayes classifiers often work much better in many complex real-world applications, such as surveillance, than one might expect. An advantage of the SNBC is that it requires only a small amount of training samples to estimate the parameters, i.e., means and variances of the features, necessary for classification. Because the features are assumed to be independent given the class, only the variances of the features for each class need to be determined, and not the entire covariance matrix. 
         [0029]    Abstractly, the probability model for a classifier is a conditional model 
         [0000]      p(C|F 1 , . . . , F n ) 
         [0000]    over a dependent class variable C conditional on several features F 1  through F n . Using Bayes theorem, we obtain 
         [0000]    
       
         
           
             
               p 
                
               
                 ( 
                 
                   
                     C 
                     | 
                     
                       F 
                       1 
                     
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     F 
                     n 
                   
                 
                 ) 
               
             
             = 
             
               
                 
                   
                     p 
                      
                     
                       ( 
                       C 
                       ) 
                     
                   
                    
                   
                     p 
                      
                     
                       ( 
                       
                         
                           F 
                           1 
                         
                         , 
                         … 
                          
                         
                             
                         
                         , 
                         
                           
                             F 
                             n 
                           
                           | 
                           C 
                         
                       
                       ) 
                     
                   
                 
                 
                   p 
                    
                   
                     ( 
                     
                       
                         F 
                         1 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         F 
                         n 
                       
                     
                     ) 
                   
                 
               
               . 
             
           
         
       
     
         [0000]    Applying the independence assumption, we have 
         [0000]    
       
         
           
             
               p 
                
               
                 ( 
                 
                   
                     C 
                     | 
                     
                       F 
                       1 
                     
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     F 
                     n 
                   
                 
                 ) 
               
             
             = 
             
               
                 1 
                 Z 
               
                
               
                 p 
                  
                 
                   ( 
                   C 
                   ) 
                 
               
                
               
                 
                   ∏ 
                   
                     i 
                     = 
                     1 
                   
                   n 
                 
                  
                 
                     
                 
                  
                 
                   
                     p 
                      
                     
                       ( 
                       
                         
                           F 
                           i 
                         
                         | 
                         C 
                       
                       ) 
                     
                   
                   . 
                 
               
             
           
         
       
     
         [0030]    Since Z is a constant, we can ignore it and for a two class problem Class 1 (C 1 ) and Class 2 (C 2 ), given a testing sample set X with features F 1 , F 2  . . . , F n  a probability of the sample set X belonging to class 1 is 
         [0000]        p ( C   1   |F   1   , F   2    . . . , F   n )= p ( C   1 )Π p ( F   i   |C   1 ). 
         [0031]    In the above representation, the feature values F i  are the measure of the displacement of the scattered microwave  121 , which can be obtained using the KPCA or the CURVD method as described above. In general, the higher this measure is at a particular element of the receiver antenna array, the higher is the probability of the object near the location of the element. Thus, the presence of an intruding object generates a waveform like signature as the object moves along the receiver array. The peak of this waveform occurs at the receiver array element that is closest the intruder. This would generate different shapes of waveform for the same class of intruder located at different positions along the receiver antenna array. This can confuse the conventional naïve Bayes classifier. 
         [0032]    Therefore, we ‘scrambled’ the input signal by sorting it based on the signal values. This way, all signal values are represented in a canonical form where the first feature is always a maximum displacement value. The sorted features can be used in the above described formulation to classify the intruder type. 
         [0033]      FIG. 3  shows the system and method according to our invention. The receiver acquires  310  the scattered microwave  102 . Features  321  are extracted  320 . The features are classified  330  to determine a class  331  for the moving object. Then, an alarm signal  140  can indicate the class. 
         [0034]    Although the invention has been described by way of examples of preferred embodiments, it is to be understood that various other adaptations and modifications can be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.