# Patent

## Title
Layered models for context awareness

## Abstract

The present invention relates to a system and methodology providing layered probabilistic representations for sensing, learning, and inference from multiple sensory streams at multiple levels of temporal granularity and abstraction. The methods facilitate robustness to subtle changes in environment and enable model adaptation with minimal retraining. An architecture of Layered Hidden Markov Models (LHMMs) can be employed having parameters learned from stream data and at different periods of time, wherein inferences can be determined relating to context and activity from perceptual signals.

## Background
TECHNICAL FIELD
The present invention relates generally to computer systems, and more particularly to a system and method to automatically recognize activities and context via a hierarchical (layered) probabilistic approach while analyzing multiple input streams of diverse nature in accordance with multiple levels of temporal granularity.
BACKGROUND OF THE INVENTION
Computer models provide the basis for many analytical systems especially in the area of artificial intelligence. Previous work in this area has explored the fusion of multiple sources of information to reason about higher-level abstractions relating to human context in computer systems operations. Recent work on probabilistic models employed for reasoning about a user's location, intentions, and focus of attention have highlighted opportunities for building new kinds of applications and services. A portion of such work leverages perceptual information to recognize human activities and is centered on identification of a specific type of activity in a particular scenario. Many of these techniques are targeted at recognizing single, simple events (e.g., ‘waving a hand’ or ‘sitting on a chair’). However, less effort has been applied to methods for identifying more complex patterns of human behavior, extending over longer periods of time.
Dynamic models of periodic patterns associated with people movements are employed by some methods to capture periodicity of activities such as walking. Other approaches to human activity recognition employ graphical models. A significant portion of work in this area has made use of Hidden Markov Models (HMMs). As an example, HMMs have been utilized for recognizing hand movements to relay symbols in American Sign Language, wherein different signs can be recognized by computing probabilities for models that different symbols may produce given an observed visual sequence. More complex models, such as Parameterized-HMM (PHMM), Entropic-HMM, Variable-length HMM (VHMM), and Coupled-HMM (CHMM), have been utilized to recognize more complex activities such as the interaction between two people. One method proposes a stochastic, context-free grammar to compute the probability of a temporally consistent sequence of primitive actions recognized by HMMs.
Other methods model events and scenes from audiovisual information. For example, these methods have developed a wearable computer system that utilizes a plurality of HMMs for recognizing the user's location, (e.g., in the office, at the bank, and so forth). Still yet other techniques propose an entropic-HMM approach to organize observed video activities (e.g., office activity and outdoor traffic) into meaningful states, wherein the models can be adapted in video monitoring of activities such as outdoor traffic, for example. In another approach, a probabilistic finite-state automaton (a variation of structured HMMs) is employed for recognizing different scenarios, such as monitoring pedestrians or cars on a freeway. Although standard HMMs appear to be robust to changes with respect to temporal segmentation of observations, they tend to suffer from a lack of structure, an excess of parameters, and an associated over-fitting of data when applied to reason about long and complex temporal sequences with inadequate training data. In recent years, more complex Bayesian networks have been adopted for modeling and recognition of human activities. To date, however, there has been little advancement on methods for exploiting statistical processes to fuse multiple sensory streams that address modeling problems with robustness and mitigate model training efforts.
SUMMARY OF THE INVENTION
The following presents a simplified summary of the invention in order to provide a basic understanding of some aspects of the invention. This summary is not an extensive overview of the invention. It is intended to neither identify key or critical elements of the invention nor delineate the scope of the invention. Its sole purpose is to present some concepts of the invention in a simplified form as a prelude to the more detailed description that is presented later.
The present invention relates to a system and methodology within machine learning that allows robust and efficient modeling of dynamic, human patterns of behavior from heterogeneous streams of data. A machine learning system is provided to model and recognize types of real-time human activities in real-life environments, such as in an office or workplace, for example. The learning system and processes relating thereto address problems associated with accurately recognizing and anticipating real-time human activities in a hierarchical manner. The present invention facilitates a robust machine learning system that monitors multiple input sources (e.g., video, audio, keyboard, mouse, telephone, and so forth) and builds models of various human activities from the input source data. The invention allows for context aware systems, such as computer systems that model the user's context and employ it to determine inferences about the user's internal states. The modeling can be achieved via Layered Hidden Markov Models (LHMMs) that facilitate a hierarchical, concrete, real-time, and multi-modal activity-recognition approach to becoming context aware of a human's environment and activities such that human needs may be more accurately and automatically anticipated by the computer.
In one aspect, the present invention facilitates performing automatic and semiautomatic recognition of activity and context from multiple perceptual cues. This can include processes for learning and reasoning about streams of perceptual evidence from visual, acoustic, and kinesthetic channels that accelerate development of a variety of compelling applications and services that hinge on identification of rich, human-centric notions of context. In addition, creating more robust learning and modeling methods for reasoning about information derived from multiple channels enables other systems and processes such as in the realms of multi-modal human-computer interaction (HCI), intelligent environments, and/or visual surveillance.
According to another aspect of the present invention, inference analysis can be performed that takes as inputs raw signals coming from multiple sensors and yields high-level abstract descriptions of the human activities. Thus, the task of moving from low-level signals to more abstract hypotheses about activity brings into focus a consideration of a spectrum of analytical techniques. This can include template matching, context-free grammars, and various other statistical methods.
In accordance with another aspect of the present invention, a layered statistical technique or process is provided for detecting and recognizing human activities based on multiple streams of sensory information. The process is based on a formulation of dynamic graphical models that are referred to as Layered Hidden Markov Models. These layered or hierarchical models facilitate building substantially robust context-recognition systems that process multiple levels of time granularity. In contrast, non-hierarchical modeling techniques can be very sensitive to subtle variations in a target environment and can require extensive retraining when moved to another similar environment. Hierarchical statistical models also support a factoring of a learning and inference problem into multiple, smaller sub-problems, thus producing decompositions along lines of variation and stability.
The following description and the annexed drawings set forth in detail certain illustrative aspects of the invention. These aspects are indicative, however, of but a few of the various ways in which the principles of the invention may be employed and the present invention is intended to include all such aspects and their equivalents. Other advantages and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic block diagram illustrating a hierarchical probabilistic model in accordance with an aspect of the present invention.
FIG. 2 is a diagram illustrating a layered probabilistic architecture in accordance with an aspect of the present invention.
FIG. 3 is a diagram illustrating a single layer of a hierarchical probabilistic model in accordance with an aspect of the present invention.
FIG. 4 is a diagram illustrating multiple layers of a hierarchical probabilistic model in accordance with an aspect of the present invention.
FIG. 5 is a flow diagram illustrating model parametric determinations in accordance with an aspect of the present invention.
FIG. 6 is a flow diagram illustrating a methodology to facilitate a temporal modeling in accordance with an aspect of the present invention.
FIG. 7 is a flow diagram illustrating a methodology providing a multi-layer model and analysis in accordance with an aspect of the present invention.
FIG. 8 is a schematic block diagram illustrating an exemplary system employing a hierarchical probabilistic model in accordance with an aspect of the present invention.
FIG. 9 is a schematic block diagram illustrating a suitable operating environment in accordance with an aspect of the present invention.



DETAILED DESCRIPTION OF THE INVENTION
The present invention relates to a system and methodology providing layered probabilistic representations for sensing, learning, and inference from multiple sensory streams at multiple levels of temporal granularity and abstraction. The methods facilitate robustness to subtle changes in environment and enable model adaptation with minimal retraining. Layered Hidden Markov Models (LHMMs) can be employed having parameters learned from stream data and at different time granularities, wherein inferences can be determined relating to context and activity from perceptual signals.
Referring initially to FIG. 1, a hierarchical or layered analysis system 10 is illustrated in accordance with an aspect of the present invention. A layered probabilistic model (LPM) 20 analyzes multiple input streams 24 to determine one or more states 30 associated with human characteristics. The input streams 24 can include substantially any type of data such as audio, video, computer activities (e.g., mouse movements, applications activity, keyboard strokes, and so forth), and telephone activities, for example. The LPM 20 is configured as a layered structure, wherein respective layers can include one or more probability models to analyze the input streams 24. A plurality of time series data (stream data) 40 are received by the LPM 20 and are applied as sample inputs to the respective layers, whereby the time inputs are generally arranged in a descending order of temporal granularity, (e.g., the higher the layer, the smaller its time granularity and consequently the higher the temporal abstraction modeled by that layer). For example, if the data at a first layer was sampled every (25) milliseconds, a second layer may be sampled every (150) milliseconds whereas a subsequent layer may be sampled at time periods greater than one second. It is to be appreciated that substantially any time sampling period can be selected.
The LPM 20 analyzes the input streams 24 in accordance with the layers and time series data 40 to determine the states 30. The states 30 can include context states such as what is a user doing, how busy the user is, how focused the user is, and where attentional resources of the user are being applied, for example. Other states can include user activities (e.g., phone conversation, face-face conversation, presentation, distant conversation, nobody in the office, user present, other activity engaged), patterns of behavior, emotions (e.g., happy, upset, tired, relaxed, excited), and so forth. This can also include inferences about possible states and/or implied user states. From the state information at 30, one or more computer events 50 can be anticipated, altered, tuned, and/or adjusted in accordance with the determined state. For example, applications may be invoked and/or adjusted based upon the state information (e.g., bringing an instant messenger display to the foreground based on a determined state of availability to receive messages, saving a file based upon a determined state of being away from a desktop, identifying a person in a surveillance application). Other events that can be controlled include timing (e.g., delaying/forwarding a message or other computer activity based upon state), providing feedback (e.g., invoking a dialog session based upon a determination of confusion), changing or adjusting one or more controls (e.g., automatically turning CD player down when another user is detected in the room, automatically invoking/adjusting desktop controls based upon state). This can also include such events 50 as providing help or information utilities to the user based on the determined state 30 and include substantially any action that can be performed on a computer (e.g., executing a subsequent algorithm or control based upon determined state).
Referring now to FIG. 2, a layered classification system 100 is illustrated in accordance with an aspect of the present invention. The system 100 includes N classification layers 110 through 130, N being an integer, wherein respective layers are adapted with M probability models per layer, M being an integer. It is noted that M1 is subscripted to a layer number such that M1 relating to Layer1 may be a different number of probability models than Layer2 having M2 such models. Thus, LayerN at 130 may have MN models configured, wherein subscript N denotes the respective layer and M describes the number of classes or probability models captured by the Nth layer. Each layer i, Layer1, processes data at its own time granularity Ni 
As illustrated, the layers 110–130 receive time inputs at 140 through 144 respectively. As noted above, the time inputs 110–130 are generally arranged in descending order of time granularity, although some layers may be sampled at similar time periods. As one example, the layer 110 may be sampled at 100 microseconds and the layer at 120 may be sampled at 1 millisecond. At 150, one or more sensing inputs are processed by the layer at 110, wherein one or more feature vectors (described below) are generated at 154 and fed to the next stage at 120. The next stage 120 analyzes the feature vectors at 154 and generates one or more feature vectors at 160 that are processed by the stage at 130. The last stage, in this case the layer 130, produces one or more state outputs at 170 that reflect one or more human characteristics that are modeled by the respective stages and described above. It is noted that the system 100 can process information in a concurrent and/or serial manner, whereby respective stages 110–130 can perform aspects of parallel and/or serial processing.
FIGS. 3 and 4 illustrate exemplary probability layers and associated models in accordance with the present invention. FIG. 3 depicts a single layer 200 having associated states 210 and observations 214 that are rolled-out in time. FIG. 4 illustrates a layered and hierarchically arranged architecture 230 providing three layers 234–242 having associated states and observations describing human behavior at different levels of temporal granularity. As noted above, N such layers may be similarly configured.
In one aspect of the present invention, the layers 234–242 provide a hierarchical approach to learning human activities from sensed/inferred data and employs directed acyclic graphs (DAGs), also referred to as Dynamic Bayesian Networks or Dynamic Graphical Models. Statistical DAGs can provide a computationally efficient and sufficiently expressive solution to the problem of human activity modeling and recognition. Hidden Markov Models (HMMs) and related extensions, (e.g., CHMMs, PHMMs, VHMMs), support the architecture illustrated at 230. Thus, layered HMMs or (LHMMs), can be viewed as particular cases of temporal DAGs.
DAGs generally include a set of random variables represented as nodes as well as directed edges or links between the nodes. They define a mathematical form of a joint or conditional Probability Distribution Function (PDF) between the random variables. From a human behavior perspective, DAGs can be utilized since they constitute a graphical representation of causal dependencies among variables. The absence of directed links between nodes implies a conditional independence. Moreover, a family of transformations can be performed on the graphical structure depicted at 230 that has a direct translation in terms of mathematical operations applied to the underlying PDF. Furthermore, DAGs are generally considered modular, (e.g., one can express a joint global PDF as the product of local conditional PDFs). In view of the above, DAGs present several advantages that are relevant to the problem of human behavior modeling from multiple sensors: they can handle incomplete data as well as uncertainty; they are trainable and provide a process for mitigating over-fitting; they encode causality in a natural way; algorithms exist for performing predictive inference; they offer a framework for combining prior knowledge and data; they are modular; and can be paralleled.
Hidden Markov Models are one of the most popular examples of DAGs for modeling processes that have structure in time. They provide clear Bayesian semantics, efficient algorithms for state and parameter estimation, and can automatically perform dynamic time warping. An HMM is essentially a quantization of a system's configuration space into a small number of discrete states, together with probabilities for transitions between states as illustrated at 230 of FIG. 4. A single, finite discrete variable indexes the current state of the system. Substantially any information about the history of the process needed for future inferences can be reflected in the current value of the state variable. Graphically HMMs are often depicted ‘rolled-out in time’ as DAGs, such as in FIG. 3, whereas FIG. 4 illustrates multiple layers having one or more HMMs per layer. It is to be appreciated that other models may be employed in accordance with the layered approach of the present invention such as Support Vector Machines (SVM), Naive Bayes, Bayesian Networks, Dynamic Graphical Models, Decision Trees, Similarity-based, Vector-based, and/or other learning models or combinations thereof.
The layered representation illustrated at 230 of FIG. 4 decomposes the parameter space in a manner that enhances the robustness of the system by reducing training and tuning requirements. In Layered HMMs (LHMMs), each layer of the architecture may be connected to the next layer via its inferential results. The representation segments the problem into distinct layers that operate at different temporal granularities—allowing for temporal abstractions from point-wise observations at particular times into explanations over varying temporal intervals. It is noted that temporal or time granularity in the previous context of discussion may correspond to a window size or vector length of the observation sequences in the HMMs. LHMMs can be regarded as a cascade of HMMs. One possible structure of a three-layer LHMM is displayed in FIG. 4.
A mathematical analysis will now be described in accordance with the layered representation 230 of FIG. 4. Formally, given a set of TL observations,




  
    
      O
      L
    
    =
    
      
        {
        
          
            O
            1
            L
          
          ,
          
            O
            2
            L
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            O
            
              T
              L
            
            L
          
        
        }
      
      =
      
        
          O
          L
        
        ⁡
        
          (
          
            1
            ⁢
            
              :
            
            ⁢
            
              T
              L
            
          
          )
        
      
    
  
  ,




at level L, the HMMs at this level can be thought of as a multiclass classifier mapping these TL observations to one of KL classes. Let XTi be the sample space of vectors OiL. If OiL∈XTL, then the bank of KL HMMs (Note that one HMM may be configured for each class to classify, thus, these type of HMMs may be denoted as discriminative HMMs) can be represented as fL: XTL→YL, where YL={1, . . . ,KL} is the discrete variable with the class label, i.e., the bank of HMMs is a function fL that outputs a class label every TL observations. The HMMs at the next level (L+1) take as inputs the outputs of the HMMs at level L, i.e.,





  
    
      X
      
        T
        
          l
          +
          1
        
      
    
    =
    
      {
      
        
          Y
          1
          L
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          Y
          
            T
            
              L
              +
              1
            
          
          L
        
      
      }
    
  
  ,




and learn a new classification function with time granularity TL+1, fL+1: XTL+1→YL+1. In this framework respective HMMs can be trained via a Baum-Welch algorithm, for example.

The layered representation illustrated at 230 of FIG. 4 facilitates robustness, training efficacy, and naturalness. In one aspect, the representation or framework facilitates decoupling different levels of analysis for training and inference. As it is described below, respective levels of the hierarchy can be trained independently, with different feature vectors and time granularities. In consequence, the lowest, signal-analysis layer, that is most sensitive to variations in the environment, can be retrained, while leaving the higher-level layers unchanged. For example, in an office setting, beyond robustness in a single office, the representation 230 facilitates models that perform suitably when transferred to different locations such as offices spaces while mitigating tuning efforts through retraining, for example.
There are several approaches to performing inference with LHMMs. In one approach, which is referred to as maxbelief, the model with the highest likelihood is selected, and this information is made available as an input to the HMMs at the next level. In a distributional approach, probability distribution information is passed over the models to the higher-level HMMs.
As an example, consider that K HMMs are trained at level L of the hierarchy, MkL, with k={1, . . . ,K}. Let




  
    
      Λ
      ⁡
      
        (
        
          k
          ,
          t
        
        )
      
    
    L
  
  =
  
    
      log
      ⁢
      
        
      
      ⁢
      
        (
        
          P
          ⁡
          
            (
            
              
                O
                ⁡
                
                  (
                  
                    1
                    ⁢
                    
                      :
                    
                    ⁢
                    t
                  
                  )
                
              
              |
              
                M
                k
                L
              
            
            )
          
        
        )
      
    
    =
    
      log
      ⁢
      
        
          ∑
          i
        
        ⁢
        
          
            α
            t
          
          ⁡
          
            (
            
              i
              ;
              
                M
                k
                L
              
            
            )
          
        
      
    
  




be the log-likelihood of model MkL given various observations up to time t; and let α1(i;MkL) be the alpha variable of the standard Baum-Welch algorithm at time t and for model MkL, i.e.,





  
    
      
        α
        
          i
          +
          1
        
      
      ⁡
      
        (
        
          j
          ;
          
            M
            k
            L
          
        
        )
      
    
    =
    
      
        [
        
          
            ∑
            
              i
              =
              1
            
            N
          
          ⁢
          
            
              
                α
                t
              
              ⁡
              
                (
                
                  i
                  ;
                  
                    M
                    k
                    L
                  
                
                )
              
            
            ⁢
            
              P
              
                j
                |
                i
              
              
                M
                k
                L
              
            
          
        
        ]
      
      ⁢
      
        
          p
          j
        
        ⁡
        
          (
          
            
              o
              t
            
            ;
            
              M
              k
              L
            
          
          )
        
      
    
  
  ,




where





  P
  
    i
    |
    j
  
  
    M
    k
    L
  




is the transition probability from state j to state i for model MkL, and pj(ot; MkL) is the probability for state j in model MkL of observing ot. At that level, the observations are classified by declaring C(t)L=arg maxk Λ(k)tL;, with k={1, . . . ,K}. The next level of the hierarchy (L+1) could have two types of observations of τ temporal length, for example: (1) in the maxbelief approach, C(1: τ)L, i.e., the hard classification results from the previous level for each time step—and therefore a vector of τ discrete symbols in {1, . . . ,K}; or (2) in the distributional approach,





  
    {
    
      
        
          Λ
          ⁡
          
            (
            
              1
              ⁢
              
                :
              
              ⁢
              K
            
            )
          
        
        
          t
          =
          1
        
        L
      
      ,
      ...
      ⁢
      
        
      
      ,
      
        
          Λ
          ⁡
          
            (
            
              1
              ⁢
              
                :
              
              ⁢
              K
            
            )
          
        
        
          t
          =
          τ
        
        L
      
    
    }
  
  ,




i.e., the log-likelihoods for the respective models and time instants, —and therefore a vector of K reals for the associated time step. In the experimental examples described below, performance was not significantly improved by using the latter approach. Therefore the results reported correspond to the maxbelief approach, which is generally simpler in nature.

The following discussion describes processes for decomposition per temporal granularity. FIG. 4 highlights decomposing a problem into layers with increasing time granularity. For example, at layer L a sliding time window of TL samples is provided. The HMMs at this level analyze the data contained in such time window, compute their likelihood and generate an observation for layer L+1 every TL samples. That observation is the inferential output of the HMMs in level L, as previously described. The sliding factor along with the window length vary with the granularity of each level. At the lowest level of the hierarchy, the samples of the time window are the features extracted from the raw sensor data. At any other level of the hierarchy, the samples are the inferential outputs of the previous level. The higher the level, the larger the time scale——and therefore the higher the level of abstraction—since gathering observations at a higher level typically requires the outputs of lower layers. In a sense, each layer performs time compression before passing data upward.
Automatic estimation of the time granularities TL from data is a challenging problem both for standard HMMs and LHMMs. In the experiments reported here, the time granularities at each level were determined based on knowledge about the different classes being modeled. Cross-validation was used to select the optimal values from the original set of proposed ones.
Focusing on the example domain of office awareness, a two layer HMM architecture can be employed. The raw sensor signals are processed with time windows of duration about 100 milliseconds (fine-time granularity). Next, the lowest layer of HMMs classify the audio and video data with a time granularity of less than 1 second, for example. This level of description detects a user's presence, by use of audio, keyboard, mouse, and/or video, for example. Furthermore, the second layer of HMMs represents typical office activities, associated with a time granularity of about 5–10 seconds, for example. At another (higher) level, models could describe what the user has done in the last N minutes. Additionally, models can provide an explanation of the user's activities during the day in addition to the states previously described in FIG. 1.
Moreover, employing a hierarchical structure 230 provides several valuable properties. A hierarchical formulation facilitates decoupling different levels of analysis for training and inference. As it is further explained below, respective levels of the hierarchy 230 can be trained independently, with different feature vectors and time granularities. Once the system has been trained, inference can be carried out at any level of the hierarchy 230. Thus, a user or system can retrain the lowest (most sensitive to variations in the environment) level, for example, while mitigating retraining efforts in other levels of the hierarchy 230.
FIGS. 5, 6 and 7 illustrate methodologies to facilitate human modeling in accordance with the present invention. While, for purposes of simplicity of explanation, the methodologies are shown and described as a series of acts, it is to be understood and appreciated that the present invention is not limited by the order of acts, as some acts may, in accordance with the present invention, occur in different orders and/or concurrently with other acts from that shown and described herein. For example, those skilled in the art will understand and appreciate that a methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. Moreover, not all illustrated acts may be required to implement a methodology in accordance with the present invention.
FIG. 5 illustrates a process 300 for learning model parameters and inferring model states in accordance with the present invention. At 310, model parameters are trained independently for each layer. For an HMM, the problem of learning model parameters can be solved by a forward-backward or Baum-Welch algorithm, for example. This algorithm provides expressions for the forward, αt(i) and βt(i) variables, whose normalized product leads to γt(i)=P(qt=St|O(1:t)), i.e., the conditional likelihood of a particular state Si at time t, given O(1:t), i.e., the observations up to time t. The log-likelihood of a sequence of observations is given by




  
    Λ
    ⁢
    
      
    
    =
    
      
        log
        ⁢
        
          
        
        ⁢
        
          P
          ⁡
          
            (
            
              O
              ⁡
              
                (
                
                  1
                  ⁢
                  
                    :
                  
                  ⁢
                  T
                
                )
              
            
            )
          
        
      
      =
      
        log
        ⁡
        
          [
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              
                α
                T
              
              ⁡
              
                (
                i
                )
              
            
          
          ]
        
      
    
  
  ,




where N is the number of hidden states in the HMM. In general, the expressions for the αt(i) and βt(i) variables are:





  
    
      α
      
        t
        +
        1
      
    
    ⁡
    
      (
      j
      )
    
  
  =
  
    
      
        [
        
          
            ∑
            
              i
              =
              1
            
            N
          
          ⁢
          
            
              
                α
                t
              
              ⁡
              
                (
                i
                )
              
            
            ⁢
            
              P
              
                j
                |
                i
              
            
          
        
        ]
      
      ⁢
      
        
          p
          j
        
        ⁡
        
          (
          
            o
            t
          
          )
        
      
      ⁢
      
        
      
      ⁢
      and
      ⁢
      
        
      
      ⁢
      
        
          β
          t
        
        ⁡
        
          (
          i
          )
        
      
    
    =
    
      [
      
        
          ∑
          
            i
            =
            1
          
          N
        
        ⁢
        
          
            
              β
              
                t
                +
                1
              
            
            ⁡
            
              (
              j
              )
            
          
          ⁢
          
            P
            
              i
              |
              j
            
          
          ⁢
          
            
              p
              j
            
            ⁡
            
              (
              
                o
                
                  t
                  +
                  1
                
              
              )
            
          
        
      
      ]
    
  




where N is the number of hidden states, Pi|j is the probability of state i given state j and pi(Oi) is the probability for state i of observing ot. From the αt (i) and βt(i) variables, one can obtain the model parameters (i.e., the observation and transition probabilities).

In one aspect, the standard Baum-Welch algorithm provides an efficient estimation procedure of the model parameters from unlabeled data. A trained model can be applied to an automatic hierarchical parsing of an observation sequence such as a dendrogram. However, because of computational complexities associated with the above algorithm, the present invention provides an efficient approximation to the full estimation scheme. The approximation can further be employed to construct models that adapt both model topology and/or associated parameters.
At 318 respective model layers of the layered architecture are connected to the next layer via its inferential results (e.g., log likelihoods). Moreover, at 314, rather than training all or most of the levels at the same time, the parameters for respective levels of LHMMs can be trained independently by means of the Baum-Welch algorithm described above. Thus, the inputs (observations) of a respective level are the inferential outputs of the previous level. At the lowest level, observations (leaves of a model tree) are feature vectors extracted from sensor signals.
Proceeding to 322, model states are determined. In one aspect, a Viterbi algorithm can be employed that yields a most likely sequence of states Ŝ within a model given the observation sequence O={O1, . . . ,On}. This most likely sequence can be obtained by Ŝ=argmaxsP(S|O).
In the case of HMMs, a posterior state sequence probability P(S|O) can be given by:




  
    P
    ⁡
    
      (
      
        S
        |
        O
      
      )
    
  
  =
  
    
      
        P
        s1
      
      ⁢
      
        
          p
          s1
        
        ⁡
        
          (
          
            o
            1
          
          )
        
      
      ⁢
      
        
          ∏
          
            t
            =
            2
          
          T
        
        ⁢
        
          
            
              p
              
                s
                t
              
            
            ⁡
            
              (
              
                o
                t
              
              )
            
          
          ⁢
          
            P
            
              
                s
                t
              
              |
              
                
                  s
                  t
                
                -
                1
              
            
          
        
      
    
    
      P
      ⁡
      
        (
        O
        )
      
    
  




 wherein S={α1, . . . ,aN} is a set of discrete states, st∈S corresponds to a state at time t. Pst=ai|st−1=aj=Pi|j is a state-to-state transition probability (i.e., probability of being in state αt at time t given that the system was in state αj at time t−1). Thus, prior probabilities for an initial state are Pi=Ps1=αt=Ps1. In addition, pi(ot)=pst=at(ot)=pst(ot) represent output probabilities for respective states, (i.e., the probability of observing ot given state αi at time t). For LHMMs, inference can be performed for respective levels of the hierarchy by a similar process of the Viterbi algorithm as employed for HMMs. It is noted that respective levels encode a different temporal abstraction, going from the finest time granularity, at the leaves, to a lowest time granularity (highest level of temporal abstraction), at the root of the tree.

Referring now to FIG. 6, a multi-layer process 400 is illustrated for audio/video processing and behavioral analysis. As noted above, additional levels can be analyzed if desired (or less), and substantially any type of input stream can be analyzed such as with computer inputs. As one particular example of this analysis, LHMMs can be applied within an office-awareness application that exploits the LHMM representation to learn about and detect activities in an office. It is to be appreciated that activities could be detected in other locations such as at home, in a public place, or in an automobile, for example.
Proceeding to 410 of FIG. 6, and at the lowest level of a probabilistic hierarchy, one or more sensor signals or modalities such as images, audio, keyboard and/or mouse activity, are captured and processed. At 414, a feature vector with data from each modality is created and applied to a subsequent layer. As one particular example, time granularity at the lowest level can be set to a duration less than about 100 milliseconds. At 418, and proceeding from the layer analyzed at 414, inputs can be classified via discriminative HMMs. Discriminative HMMs denote HMMs that have been trained to recognize a particular sound or other type of sensor input. When classifying sounds or other real-time data, substantially all the models can be executed in parallel and/or concurrently. At a determined time, the model with the highest likelihood can be selected.
It is noted that typical office sounds—or other input—can be trained and learned in substantially real time, such as human speech, music, silence, ambient noise, phone ringing and keyboard typing, for example, having a single HMM configured per type of sound or other input. Moreover, the source of sound can be localized utilizing a technique based on a Time Delay of Arrival described below. Video signals can also be classified with discriminative HMMs to implement a person detector. At this level 418, a system detects whether one person is present in a room (semi-static), one active person is present, multiple people are present or there is nobody in the office. The inferential results from this layer at 418 (audio and video classifiers), the derivative of a sound localization component, and a history of keyboard and/or mouse activities constitute a feature vector that is passed to the next higher layer in the hierarchy at 422.
The time granularity at the level depicted at 422 can be set to less than 1 second, for example. The layer 422 handles concepts that have longer temporal extent. Such concepts include the user's high-level activities in or near an office or other location, corresponding to a time granularity of about 5–10 seconds (or other time). The behavior models are HMMs whose observations are the inferential outputs of the previous level as described above. Example activities recognized include PHONE CONVERSATION, FACE TO FACE CONVERSATION, PRESENTATION, DISTANT CONVERSATION, NOBODY IN THE OFFICE (or other location), USER PRESENT, ENGAGED IN SOME OTHER ACTIVITY. As noted above, a plurality of other user states can be determined in accordance with the present invention.
Referring to FIG. 7, a methodology 500 illustrates a hierarchical probabilistic process for analyzing real time data in accordance with the present invention. At 510, a multilevel classification system is defined that provides multiple probabilistic layers for analysis. At 520, one or more probabilistic models can be defined per a respective layer. As noted above, this can include independent model training and parametric determinations per layer. At 524, a sample rate is determined for the layers defined at 510. As noted above, lower classification layers generally are provided with finer time granularities (e.g., smaller sample periods) than higher layers in the classification structure, although layers that are near one another (e.g., within about two classification levels) may be configured with similar time periods. At 530, one or more feature vectors are determined for a respective layer and fed to the next subsequent layer in the hierarchy. At 534, higher-level states are inferred from the results (e.g., feature vector results) passed from previous layers (e.g., behavior, activities, patterns, context).
Turning now to FIG. 8, a multi-tier system 600 illustrates a multimodal real-time office awareness in accordance with the processes described above. At a lowest level of the system 600, audio and video processing are performed at 610 and 620 (e.g., audio/microphone and video/camera signals captured per a given sample rate) in accordance with sound probabilistic classifiers at 630 and video probabilistic classifiers at 640. The classifiers 630 and 640 generate a feature vector at 650 that also contains entries from computer activities at 654 such as mouse and keyboard activities, and from a sound localization component at 660, via two or more microphones and a Time Delay of Arrival technique. This feature vector at 650 is then processed by a classifier layer at 670 to predict such aspects of human behavior at 680 (e.g., phone conversation, face to face conversation, presentation, distant conversation, nobody at location, user present, engaged in some other activity).
The system 600 can access/process perceptual information from a plurality of sources. For example, audio processing 610 can include one or more microphones such a binaural microphones. This can include two mini-microphones (e.g., 20–16000 Hz, SNR 58 dB) with an audio sample rate at about 44100 KHz or other frequency. The microphones can be employed for sound classification at 630 and localization at 660. Video processing at 620 can include a Universal Serial Bus (USB) camera (or other type of camera), whereby a video signal is obtained via a standard USB camera and sampled at about 30 frames per second or other rate. Video input can be employed to determine the number of persons present in a scene at 640, for example. Computer activity at 654 can include keyboard and mouse processing, wherein the system 600 or component 654 (e.g., computer with keystroke/mouse monitor operating in background) logs a history of keyboard and mouse activities during the past 5 seconds (or other time), for example.
The raw sensor signals described above can be preprocessed to obtain feature vectors (i.e., observations) for the lowest-level HMMs. On the audio side, Linear Predictive Coding (LPC) coefficients can be computed. Feature selection can be applied on these coefficients by a process of principal component analysis (PCA) (or any other feature selection method). The number of features can be selected such that more than about 95% of the variability in the data is maintained, which is typically achieved with no more than 7 features. Other higher-level features can also be extracted from the audio signal, such as the energy, the mean and variance of the fundamental frequency over a time window, including a zero crossing rate which can be expressed as:




  
    Zero
    ⁢
    
      
    
    ⁢
    
      (
      m
      )
    
  
  =
  
    
      1
      N
    
    ⁢
    
      
        ∑
        
          n
          =
          
            m
            -
            N
            +
            1
          
        
        m
      
      ⁢
      
        
          
            
              |
              
                
                  sign
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      s
                      ⁡
                      
                        (
                        n
                        )
                      
                    
                    )
                  
                
                -
                
                  sign
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      s
                      ⁡
                      
                        (
                        
                          n
                          -
                          1
                        
                        )
                      
                    
                    )
                  
                
              
              |
            
            2
          
          ·
          w
        
        ⁢
        
          
        
        ⁢
        
          (
          
            m
            -
            n
          
          )
        
      
    
  




wherein m is a frame number, N is a frame length, w is a window function, s(n) is a digitized audio signal at an index indicator n, and sign(s(n))={+1, s(n)>=0; −1, s(n)<0}.
As described above, the source of the sound can be localized at 660 via a Time Delay of Arrival (TDOA) process. In TDOA, the measure in question is typically not acoustic data received by the sensors, but rather the time delays between the signals coming from respective sensors. Typically, TDOA based approaches have two parts: a time delay estimation (TDE) and a sound source localization (SSL).
To illustrate this process mathematically, let s(n) be a source signal and let xi(n) be an i-th sensor received signal. If no reverberation is assumed, then xi(n)=ais (n−ti)+bi(n). To model reverberation, a non-linear reverberation function can be added: xi(n)=gi*s(n−ti)+bi(n), wherein αi is an attenuation factor, bi is additive noise and gi is a response between a source and the sensor. In addition, multiple approaches can be provided for estimating the time delay of arrival between the left and right audio signals. In one aspect, suitable performance can be achieved by estimating the peak of a time cross-correlation function between the left and right audio signals over a finite time window




  
    [
    
      N1
      ,
      N2
    
    ]
  
  ,
  
    i
    .
    e
    .
  
  ,
  
    
      
        :
      
      ⁢
      
        
      
      ⁢
      
        
          r
          
            l
            r
          
        
        ⁡
        
          (
          d
          )
        
      
    
    =
    
      
        ∑
        
          n
          =
          
            N
            1
          
        
        
          n
          =
          
            N
            2
          
        
      
      ⁢
      
        
          l
          ⁡
          
            (
            n
            )
          
        
        ⁢
        
          
            r
            ⁡
            
              (
              
                n
                -
                d
              
              )
            
          
          .
        
      
    
  




On the video side, four features (or other number) can be computed, for example: a density of skin color in the image (e.g., obtained via a discriminative histogram between skin and non-skin in HSV space), a density of motion in the image (e.g., obtained by image differences), a density of foreground pixels in the image (e.g., obtained by background subtraction, after having learned the background), and a density of face pixels in the image (obtained by means of a real-time face detector). Also, as noted above, a history of the last 5 seconds (or other times) of mouse and keyboard activities can be logged.

The following discussion describes some of the actual performance aspects of the system 600. In addition, another system (not shown) was adapted with a conventional HMM and results were compared between the conventional, single-dimension arrangement and the multi-tier approach of the present invention. The system 600 was tested in multiple offices, with different users and respective environments for several weeks. In preliminary tests, it was found that the higher-level layers of the hierarchy are quite robust to changes in the environment. Thus, when the system 600 was relocated from one office to another, substantially consistent performance was achieved while mitigating the need for retraining the higher levels of the hierarchy. Typically, only some of the lowest-level features (e.g., such as the ambient noise, the background image, and the skin color threshold) required retraining to tune the lowest hierarchy level to new conditions. Thus, it was observed that the hierarchical structure greatly contributes to the overall robustness of the system 600 given changes in the environment, for example.
In a more quantitative study, the performance of the layered model was compared with that of single, standard HMMs. The feature vector in the latter case results from the concatenation of the audio, video and keyboard/mouse activities features in a long feature vector. These type HMMs are referred to as the Cartesian Product HMMs (CP HMMs). The number of parameters to estimate is much lower for LHMMs than for CP HMMs. For example, a five-state HMM with single Gaussian observations of dimensionality 16 may have 5*(16+16+120)=760 parameters to estimate. A equivalent LHMM with 2 levels, two five-state HMMs with three-dimensional Gaussian observations at the highest level, and one five-state HMM with ten-dimensional Gaussian observations at the lowest level, may have 5*(10+10+45)+5*(3+3+3)+5*(3+3+3)=445 parameters. Consequently, encoding prior knowledge about the problem in the layered structure of the models significantly reduces the dimensionality of the problem. Therefore, for similar amounts of training data, it is expected for LHMMs to have superior performance than HMMs, wherein experimental results further confirm such expectation.
It is noted that it is not substantially more difficult to estimate the structure of LHMMs when compared to HMMs. For HMMs and LHMMs the structure of the models can be estimated—and in the respective levels for LHMMs—employing cross-validation, for example. Typically, the only additional consideration when designing an LHMM architecture is determining the number of levels and associated time granularities to provide. In the experiments, however, it was found that an intuition and knowledge can be developed about the problem at hand to estimate how many layers to use and the time span of the respective layer.
As an example of such experiments, results were compared on the performance of 30 minutes of office activity data (e.g., 5 minutes per activity and 6 activities) of LHMMs and HMMs. Given that it was recorded activity data, the ground truth was known for each activity. Generally, the first few seconds of the datasets were ignored for classification purposes, due to a small lag of the models in recognizing an activity. The results are summarized in table 1 below, wherein the HMMs were tuned to the particular testing data, and the LHMMs had been trained many days before, under different office conditions than that of testing.














TABLE 1







PC
FFC
P
O
NA
DC
















Confusion Matrix for Highly-Tuned HMMs













PC
0.8145
0.0679
0.0676
0.0
0.0
0.05


FFC
0.0014
0.9986
0.0
0.0
0.0
0.0


P
0.0
0.0052
0.9948
0.0
0.0
0.0


O
0.0345
0.0041
0.003
0.9610
0.0
0.0


NA
0.0341
0.0038
0.0010
0.2524
0.7086
0.0


DC
0.0076
0.0059
0.0065
0.0
0.0
0.98







Confusion Matrix for Generic LHMMs













PC
1.0
0.0
0.0
0.0
0.0
0.0


FFC
0.0
1.0
0.0
0.0
0.0
0.0


P
0.0
0.0
1.0
0.0
0.0
0.0


O
0.0
0.0
0.0
1.0
0.0
0.0


NA
0.0
0.0
0.0
0.0
1.0
0.0


DC
0.0
0.0
0.0
0.0
0.0034
0.9966





Table 1: Confusion matrix for highly-tuned HMMs and generic LHMMs on 30 min of real data, where PC = Phone Conversation; FFC = Face to Face Conversation; P = Presentation; O = Other Activity; NA = Nobody Around; DC = Distant Conversion.






From these experiments it was noted that for similar amounts of data, the accuracy of LHMMs is significantly higher than that of HMMs. There are several possible reasons for the better performance of LHMMs when compared to HMMs: (a) The number of parameters of HMMs is about 40% higher than that of LHMMs for the activities being modeled in the experiments. As a consequence, for about the same amount of training data, HMMs have many more parameters to estimate than LHMMs. Therefore, HMMs are generally more prone to over-fitting and worse generalization than LHMMs, especially when trained with limited amounts of data; (b) HMMs carry out high-level inferences about the user's activity, directly from the raw sensor signals. LHMMs, on the other hand, isolate the sensor signals in a different sub-HMM for respective input modalities. The inferential results of these models feed the HMMs in the next layer, in order to characterize human activities. Due to its layered structure, LHMMs appear to be more robust to noise in the sensor signals and have better generalization performance than HMMs.
In another aspect, it was observed that LHMMs are more robust to changes in the environment than HMMs. In general, reasonable performance on HMMs could not be attained unless the models had been highly tuned to a particular testing environment and conditions. In contrast, LHMMs generally did not require retraining, despite changes in office conditions. It was also observed that the discriminative power of LHMMs is notably higher than that of HMMs, wherein discriminative power includes a determination of the distance between the log-likelihood of the two most likely models. The log likelihoods for the HMMs tend to be much closer to one another, thus, showing these models to be prone to instability and errors in classification.
In view of the systems, processes and experiments described above, LHMMs facilitate inferences about context and activity from various perceptual signals. Some important characteristics of LHMMs when compared to HMMs are: (1) LHMMs encode the hierarchical temporal structure of a discrimination problem; thus, the dimensionality of the state space that needs to be learned from data is smaller than that of corresponding Cartesian Product HMMs; (2) LHMMs are easier to interpret, and, thus, easier to refine and improve, than corresponding CP HMMs; (3) LHMMs can encode different levels of abstraction and time granularities that can be linked to different levels of representation for human behaviors; (4) the modularity of LHMMs enables selective retraining of the levels that are most sensitive to environmental or sensor variation, mitigating the burden of training during transfer among different environments.
In order to provide a context for the various aspects of the invention, FIG. 9 and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the various aspects of the present invention may be implemented. While the invention has been described above in the general context of computer-executable instructions of a computer program that runs on a computer and/or computers, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks and/or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the inventive methods may be practiced with other computer system configurations, including single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like. The illustrated aspects of the invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. However, some, if not all aspects of the invention can be practiced on stand-alone computers. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
With reference to FIG. 9, an exemplary system for implementing the various aspects of the invention includes a computer 720, including a processing unit 721, a system memory 722, and a system bus 723 that couples various system components including the system memory to the processing unit 721. The processing unit 721 may be any of various commercially available processors. It is to be appreciated that dual microprocessors and other multi-processor architectures also may be employed as the processing unit 721.
The system bus may be any of several types of bus structure including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of commercially available bus architectures. The system memory may include read only memory (ROM) 724 and random access memory (RAM) 725. A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within the computer 720, such as during start-up, is stored in ROM 724.
The computer 720 further includes a hard disk drive 727, a magnetic disk drive 728, e.g., to read from or write to a removable disk 729, and an optical disk drive 730, e.g., for reading from or writing to a CD-ROM disk 731 or to read from or write to other optical media. The hard disk drive 727, magnetic disk drive 728, and optical disk drive 730 are connected to the system bus 723 by a hard disk drive interface 732, a magnetic disk drive interface 733, and an optical drive interface 734, respectively. The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions, etc. for the computer 720. Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, and the like, may also be used in the exemplary operating environment, and further that any such media may contain computer-executable instructions for performing the methods of the present invention.
A number of program modules may be stored in the drives and RAM 725, including an operating system 735, one or more application programs 736, other program modules 737, and program data 738. It is noted that the operating system 735 in the illustrated computer may be substantially any suitable operating system.
A user may enter commands and information into the computer 720 through a keyboard 740 and a pointing device, such as a mouse 742. Other input devices (not shown) may include a microphone, a joystick, a game pad, a satellite dish, a scanner, or the like. These and other input devices are often connected to the processing unit 721 through a serial port interface 746 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, a game port or a universal serial bus (USB). A monitor 747 or other type of display device is also connected to the system bus 723 via an interface, such as a video adapter 748. In addition to the monitor, computers typically include other peripheral output devices (not shown), such as speakers and printers.
The computer 720 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 749. The remote computer 749 may be a workstation, a server computer, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 720, although only a memory storage device 750 is illustrated in FIG. 9. The logical connections depicted in FIG. 9 may include a local area network (LAN) 751 and a wide area network (WAN) 752. Such networking environments are commonplace in offices, enterprise-wide computer networks, Intranets and the Internet.
When employed in a LAN networking environment, the computer 720 may be connected to the local network 751 through a network interface or adapter 753. When utilized in a WAN networking environment, the computer 720 generally may include a modem 754, and/or is connected to a communications server on the LAN, and/or has other means for establishing communications over the wide area network 752, such as the Internet. The modem 754, which may be internal or external, may be connected to the system bus 723 via the serial port interface 746. In a networked environment, program modules depicted relative to the computer 720, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be employed.
In accordance with the practices of persons skilled in the art of computer programming, the present invention has been described with reference to acts and symbolic representations of operations that are performed by a computer, such as the computer 720, unless otherwise indicated. Such acts and operations are sometimes referred to as being computer-executed. It will be appreciated that the acts and symbolically represented operations include the manipulation by the processing unit 721 of electrical signals representing data bits which causes a resulting transformation or reduction of the electrical signal representation, and the maintenance of data bits at memory locations in the memory system (including the system memory 722, hard drive 727, floppy disks 729, and CD-ROM 731) to thereby reconfigure or otherwise alter the computer system's operation, as well as other processing of signals. The memory locations wherein such data bits are maintained are physical locations that have particular electrical, magnetic, or optical properties corresponding to the data bits.
What has been described above are preferred aspects of the present invention. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the present invention, but one of ordinary skill in the art will recognize that many further combinations and permutations of the present invention are possible. Accordingly, the present invention is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims.

## Claims

1. A learning system for signal processing comprising a computer processor and memory for executing the following components, the system is recorded on a computer-readable medium and capable of execution by a computer, comprising the:
N classification layers, each of the N classification layers associated with MN probabilistic models per layer, N and M being integers, respectively;
at least one parameter defined per a respective classification layer, the parameters trained independently at different classification layers;
at least one input stream that is analyzed by the N classification layers, at least one of the input streams sampled according to varying levels of temporal granularity at the respective classification layers;
a plurality of time inputs that are applied as sample inputs to the respective layers, the plurality of time inputs are arranged in a descending order of temporal granularity, the descending order refers to lower levels of the N classification layers being sampled at finer time granularities than higher levels of the N classification layers;
wherein the N classification layers analyze multiple input streams to determine at least one state associated with a human characteristic, the multiple input streams include at least one of audio data, video data, computer activity data, and other contextual activity data, and wherein at least one of the determined states is stored to enable a computer event; and
at least one computer event that is enabled from at least one of the state, and at least one of the computer events is at least one of anticipated, altered, tuned, and adjusted in accordance with a determined state.

2. The system of claim 1, the computer activity data relates to at least one of mouse movements, applications activity, and keyboard strokes.

3. The system of claim 1, the at least one state includes a context state, the context state defines at least one of what is a user doing, how busy the user is, how focused the user is, and where attentional resources of the user are being applied.

4. The system of claim 1, the at least one state includes at least one of a user activity and a user pattern, the user activity includes at least one of a phone conversation, a face-face conversation, a presentation, a distant conversation, no person in the office, user present, other activity engaged.

5. The system of claim 1, the at least one state includes a behavior, the at least one behavior includes at least one of happy, upset died, relaxed, and excited.

6. The system of claim 5, further comprising at least one of inferences about possible states and implied states.

7. The system of claim 1, the at least one computer event further comprising at least one of invoking an application, adjusting the application, altering timing of the application, providing feedback from the application, adjusting one or more controls, providing information utilities to the user based on the determined state, and executing a subsequent algorithm based upon the determined state.

8. The system of claim 1, further comprising at least one feature vector that is generated by a respective classification layer, the feature vector being passed to a subsequent stage for probabilistic processing.

9. The system of claim 1, the N classification layers are at least one of concurrently processed and serially processed.

10. The system of claim 1, the N classification layers provide a hierarchical configuration to support learning human activities from sensed data.

11. The system of claim 10, the hierarchical configuration employs at least one of Directed Acyclic Graphs (DAG) and Dynamic Graphical Models, the Directed Acyclic Graphs (DAG) and Dynamic Graphical Models include Dynamic Bayesian Networks, a Hidden Markov Model (HMM), and a hierarchically arranged layered Hidden Markov Model (LHMM).

12. The system of claim 11, the DAG includes a set of random variables represented as nodes and one or more directed edges between the nodes.

13. The system of claim 12, the DAG defines a mathematical form of conditional Probability Distribution Function (PDF) between the random variables.

14. The system of claim 11, the HMM performs a quantization of a system configuration space into a small number of discrete states having probabilities for transitions between the states.

15. The system of claim 14, further comprising a finite discrete variable to index a current state of the system.

16. The system of claim 1, the Mn probabilistic models further comprise at least one of Support Vector Machines (SVM), Naive Bayes, Bayesian Network, Dynamic Graphical Models, Decision Trees, Similarity-based, and Vector-based Models.

17. A computer-implemented method to facilitate learning in a sampled data system, comprising the following computer-executed acts:
determining a plurality of parameters for a layered classification system, each layer of the layered classification system includes M associated probabilistic models, M being an integer greater than 1;
connecting at least two layers of the layered classification system, via an inferential result from a lower classification layer to a higher classification layer;
training the plurality of parameters that are configured on different layers of the layered classification system independently;
applying a plurality of time inputs as sample inputs to the layers, the plurality of time inputs are arranged in a descending order of temporal granularity, the descending order refers to lower levels of the N classification layers being sampled at finer time granularities than higher levels of the N classification layers;
determining at least one model state from the layered classification system;
storing at least one of the determined model states for adjusting a computer event; and
adjusting at least one computer event based upon at least one of the determined model states, the computer event comprises at least one of adjusting computer applications, adjusting timing, providing feedback, and changing at least one control.

18. The method of claim 17, further comprising learning the plurality of parameters by solving a forward-backward algorithm.

19. The method of claim 18, the forward-backward algorithm provides expressions for an αt (i) and βr (i) variables forming a normalized product leads to γt (i)=P (qt=Si |O(1:t)), wherein a conditional likelihood of a particular state Si at time t, is given as O(1:t), representing observations up to time t, the αt (i) variable is expressed as:




  
    
      
        α
        
          t
          +
          1
        
      
      ⁡
      
        (
        j
        )
      
    
    =
    
      
        [
        
          
            ∑
            
              i
              =
              1
            
            N
          
          ⁢
          
            
              
                α
                t
              
              ⁡
              
                (
                i
                )
              
            
            ⁢
            
              P
              
                j
                |
                i
              
            
          
        
        ]
      
      ⁢
      
        
          p
          j
        
        ⁡
        
          (
          
            o
            t
          
          )
        
      
    
  
  ,




the βt (i) variable is expressed as:




  
    
      
        β
        t
      
      ⁡
      
        (
        i
        )
      
    
    =
    
      [
      
        
          ∑
          
            i
            =
            1
          
          N
        
        ⁢
        
          
            
              β
              
                t
                +
                1
              
            
            ⁡
            
              (
              j
              )
            
          
          ⁢
          
            P
            
              i
              |
              j
            
          
          ⁢
          
            
              p
              j
            
            ⁡
            
              (
              
                o
                
                  t
                  +
                  1
                
              
              )
            
          
        
      
      ]
    
  
  ,




wherein N is the number of hidden states, Pij is the probability of state i given state j and pi (ot) is the probability for state i of observing ot.

20. The method of claim 17 the at least one model state is determined via a Viterbi algorithm that yields a most likely sequence of states Ŝwithin the model given an observation sequence O={Ol. . . ,On}.

21. The method of claim 20, the most likely sequence of states Ŝ determined by Ŝ=argmaxsP(S|O).

22. The method of claim 21, further comprising a posterior state sequence probability P(S|O) that is expressed as:




  
    P
    ⁡
    
      (
      
        S
        |
        O
      
      )
    
  
  =
  
    
      
        P
        s1
      
      ⁢
      
        
          p
          s1
        
        ⁡
        
          (
          
            o
            1
          
          )
        
      
      ⁢
      
        
          ∏
          
            t
            =
            2
          
          T
        
        ⁢
        
          
            
              p
              
                s
                t
              
            
            ⁡
            
              (
              
                o
                t
              
              )
            
          
          ⁢
          
            P
            
              
                s
                t
              
              |
              
                s
                
                  t
                  -
                  1
                
              
            
          
        
      
    
    
      P
      ⁡
      
        (
        O
        )
      
    
  



wherein S={a1, . . . ,aN}; is a set of discrete states, st∈S corresponds to a state at time t, and Pi|j=Pst=ai |s t−1=αj is a stats-to-state transition probability.

23. The method of claim 22, further comprising determining prior probabilities for an initial state as Pi=Psj=ai=Ps l and determining pi(ot)=pst=ai(ot=pst(ot)) to represent output probabilities for respective states.

24. A computer-implemented method to facilitate signal processing in an intelligent system, comprising the following computer-executed acts:
applying a plurality of sensor signals at a base layer of a probabilistic hierarchy;
determining at least one feature vector for an intermediary layer of the probabilistic hierarchy;
employing a tertiary layer of the probabilistic hierarchy to discriminate data;
applying a plurality of time inputs as sample inputs to the base, intermediary and tertiary layers, the plurality of time inputs are arranged in a descending order of temporal granularity, the descending order refers to lower levels of the N classification layers being sampled at finer time granularities than higher levels of the N classification layers;
associating longer temporal concepts with subsequent layers of the probabilistic hierarchy, the base layer, the intermediary layer, the tertiary layer and subsequent layers of the probabilistic hierarchy comprise a plurality of probabilistic models;
determining at least one model state from the base, intermediary and tertiary layers;
storing at least one of the determined model states for adjusting a computer event; and
adjusting at least one computer event based upon at least one of the determined model state, the computer event comprises at least one of adjusting computer applications, adjusting timing, providing feedback and changing at least one control.

25. The method of claim 24, further comprising applying the probabilistic hierarchy within an awareness application in order to at least one of learn and detect activities associated with the application.

26. The method of claim 25, the activities are associated with at least one of an office, a location, a home, a public place, and an automobile.

27. The method of claim 24, further comprising discriminating data by training at least one HMM to recognize a sensor input.

28. The method of claim 24, further comprising classifying audio signals with at least one HMM in order to implement a sound classifier.

29. The method of claim 24, further comprising a sound that is localized utilizing a Time Delay of Arrival technique.

30. The method of claim 24, further comprising classifying video signals with at least one HMM in order to implement a person detector.

31. A computer-implemented method to facilitate real time signal processing, comprising the following computer-executed acts:
defining a multi-layer classification system;
defining one or more probabilistic models per a respective layer of the multi-layer classification system;
defining different sample rates per the respective layer;
applying a plurality of time inputs as sample inputs to the respective layers, the plurality of time inputs are arranged in a descending order of temporal granularity, the descending order refers to lower levels of the N classification layers being sampled at finer time granularities than higher levels of the N classification layers;
feeding inferential outputs from previous layers to subsequent layers of the multi-layer classification system;
inferring multiple states from analytical results derived from previous layers;
storing the inferred model states for adjusting a computer event; and
adjusting at least one computer event based upon the inferred multiple states, the computer event comprises at least one of adjusting computer applications, adjusting timing, providing feedback, and changing at least one control.

32. An analysis system comprising a computer processor and memory for executing the following software components, the system is recorded on a computer-readable medium and capable of execution by a computer, comprising:
at least one processing component at a lowest layer of a classification system to analyze multiple signal input streams;
at least one feature vector indicating results from a portion of the lowest layer; and
at least one behavioral model executable on a highest layer of the classification system to infer human behavior based at least in part on the feature vector, the lowest layer, the higher layer and intermediary layers of the classification system comprise a plurality of probabilistic models
a plurality of time inputs that are applied as sample inputs to the lowest and highest layers, the plurality of time inputs are arranged in a descending order of temporal granularity, the descending order refers to lower levels of the N classification layers being sampled at finer time granularities than higher levels of the N classification layers, and wherein the inferred human behavior is stared to enable a computer event; and
at least one computer event that is enabled from the inferred human behavior, at least one of the computer events is at least one of anticipated, altered, tuned, and adjusted in accordance with the inferred human behavior.

33. The system of claim 32, the human behavior includes at least one of phone conversation, face-to-face conversation, conversation, presentation, distant conversation, nobody at location, user present, and engaged in some other activity.

34. The system of claim 32, further comprising at least one of binaural microphones to provide audio inputs, and a Universal Serial Bus (USB) camera to provide video signals.

35. The system of claim 32, the processing component determines Linear Predictive Coding (LPC) coefficients and applies a feature selection on the coefficients by a process of principal component analysis (PCA).

36. The system of claim 32, the processing component extracts higher-level features from the input streams including at least one of an energy computation, a mean and variance of a fundamental frequency over a time window computation, and a zero crossing rate determination.

37. The system of claim 36, the zero crossing rate determination is expressed as:




  
    Zero
    ⁡
    
      (
      m
      )
    
  
  =
  
    
      1
      N
    
    ⁢
    
      
        ∑
        
          n
          =
          
            m
            -
            N
            +
            1
          
        
        m
      
      ⁢
      
        
          
            
            
              
                sign
                ⁡
                
                  (
                  
                    s
                    ⁡
                    
                      (
                      n
                      )
                    
                  
                  )
                
              
              -
              
                sign
                ⁡
                
                  (
                  
                    s
                    ⁡
                    
                      (
                      
                        n
                        -
                        1
                      
                      )
                    
                  
                  )
                
              
            
            
          
          2
        
        ·
        
          w
          ⁡
          
            (
            
              m
              -
              n
            
            )
          
        
      
    
  



wherein m is a frame number, N is a frame length, w is a window function, s(n) is a digitized speech signal at an index indicator n, and sign(s(n))={+1, s(n)>=0; −1, s(n)<0}.

38. The system of claim 32, further comprising a component to determine a feature, the feature including at least one of a density of skin color in an image, a density of motion in the image, a density of foreground pixels in the image and a density of face pixels in the image.

39. The system of claim 32, further comprising a localization component to localize sound, the localization component employing a Time Delay of Arrival (TDOA) process.

40. The system of claim 39, the TDOA determines time delays between signals originating from different sensors, the TDOA includes at least one of a time delay estimation (TDE) and a sound source localization (SSL).

41. A system to facilitate computer signal processing comprising a computer processor and memory for executing the following software components, the system is recorded on a computer-readable medium and capable of execution by a computer, comprising:
means for configuring a multi-layer classification system;
means for training one or more probabilistic models per a respective layer of the multi-layer classification system;
means for providing various time sample rates per the respective layer;
means for applying a plurality of time inputs as sample inputs to the respective layers, the plurality of time inputs are arranged in a descending order of temporal granularity, the descending order refers to lower levels of the N classification layers being sampled at finer time granularities than higher levels of the N classification layers;
means for feeding inferential outputs from previous layers to subsequent layers of the multi-layer classification system;
means for inferring multiple human states from analytical results derived from previous layers;
means for storing the inferred multiple human states for adjusting a computer event; and
means for adjusting at least one computer event based upon the inferred multiple human states, the computer event comprises at least one of adjusting computer applications, adjusting timing, providing feedback, and changing at least one control.

42. A signal to communicate sensor data between at least two nodes system for signal processing, comprising a computer processor and memory for executing the following components, the signal is recorded on a computer-readable medium and capable of execution by a computer, comprising:
a first data packet comprising:
an N layered classification component employed to communicate probabilistic results between at least two layers of N layered classification system; and
at least one parameter defined per a respective classification layer, the parameters trained independently at different classification layers; and
at least one input stream that is analyzed by the N classification layers, at least one of the input streams is sampled according to varying levels of temporal granularity at the respective classification layers, the N layered classification component and the different classification layers comprise M probabilistic models, M and N being integers greater than 1;
a plurality of time inputs that are applied as sample inputs to the respective layers, the plurality of time inputs are arranged in a descending order of temporal granularity, the descending order refers to lower levels of the N classification layers being sampled at finer time granularities than higher levels of the N classification layers;
wherein the N classification layers analyze multiple input streams to determine at least one state associated with a human characteristic, the multiple input streams include at least one of audio data, video data, computer activity data, and other contextual activity data, and wherein at least one of the states is stored to enable a computer event; and
at least one computer event that is enabled from at least one of the states, and at least one of the computer events is at least one of anticipated, altered, tuned, and adjusted in accordance with a determined state.