Abstract:
The method includes a dictionary including a target collection defined by images that are known with a defined level of certainty to include a subject and an imposter collection defined by images of individuals other than the subject. In the method, images of an area are captured over a period of time. In respect of each image: a matching calculation is carried out, based upon a comparison of the image captured with the images in the dictionary to result in a measure of confidence that the subject is in the area; and an inference determination is made to replace one of the target collection images with a further image that is known with the defined level of certainty, the determination being a function of the measure of confidence resultant from the captured image, the measure resultant from one or more previously captured images and the associated capture times.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application claims priority to U.S. Provisional Patent Application Ser. No. 62/098,411, filed Dec. 31, 2014, incorporated herein by reference in its entirety. 
     
    
     BACKGROUND OF THE INVENTION 
       [0002]    1. Field of the Invention 
         [0003]    The invention relates to the field of automated facial recognition. 
         [0004]    2. Description of the Related Art 
         [0005]    Automated face recognition from video can be used for variety of applications. One known method for face recognition is the sparse representation-based (SRC) face recognition method. This method is based on the theory that the probe image (test sample) lies in the subspace spanned by the training images from the same class. By way of explanation, assume the i-th training class consists of n i  training samples 
         [0000]        A   i   =[S   i,1   , S   i,2   , . . . , S   i,n     i   ]. 
         [0006]    If a new probe image y belongs to the subspace spanned by the i-th class, then: 
         [0000]        y=α   i,1   s   i,1 +α i,2   s   i,2 + . . . +α i,n     i     s   i,n     i     (1)
 
         [0000]    where α i,j  are weight coefficients, j=1, . . . , n. 
         [0007]    Since the membership of y is unknown, there can be built a training matrix A, where all the matrices for different training classes are concatenated together. If there are M total training classes, then the matrix is defined as: 
         [0000]        A=[A   1   , A   2   , . . . , A   M   ]=[s   1,1   , s   1,2   , . . . , s   M,n     M   ]  (2)
 
         [0008]    From this, the reconstruction of y from the training images can be expressed by the following equation: 
         [0000]        y=A   x     0     (3)
 
         [0000]    where x 0  is of the form 
         [0000]        x   0 =[0, 0, . . . , 0, α i,1 , α i,2 , . . . , 0]
 
         [0000]    i.e. only the coefficients corresponding the class that y belongs to are non-zero, all the others are zero. If the number of classes M is sufficiently large, the solution x 0  is sparse. Hence, the sparsest solution to the following l 1 -minimization problem is sought: 
         [0000]        x   1 =arg min∥ x∥   1  
 
         [0000]        s.t.Ax=y.   (4)
 
         [0009]    Here, ∥•∥ 1  represents the l 1  norm. 
         [0010]    For a probe image y, the solution x i  is found by solving the above minimization problem. In an ideal case, only the coefficients corresponding to the representative class of probe image y will be non-zero. However, practical training datasets will have some inherent noise, and, hence, some non-representative coefficients will also have non-zero values. In order to classify a probe image, a reconstruction is sought for each class. For a solution x, Let δ i (x) represents a vector in which only the coefficients corresponding to class i are kept from the entries of x, all the other entries are set to non-zero. Then, the reproduced probe image from only class i can be represented by Aδ i (x). The residual ∥y−Aδ i (x)∥ represents the reproduction error. y is assigned to the class that results in the minimum residue: 
         [0000]      min i   r   i ( y )=∥ y−Aδ   i ( x   1 )∥ 2   (5)
 
         [0011]    Instead of training a classifier and mapping the probe image through it as is done in some conventional training test paradigms, the SRC algorithm solves a minimization problem for every probe image. Due to the sparse nature of the solution, the occlusion, illumination and noise variations are also sparse in nature. 
       OVERVIEW 
       [0012]    Underlying the method is the concept of dynamic incorporation of the probe image into the training matrix. A critical part of such an approach is determining when the training matrix needs to be updated. Since the training matrix will be updated based upon a failure to correctly classify the current probe image, it is crucial that this detection step be designed carefully. One way to trigger the process will be to update the matrix whenever the current probe image fails to be classified into the same class as the previous image; however an impostor can easily trick such a naive system. 
         [0013]    To guard against such weaknesses, the method involves a confidence criterion to trigger the update step and a scheme to prevent impostors. 
       SUMMARY OF THE INVENTION 
       [0014]    Forming one aspect of the invention is a method for assessing the presence of a subject in an area over a period of time, the method comprising the steps of:
       maintaining a dictionary including: a target collection defined by a plurality of images that are known with a defined level of certainty to include the subject; and an imposter collection defined by a plurality of images of individuals other than the subject;   capturing a plurality of images of the area over the period of time; and   in respect of each image captured,
           carrying out a matching calculation, based upon a comparison of the image captured with the images in the dictionary to result in a measure of confidence that the subject is in the area; and   making an inference determination to replace one of the images in the target collection with a further image that is known with the defined level of certainty, the determination being a function of the measure of confidence resultant from the captured image, the measure of confidence resultant from one or more previously captured images and the times of capture thereof.   
               
 
         [0020]    According to another aspect of the invention, in the method, if the measure of confidence resultant from the captured image is in excess of a defined threshold, replacement can not occur. 
         [0021]    According to another aspect of the invention, the further image can be selected from the one or more previously captured images and the captured image based upon a calculation that compares the similarity of the captured image and previously captured images to the target collection and the time between the respective image captures. 
         [0022]    According to another aspect of the invention, a portion of the images in the target collection at the beginning of the period can define a static portion of the target collection. 
         [0023]    According to another aspect of the invention, the static portion can be a nil portion such that all images in the target collection at the beginning of the period are susceptible to replacement. 
         [0024]    According to another aspect of the invention, no image in the target collection that was not in the target collection at the beginning of the period is replaced until such time as all of the images in the target collection but for the static portion have been replaced. 
         [0025]    The presence of a subject in an area over a plurality of time periods can be assessed by applying the method to each of the time periods such that each of the time periods is associated with a respective application of the method. 
         [0026]    According to another aspect of the invention, the target collection at the commencement of each application of the method can be one and the same. 
         [0027]    According to another aspect of the invention, the static portion of the target collection can be the same in each application of the method. 
         [0028]    According to another aspect of the invention, the images in the target collection can be initially generated in an enrolment process adapted to result in a plurality of images that are representative of images that are likely to be captured when the subject is in the area and are suitable for recognition purposes. 
         [0029]    According to another aspect of the invention, the enrolment process can involve a photography session wherein the subject is photographed in a variety of poses. 
         [0030]    According to another aspect of the invention, the imposter collection can be defined by a plurality of photographs of each of the individuals other than the subject. 
         [0031]    According to another aspect of the invention, the imposter collection can be defined by a plurality of photographs of each of the individuals other than the subject. 
         [0032]    According to another aspect of the invention, the plurality of photographs of each individual other than the subject can be a plurality of photographs of said each individual in the variety of poses. 
         [0033]    According to another aspect of the invention, the variety of poses can be defined by head shots with angular variation up to 15° from face-front. 
         [0034]    According to another aspect of the invention, the matching calculation can be a sparse representation based classification calculation using the sparse dictionary. 
         [0035]    According to another aspect of the invention, the inference determination is a determination based upon a Bayesian inference scheme. 
         [0036]    Advantages and features of the invention will become apparent upon a review of the following detailed description with reference to the accompanying drawings, the latter being briefly described hereinafter. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0037]      FIG. 1  is a plot of image likelihood based upon residual; 
           [0038]      FIG. 2  is an analysis of confidence criterior and posterior probability; 
           [0039]      FIG. 3  shows the effect of the update step on FRR and Far; and 
           [0040]      FIG. 4  shows sample training images were accepted/rejected. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0041]    The embodiments discussed herein are merely illustrative of specific manners in which to make and use the invention and are not to be interpreted as limiting the scope. 
         [0042]    While the invention has been described with a certain degree of particularity, it is to be noted that many modifications may be made in the details of the invention&#39;s construction and the arrangement of its components without departing from the scope of this disclosure. It is understood that the invention is not limited to the embodiments set forth herein for purposes of exemplification. 
         [0043]    From training videos, frontal face images are extracted and a training matrix A is built in the same way as Equation 2. In operation, the training matrix is dynamically updated by evaluating the confidence criterion and the posterior probability in the Bayesian inference scheme. 
         [0044]    Let, the probe video y consists of K frames 
         [0000]        y={y   1   , y   2   , . . . , y   K }. 
         [0045]    For each frame, the l 1  optimization problem described in Equation 4 is solved. 
         [0046]    The residue value r i (y) for class i is also calculated using Equation 5. 
         [0047]    At this stage, the method differs from the SRC approach. Before classifying the current probe image as belonging to the class with the minimum residue, we calculate our confidence criterion: 
         [0000]    
       
         
           
             
               
                 
                   P 
                   = 
                   
                      
                     
                       - 
                       
                         
                            
                           
                             d 
                             - 
                             
                               max 
                                
                               
                                 ( 
                                 d 
                                 ) 
                               
                             
                           
                            
                         
                         r 
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0048]    Here, d denotes the difference between the minimum and the second-minimum residue, max(d) denotes the highest value of d seen so far for the test video in question. r is a tuning parameter that controls the sensitivity of the confidence criterion P. The value of P varies between 0 and 1. The proposed confidence criterion essentially determines whether the classification result for the current probe image is acceptable or not. The higher the value of P, the more confident the system is that the probe image is being classified correctly. 
         [0049]    To avoid the interposition of an imposter&#39;s face or invalid photo into the training set, a Bayesian inference scheme is employed which utilizes the temporal information between frames to decide if the update is safe. Let X t  be the state at time t. X t  can be one of the two values X t ε{Safe, Unsafe}. The state Safe means that the current user is correctly classified, although the confidence criterion P is lower than the threshold, which may caused by a pose change. The state Unsafe means that the current user is much likely an imposter and adding the probe image into training set is unsafe. Let Y 1:t  be the history observations from beginning to time t. With Bayesian theorem, the objective is to maximize the posterior probability P(X t |Y 1:t ). If p(X t =Safe|Y 1:t )&gt;p(X t =Unsafe|Y 1:t ), it is safe to update; otherwise, it is unsafe. According to Bayesian inference, the posterior probability P (X t |Y 1:t ) can be given by: 
         [0000]        p ( X   t   |Y   1:t )=λ t   p ( Y   t   |X   t ) p ( X   t   |Y   1:t-1 ),
 
         [0000]        p ( X   t   |Y   1:t )=Σ X     t-1     p ( X   t   |X   t-1   , Y   1:t-1 ) p ( X   t-1   |Y   1:t-1 ),  (7)
 
         [0000]    where λ t  is the normalization factor, which is independent with X t . If the observations are assumed to be independent, both mutually and with respect to the dynamic process, we can derive 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             p 
                              
                             
                               ( 
                               
                                 
                                   
                                     X 
                                     t 
                                   
                                    
                                   
                                     X 
                                     
                                       t 
                                       - 
                                       1 
                                     
                                   
                                 
                                 , 
                                 
                                   Y 
                                   
                                     
                                       1 
                                        
                                       
                                         : 
                                       
                                        
                                       t 
                                     
                                     - 
                                     1 
                                   
                                 
                               
                               ) 
                             
                           
                           = 
                             
                            
                           
                             
                               p 
                                
                               
                                 ( 
                                 
                                   
                                     X 
                                     t 
                                   
                                   , 
                                   
                                     
                                       Y 
                                       
                                         
                                           1 
                                            
                                           
                                             : 
                                           
                                            
                                           t 
                                         
                                         - 
                                         1 
                                       
                                     
                                      
                                     
                                       X 
                                       
                                         
                                           1 
                                            
                                           
                                             : 
                                           
                                            
                                           t 
                                         
                                         - 
                                         1 
                                       
                                     
                                   
                                 
                                 ) 
                               
                             
                              
                             
                               
                                 p 
                                  
                                 
                                   ( 
                                   
                                     X 
                                     
                                       
                                         1 
                                          
                                         
                                           : 
                                         
                                          
                                         t 
                                       
                                       - 
                                       1 
                                     
                                   
                                   ) 
                                 
                               
                               
                                 p 
                                  
                                 
                                   ( 
                                   
                                     
                                       X 
                                       
                                         
                                           1 
                                            
                                           
                                             : 
                                           
                                            
                                           t 
                                         
                                         - 
                                         1 
                                       
                                     
                                     , 
                                     
                                       Y 
                                       
                                         
                                           1 
                                            
                                           
                                             : 
                                           
                                            
                                           t 
                                         
                                         - 
                                         1 
                                       
                                     
                                   
                                   ) 
                                 
                               
                             
                           
                         
                       
                     
                     
                       
                         
                           = 
                             
                            
                           
                             p 
                              
                             
                               ( 
                               
                                 
                                   X 
                                   t 
                                 
                                 , 
                                 
                                   X 
                                   
                                     
                                       1 
                                        
                                       
                                         : 
                                       
                                        
                                       t 
                                     
                                     - 
                                     1 
                                   
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                     
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0050]    Face recognition in video can be assumed to form a temporal Markov chain [15]. Thus, the new state is conditioned directly on the preceding state and independent of the earlier history. So, we have p(X t |X 1:t-1 )=p(X t |X t-1 ). Based on the above analysis, the posterior probability p(X t |Y 1:t ) in Equation (7) can be simplified as 
         [0000]    
       
         
           
             
               
                 
                   
                     p 
                      
                     
                       ( 
                       
                         
                           X 
                           t 
                         
                         , 
                         
                           Y 
                           
                             1 
                              
                             
                               : 
                             
                              
                             t 
                           
                         
                       
                       ) 
                     
                   
                   = 
                   
                     
                       λ 
                       t 
                     
                      
                     
                       p 
                        
                       
                         ( 
                         
                           
                             Y 
                             t 
                           
                            
                           
                             X 
                             t 
                           
                         
                         ) 
                       
                     
                      
                     
                       
                         ∑ 
                         
                           X 
                           
                             t 
                             - 
                             1 
                           
                         
                       
                        
                       
                         
                           p 
                            
                           
                             ( 
                             
                               
                                 X 
                                 t 
                               
                                
                               
                                 X 
                                 
                                   t 
                                   - 
                                   1 
                                 
                               
                             
                             ) 
                           
                         
                          
                         
                           p 
                            
                           
                             ( 
                             
                               
                                 X 
                                 
                                   t 
                                   - 
                                   1 
                                 
                               
                                
                               
                                 Y 
                                 
                                   
                                     1 
                                      
                                     
                                       : 
                                     
                                      
                                     t 
                                   
                                   - 
                                   1 
                                 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where p(X t |X t-1 ) is the transition probability of the dynamic process, and p(Y t |X t ) is the image likelihood. Equation (8) is a recursive function, which can be efficiently computed by using the posterior probability p(X t-1 |Y 1:t-1 ) at time t−1. 
         [0051]    In order to acquire the image likelihood p(Y t |X t ), we use the residual r i (y) as the feature. In sparse representation, r i (y) denotes the distance between the probe image and the reconstructed image by sparse coding. A higher residual means a larger reconstruction error. In the exemplary embodiment, the image likelihood p(Y t |X t ) is given by the intraclass (when X t =Safe) or interclass (when X t =Unsafe) cumulative distribution functions, which is shown in  FIG. 1 . 
         [0052]    Given a probe image, one firstly calculates the confidence criterion P. If the criterion is lower than the predefined threshold, Equation 8 is used to acquire p(X t =Safe|Y 1:t ) and decide if the current update is safe. If so, a training image is picked from the classified class, and this training image is replaced with the current probe image. The update step incrementally replaces the images in the training matrix, i.e. at every step, one training image from the initial matrix gets replaced by the probe image. The process rolls over once all the beginning training images have been exhausted. In this way, the change of pose of the subject gradually gets incorporated into the training matrix. 
         [0053]    To classify the whole video as belonging to a particular class, individual frame image results are accumulated and the current video is assigned to the class to which the highest number of frames was successfully classified into. 
         [0000]    
       
         
               
             
               
               
             
           
               
                   
               
             
             
               
                    Algorithm 1 outlines the exemplary method. 
               
               
                 Algorithm 1 The Proposed Method 
               
             
          
           
               
                 1: 
                 Input: 1) Training image matrix A = [A 1 , A 2 , ... , A M ] extracted from  
               
               
                   
                 training videos. 
               
               
                   
                  2) Test video y = {y 1 , y 2 , ..., y K ) 
               
               
                 2: 
                 for i ← (1, K) do 
               
               
                 3: 
                  Solve the l 1-  minimization problem: 
               
               
                   
                  x 1  = arg min∥x∥ 1  s.t.Ax = y i . 
               
               
                 4: 
                  Calculate the residue: 
               
               
                   
                  r j (y i ) = ∥y i  − Aδ j (x 1 )∥ 2 , j = 1,2, ..., M. 
               
               
                 5: 
                  Calculate the confidence criterion: 
               
               
                   
               
               
                   
                  
       P   =     e       -     |     d   -     max        (   d   )         |       r           
 
               
               
                   
               
               
                 6: 
                  if P &gt; threshold then 
               
               
                   
                    identity(yi) = arg min(r i  (y i )). 
               
               
                 7: 
                  else 
               
               
                 8: 
                  Calculate p(X t |Y 1:t ) by using Equation 8. 
               
               
                 9: 
                  if p(X t  = Safe|Y 1:t ) &gt; 0.5 then 
               
               
                 10: 
                    Pick an image from A j , where j = identity of currently identified  
               
               
                   
                    class. 
               
               
                 11: 
                  Replace the picked image with y i  in A. 
               
               
                 12: 
                  else 
               
               
                 13: 
                   It is unsafe to update the training set. 
               
               
                 14: 
                  end if 
               
               
                 15:  
                  end if 
               
               
                 16:  
                 end for 
               
               
                 17:  
                 Output: identity(y) = Class j to which maximum number of frames from  
               
               
                   
                 y were successfully classified into. 
               
               
                   
               
             
          
         
       
     
         [0054]    As can been seen, the confidence criterion P is continuously monitored throughout the classification of the test video. If the value of P is above a pre-defined threshold, the current frame is deemed to be classified successfully with a high confidence. Otherwise, the posterior probability p(X t |Y 1:t ) is computed. The decision is made according to the greater of p(X t =Safe|Y 1:t ) and p(X t =Unsafe|Y 1:t ). Since the sum of posterior probabilities is 1, we may determine if (X t =Safe|Y 1:t )&gt;0.5. If p(X t =Safe|Y 1:t ) is greater than 0.5, an image from the training matrix belonging to the currently identified class is picked. This image is replaced by the current probe image. At the end of the process, the video is assigned the identity of the class to which the highest number of frames was successfully classified into. 
         [0055]    The advantages of the method over known methods are three-fold:
       Due to intelligently updating the training matrix A, the proposed method can be robust to not only pose change, but any other unexpected change that may occur in an uncontrolled environment.   the method does not have any computational overhead. In fact, the only extra operations over the classic SRC method are the calculation of the confidence criterion and the posterior probability. This contrasts with methods which maintain individual matrices for different pose conditions, such as
           “Dictionary Based face recognition from video”,  European Conference on Computer Vision,  2012, pp. 766-779, IEEE   Terence Sim, Sheng Zhang, Rajkumar Janakiraman and Sandeep Kumar, “Continuous vertification using multimodal biometrics”,  Pattern Analysis and Machine Intelligence, IEE Transactions , vol 29, no 4 pp 687-700, 2007   
           By using the Bayesian inference, the method can effectively utilize temporal information in video to detect if the current low criterion P results from a pose change or a subject change, which greatly reduces the risk of introducing an impostor&#39;s face into the training set       
 
       EXPERIMENTAL RESULTS 
       [0061]    There was created an in-house video face database with 11 subjects. The subjects were asked to perform the following motions sequentially for a few seconds: 1) look straight, 2) look right, 3) look straight, 4) look left, and 5) look straight. From the videos, the face region was detected and cropped first using the detector described in P. Viola and M. J. Jones, “Robust real-time face detection”,  International Journal of Computer Vision , vol 0.57, no. 2, pp. 137-154, May 2014. The training matrix A was built using 40 frontal images for each of the 10 subjects. The cropped images were downsampled to the size of 10×10. That provided a training matrix A of size 100×400. The detected face images of the 11-th subject were then sequentially fed to the method as a test video. For each frame image, the confidence criterion value P was calculated as described by Equation 6 and the posterior probability p(X t |Y 1:t ) as given by Equation 8. 
         [0062]      FIG. 2  shows the change in the value of criterion P and posterior probability p(SafelYi:t) against the input frame images. Sample face images for the individual sections of the graph are shown below for reference (images have been blurred to respect anonymity). As can be seen, the value of P stays close to 1 when the subject is looking straight. As soon as the subject starts looking left or right, the value of P quickly goes down. This demonstrates that the confidence criterion can detect whether the subject&#39;s pose is changing. Furthermore, the posterior probability p(X t =Safe|Y 1:t ) keeps above 0.5 (larger than p(X t =Unsafe|Y 1:t ) even when the subject changes pose, but the probability drops below 0.5 immediately when an impostor appears into the video. 
         [0063]    To ensure the stability of the system, it is important to ensure that the False Acceptance Rate (FAR) does not increase while updating the matrix. To this end, the same experimental setup as before i.e. 10 subjects are used for training from our in-house database and 1 for testing. For the test phase, the training matrix was updated with the probe image whenever P falls below the threshold (0.5). Every time an update step takes place, FAR and FRR were recorded. The process was repeated 11 times treating each subject as test.  FIG. 3  shows the change of FRR and FAR against the number of updates. As expected, the FRR decreases very quickly. In fact, after only 3 update steps it falls below 0.1. At the same time, the FAR does not increase significantly. 
         [0064]    100 subjects from the You-Tube database are picked at random. 15 frontal images per subject were extracted from videos of the selected subjects. Since these videos are uncontrolled, exactly frontal face images are difficult to find. The images within a pose variation of 15% were selected ( FIG. 4 ). These extracted images were used to build an initial training matrix A. The detected and cropped face images were downsampled to a size of 15×15, which provided a matrix of size 225×1500. 
         [0065]    For testing, the same criteria of same/not same output as described in “Face Recognition in uncontrolled videos with matched background similarity” [L. Wolf, T. Hassner and I. Maoz,  IEEE Conference on Computer Vision and Pattern Recognition,  2011, pp. 529-534, IEEE] were adhered to. For the 100 subjects picked in the training phase, 100 pair of videos was picked randomly from the list of pairings. For each test pair, the identity of the subject in one of the videos was known. The other video of each pair was fed through the exemplary method. From the output assigned class, it was decided whether the test pair belonged to the same subject or not. This form of testing scheme allowed comparison of the obtained results to already published results. The random picking of the training subjects and testing pairs were repeated 10 times. The reported results are the average over the 10 runs. 
         [0066]    To demonstrate the effectiveness of the confidence criterion and inference scheme, two versions of the method were tested, one with the update step and one without it. The one without the update step is essentially identical to the SRC method except the fact that it is being applied to videos. The sensitivity parameter r was set the same way as before i.e. half of max(d) found for the first frame of the current test video (Equation 6). The threshold for the confidence criterion to determine whether a classification result is valid or not was set to 0.5 as suggested before. 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE I 
               
             
             
               
                   
               
               
                 [RESULTS ON THE YOUTUBE FACE DATABASE] 
               
             
          
           
               
                   
                 Method 
                 % Accuracy 
               
               
                   
                   
               
               
                   
                 Proposed (without update) 
                 70.1 
               
               
                   
                 Proposed (with update) 
                 82.9 
               
               
                   
                 mindst LBP [2] 
                 65.7 
               
               
                   
                 mindst FPLBP [2] 
                 65.6 
               
               
                   
                 ∥U1′U2∥ LBP [2] 
                 65.4 
               
               
                   
                 ∥U1′U2∥ FPLBP[2] 
                 64.3 
               
               
                   
                 MBGS (mean) FPLBP [2] 
                 72.6 
               
               
                   
                 MBGS (mean) LBP [2] 
                 76.4 
               
               
                   
                 APEM-FUSION [18] 
                 79.1 
               
               
                   
                 STFRD + PMML [19] 
                 79.5 
               
               
                   
                 VSOF + OSS [20] 
                 79.7 
               
               
                   
                 COTS [2] 
                 67.9 
               
               
                   
                 MNF [2] 
                 76.4 
               
               
                   
                 Schroff et al. [21] 
                 77.5 
               
               
                   
                 Bhatt et al. [1] 
                 80.7 
               
               
                   
                   
               
             
          
         
       
     
         [0067]    The first two rows of Table I shows the accuracy results obtained for the proposed method with and without the update step. It can be seen that the update strategy determined by the confidence criterion and inference scheme results in noticeable improvement of performance. The confidence criterion triggers the update of the training matrix, while the inference scheme prevents to include an impostor&#39;s face into the training matrix. As a result, more frames from the testing videos are being classified to the correct class. Since the final decision for the entire target video is based on the classification of the individual frames, the update strategy directly results in better results. 
         [0068]    Rest of the comparison results were copied from “On recognizing faces in videos using clustering based re-ranking and fusion” [H. S. Bhatt, R. Singh and M. Vatsa,  IEEE Transactions on Information Forensics and Security , vol 9, pp. 1056-1068, July 2014]. As can be seen, the proposed approach performs much better than any other known SRC method. Since the calculations added by our confidence criterion and update step can be done in constant time, the computational complexity of the proposed method is the same as the original SRC method, which is linear in terms of the number of training images. The experiments were implemented in MATLAB and performed on a Windows 8 laptop equipped with 16 GB of memory and an Intel Core i7 processor clocked at 2.2 GhZ. To solve the l 1  minimization problem, the dual augmented Lagrangian multiplier method proposed in “Fast t-minimization algorithms for robust face recognition” [ IEEE Transactions on Image Processing , vol. 22, pp 3234-3426, August 2013] was used. For our in-house database, the CPU time achieved was 0.35 seconds per image, while for the YouTube database it was 0.9 seconds. Faster times can be achieved through optimized implementation and use of GPU programming. 
         [0069]    Whereas a single exemplary embodiment is herein shown and described, it will be evident that variations are possible. 
         [0070]    For example, whereas in the exemplary embodiment, all of the training images are susceptible to replacement, this is not necessary, and a portion of the images may be preserved for continuity purposes. 
         [0071]    As well, whereas in the exemplary embodiment, the captured image which fails the confidence determination is substituted in the training matrix if deemed appropriate by the inference determination, a previously captured image which passed the confidence determination could instead be substituted. 
         [0072]    Accordingly, the invention should be understood to be limited only by the accompanying claims, purposively construed.