US 6,683,968 B1Grant

Method for visual tracking using switching linear dynamic system models

Issue Date:2004-01-27

•1 Claims

•18 Drawing Sheets

Abstract

A target in a sequence of measurements is tracked by modeling the target with a switching linear dynamic system (SLDS) having a plurality of dynamic models. Each dynamic model is associated with a switching state such that a model is selected when its associated switching state is true. A set of continuous state estimates is determined for a given measurement, and for each possible switching state. A state transition record is then determined by determining and recording, for a given measurement and for each possible switching state, an optimal previous switching state, based on the measurement sequence, where the optimal previous switching state optimizes a transition probability based on the set of continuous state estimates. A measurement model of the target is fitted to the measurement sequence. The measurement model is the description of the influence of the state on the measurement. It couples what is observed to the estimated target. Finally, a trajectory of the target is estimated from the measurement model fitting, the state transition record and parameters of the SLDS, where the estimated trajectory is a sequence of continuous state estimates of the target which correspond to the measurement sequence. The set of continuous state estimates is preferably obtained through Viterbi prediction. The optimal previous switching state can be an optimal prior switching state, or can be an optimal posterior switching state.

Metadata

Assignee

Hewlett-Packard Development Company, L.P.

Inventors

Vladimir Pavlović
James Matthew Rehg

Application Information

Application Number:US 09/654,022

Filing Date:2000-09-01

Priority Date:1999-09-16

Art Unit:7

Classifications

IPC:

G06K 900

Field of Search:

382107382103382181382224382228382225382235382236355262355265355341709100709231342 95342107342136342101342195348169348170348171348172

Patent Drawings (18 sheets)

Description

[0002] This application claims the benefit of U.S. Provisional Application No. 60/154,384, filed Sep. 16, 1999, the entire teachings of which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

[0003] Technologies for analyzing the motion of the human figure play a key role in a broad range of applications, including computer graphics, user-interfaces, surveillance, and video editing. These applications cover three sub-tasks in motion analysis: synthesis, classification, and motion tracking.

[0004] A motion of the figure can be represented as a trajectory in a state space which is defined by the kinematic degrees of freedom of the figure. Each point in state space represents a single configuration or pose of the figure. A motion such as a plié in ballet is described by a trajectory along which the joint angles of the legs and arms change continuously.

[0005] A key issue in human motion analysis and synthesis is modeling the dynamics of the figure. While the kinematics of the figure define the state space, the dynamics define which state trajectories are possible (or probable).

[0006] In video tracking applications, a model of the figure kinematics is fit to an input video sequence, resulting in an estimated motion trajectory. Each point in the measured trajectory corresponds to a certain pose of the figure in a single video frame. Tracking is difficult because figure motion produces complex visual effects in a video sequence. While the skeleton itself can be approximated as a collection of articulated rigid links, its motion can only be measured indirectly through its effect on skin and clothing. Cloth and skin wrinkle and bulge as the figure moves, and changes in lighting and self-shadowing further complicate appearance modeling. In addition, self-occlusions of the figure, clutter in the background of the video, and the independent motion of the camera further complicate the task of estimating figure motion.

[0007] A dynamic model cab be a powerful cue in figure tracking, as it reduces the total space of possible configurations of the figure down to the set of trajectories that are consistent with the dynamics. In the simplest case, the dynamics can reflect the inertia of the figure and capture the fact that when an arm is swinging in an upward motion, it is more likely to continue swinging upward than, for example, to suddenly move down. This constraint can eliminate many incorrect poses of the figure in cases where the video data is ambiguous.

[0008] Even more effective tracking is possible when highly specific dynamic models are available for certain classes of motions. For example, the set of gestures that make up American Sign Language comprise only a small subset of the space of dynamically-feasible motions. A dynamic model that is tuned to this subset of gestures could provide even stronger constraints for visual tracking.

[0009] Tracking technology can play a critical role in applications such as video editing. Tracking can be used to build “high level” descriptions of video content based on the analysis of object motion. The ability to reliably track the motion of the figure, as well as the motion of the camera and other objects, is a key step in identifying the pixels in each frame that belong to a given object. Once this segmentation has been accomplished, an editing system can support high-level operations, such as removing people from, or adding people to, an existing video clip. Such simple to use but potentially very powerful editing tools could be particularly interesting in the consumer market, given the increasing popularity of digital video cameras that can be easily interfaced to PCs. Tracking technology also has many other applications to surveillance systems and user-interfaces.

Prior Approaches

[0010] Although the use of kinematic models in figure tracking is now commonplace, dynamic models have received relatively little attention. Most work on tracking employs one of two types of dynamic models: analytic or learned. Analytic models are specified by a human designer. They are typically second order differential equations relating joint torque, mass, and acceleration. Learned models, on the other hand, are constructed automatically from examples of human motion data.

Analytic Dynamic Models

[0011] The prior art includes a range of hand-specified analytic dynamical models. On one end of the spectrum are simple generic dynamic models based, for example, on constant velocity assumptions. Complex, highly specific models occupy the other end.

[0012] A number of proposed figure trackers use a generic dynamic model based on a simple smoothness prior such as a constant velocity Kalman filter. See, for example, Ioannis A. Kakadiaris and Dimitris Metaxas, “Model-based estimation of 3D human motion with occlusion based on active multi-viewpoint selection,” Computer Vision and pattern Recognition, pages 81-87, San Franciso, Calif., Jun. 18-20, 1996. Such models fail to capture subtle differences in dynamics across different motion types, such as walking or running. It is unlikely that these models can provide a strong constraint on complex human motion such as dance.

[0013] The field of biomechanics is a source of more complex and realistic models of human dynamics. From the biomechanics point of view, the dynamics of the figure are the result of its mass distribution, joint torques produced by the motor control system, and reaction forces resulting from contact with the environment, e.g., the floor. Research efforts in biomechanics, rehabilitation, and sports medicine have resulted in complex, specialized models of human motion. For example, entire books have been written on the subject of walking. See, for example, Inman, Ralston and Todd, “Human Walking,” Williams and Wilkins, 1981.

[0014] The biomechanical approach has two drawbacks for analysis and synthesis applications. First, the dynamics of the figure are quite complex, involving a large number of masses and applied torques, along with reaction forces which are difficult to measure. In principle, all of these factors must be modeled or estimated in order to produce physically-valid dynamics. Second, in some applications we may only be interested in a small set of motions, such as a vocabulary of gestures. In the biomechanical approach, it may be difficult to reduce the complexity of the model to exploit this restricted focus. Nonetheless, these models have been applied to tracking and synthesis applications.

[0015] Wren and Pentland, “Dynamic models of human motion”, Proceeding of the Third International Conference on Automatic Face and Gesture Recognition, pages 22-27, Nara, Japan, 1998, explored visual tracking using a biomechanically-derived dynamic model of the upper body. The unknown joint torques were estimated along with the state of the arms and head in an input estimation framework. A Hidden Markov Model (HMM) was trained to represent plausible sequences of input torques. Due to the simplicity of their experimental domain, there was no need to model reaction forces between the figure and its environment.

[0016] This solution suffers from the limitations of the biomechanical approach outlined above. In particular, describing the entire body would require a significant increase in the complexity of the model. Even more problematic is the treatment of the reaction forces, such as those exerted by the floor on the soles of the feet during walking or running.

[0017] Biomechanically-derived dynamic models have also been applied to the problem of synthesizing athletic motion, such as bike racing or sprinting, for computer graphics animations. See, for example, Hodgins, Wooten, Brogan and O'Brien, “Animating human athletics,” Computer Graphics (Proc. SIGGRAPH '95), pages 71-78, 1995. In the present invention, there is, in addition to the usual problems of complex dynamic modeling, the need to design control programs that produce the joint torques that drive the figure model. In this approach, it is difficult to capture more subtle aspects of human motion without some form of automated assistance. The motions that result tend to appear very regular and robotic, lacking both the randomness and fluidity associated with natural human motion.

Learned Dynamic Models

[0018] Four earlier works have addressed the problem of learning complex dynamic models from data within a state space framework. The approaches are all based on building statistical models of motion trajectories whose parameters are learned from a corpus of sample motions.

[0019] Brand, “Pattern discovery via entorpy minimization,” Technical Report TR98-21, Mitsubishi Electric Research Lab, 1998, available at http://www.merl.com/reports/TR98-21/index.html, proposes an HMM-based framework for dynamics learning and applies it to synthesize realistic facial animations from a training corpus. The main component of this work is the use of an entropic prior to cope with sparse input data.

[0020] Brand's approach has two potential disadvantages. First, Brand assumes that the resulting dynamic model is time invariant; each state space neighborhood has a unique distribution over state transitions. Second, the use of entropic priors results in fairly “deterministic” models learned from a moderate corpus of training data. In contrast, the diversity of human motion applications requires complex models learned from a large corpus of data. In this situation, it is unlikely that a time invariant model will suffice, since different state space trajectories can originate from the same starting point, depending upon the class of motion being performed.

[0021] Ghahramani and Roweis, “Learning nonlinear stochastic dynamics using the generalized EM algorithm,” NIPS '99, Snowbird, Utah, 1999, use a Kalman smoother in conjunction with the generalized EM algorithm to learn a class of nonlinear dynamic models from input-output data. The requirement for computational tractability restricts the class of non-linearities in the model to a sum of Gaussian and affine kernels. Even though this approach attempts to explicitly model the non-linearity of the state transitions, it still suffers from the same time invariant restriction as the first approach.

[0022] Briegel and Tresp, “A monte carlo generalized EM-type algorithm for state and parameter estimation in nonlinear state space models,” Machines that Learn Workshop, Snowbird, Utah, 1998, along with Blake, North and Isard, “Learning multi-class dynamics,” NIPS '98, 1998, have addressed the use of nonparametric probability density models to perform dynamics learning. Blake's approach in particular has the ability to learn multiclass dynamics, meaning that the system can switch between multiple learned models. This may make it possible to learn time-varying models, unlike much of the other prior art.

[0023] However, the use of a nonparametric model can be inefficient in domains where linear Gaussian models are a powerful building block. Nonparametric methods are particularly expensive when applied to large state spaces, since they are exponential in the state space dimension. Complexities in the motion of the figure and its appearance suggest that a fairly large state space will be required for good performance.

[0024] A final piece of relevant prior art in the learning domain is the work of Yacoob and Davis, “Learned temporal models of image motion,” Computer Vision and Pattern Recognition, pages 446-453, 1998, in learning temporal models of motion in images. Unlike the more common state space models, this approach concentrates directly on the image space by representing any motion as a flow field in some particular flow field space. The basis of that space is learned from a corpus of examples. Hence, different bases capture distinct motion types. One drawback of this approach is that it only captures motion of a fairly fixed (and known) duration. For example, a prototypical walk of only one particular speed can be learned. Another disadvantage is that the models that result are highly viewpoint-specific, since they depend implicitly on the camera position. Furthermore, the approach is primarily suited for analysis rather than synthesis of motion sequences.

Motion Capture for Motion Synthesis

[0025] A final category of prior art which is relevant to this invention is the use of motion capture to synthesize human motion with realistic dynamics. Motion capture is by far the most successful commercial technique for creating computer graphics animations of people. In this method, the motion of human actors is captured in digital form, using a special suit with either optical or magnetic sensors or targets. This captured motion is edited and used to animate graphical characters.

[0026] The motion capture approach has two important limitations. First, the need to wear special clothing in order to track the figure limits the application of this technology to motion which can be staged in a studio setting. This rules out the live, real-time capture of events such as the Olympics, dance performances, or sporting events in which some of the finest examples of human motion actually occur.

[0027] The second limitation of current motion capture techniques is that they result in a single prototype of human motion which can only be manipulated in a limited way without destroying its realism. Using this approach, for example, it is not possible to synthesize multiple examples of the same type of motion which differ in a random fashion. The result of motion capture in practice is typically a kind of “wooden,” fairly inexpressive motion that is most suited for animating background characters. That is precisely how this technology is currently used in Hollywood movie productions.

[0028] There is a clear need for more powerful tracking techniques that can recover human motion under less restrictive conditions. Similarly there is a need for more powerful generative models of human motion that are both realistic and capable of generating sample motions with natural amounts of “randomness.”

SUMMARY OF THE INVENTION

[0029] We describe a novel approach to learning dynamic models from a training corpus of observed state space trajectories. In cases where sufficient training data is available, the learning approach provides flexibility and generality. A wide range of learning algorithms can be cast in the framework of Dynamic Bayesian Networks (DBNs). DBNs generalize two well-known signal modeling tools: Kalman filters for continuous state linear dynamic systems (LDS), and Hidden Markov Models (HMMs) for classification of discrete state sequences. See, for example, Anderson and Moore, “Optimal filtering,” Prentice-Hall, Inc., Englewood Cliffs, N.J., 1979, and Rabiner and Juang, “Fundamentals of Speech Recognition,” Prentice Hall, Engelwood Cliffs, N.J., 1993.

[0030] We focus on a subclass of DBN models called Switching Linear Dynamics Systems (SLDSs) as described in, for example, Bar-Shalom and Li, “Estimation and tracking: principles, techniques, and software,” YBS, Storrs, Conn., 1998; Shumway and Stoffer, “Dynamic linear models with switching,” Journal of the American Statistical Association, 86(415):763-769, September 1991; Kim, “Dynamic linear models with markov-switching,” Journal of Econometrics, 60:1-22, 1994; Ghahramani and Hinton, “Switching state-space models,” submitted for publication, 1989; Pavlovic, Frey and Huang, “Time-series classification using mixed-state dynamic Bayesian networks,” Computer Vision and Pattern Recognition, pages 609-615, June 1999.

[0031] Intuitively, these models attempt to describe a complex nonlinear dynamic system with a succession of linear models that are indexed by a switching variable. While other approaches, such as learning weighted combinations of linear models, are possible, the switching approach has an appealing simplicity and is naturally suited to the case where the dynamics are time-varying.

[0032] Therefore, there is a need for inference and learning methods for fully coupled SLDS models that can estimate a complete set of model parameters for a switching model given a training set of time-series data.

[0033] Described herein is a new class of approximate learning methods for switching linear dynamic (SLDS) models. These models consist of a set of linear dynamic system (LDS) models and a switching variable that indexes the active model. This new class has three advantages over dynamics learning methods known in the prior art:

[0034] New approximate inference techniques lead to tractable learning even when the set of LDS models is fully coupled.

[0035] The resulting models can represent time-varying dynamics, making them suitable for a wide range of applications.

[0036] All of the model parameters are learned from data, including the plant and noise parameters for the LDS models and Markov model parameters for the switching variable.

[0037] In addition, this method can be applied to the problem of learning dynamic models for human motion from data. It has three advantages over analytic dynamic models known in the prior art:

[0038] Models can be constructed without a laborious manual process of specifying mass and force distributions. Moreover, it may be easier to tailor a model to a specific class of motion, as long as a sufficient number of samples are available.

[0039] The same learning approach can be applied to a wide range of human motions from dancing to facial expressions.

[0040] When training data is obtained from analysis of video measurements, the spatial and temporal resolution of the video camera determine the level of detail at which dynamical effects can be observed. Learning techniques can only model structure which is present in the training data. Thus, a learning approach is well-suited to building models at the correct level of resolution for video processing and synthesis.

[0041] A wide range of learning algorithms can be cast in the framework of Dynamic Bayesian Networks (DBNs). DBNs generalize two well-known signal modeling tools: Kalman filters for continuous state linear dynamic systems (LDS) and Hidden Markov Models (HMMs) for discrete state sequences. Kalman filters are described in Anderson et al., “Optimal Filtering”, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1979. Hidden Markov Models are reviewed in Jelinek, “Statistical methods for speech recognition” MIT Press, Cambridge, Mass., 1998.

[0042] Dynamic models learned from sequences of training data can be used to predict future values in a new sequence given the current values. They can be used to synthesize new data sequences that have the same characteristics as the training data. They can be used to classify sequences into different types, depending upon the conditions that produced the data.

[0043] Accordingly, a method for tracking a target in a sequence of measurements includes modeling the target with a switching linear dynamic system (SLDS) having a plurality of dynamic models. Each dynamic model is associated with a switching state such that a model is selected when its associated switching state is true. A set of continuous state estimates is determined for a given measurement, and for each possible switching state. A state transition record is then determined by determining and recording, for a given measurement and for each possible switching state, an optimal previous switching state, based on the measurement sequence, where the optimal previous switching state optimizes a transition probability based on the set of continuous state estimates. A measurement model of the target is fitted to the measurement sequence. The measurement model is the description of the influence of the state on the measurement. It couples what is observed to the estimated target. Finally, a trajectory of the target is estimated from the measurement model fitting, the state transition record and parameters of the SLDS, where the estimated trajectory is a sequence of continuous state estimates of the target which correspond to the measurement sequence.

[0044] In at least one embodiment of the present invention, the set of continuous state estimates is obtained through Viterbi prediction.

[0045] The optimal previous switching state can be an optimal prior switching state, and in one embodiment, the transition probability is dependent only upon Markov process probabilities.

[0046] Alternatively, the optimal previous switching state can be an optimal posterior switching state.

[0047] In one embodiment, the set of continuous state estimates is obtained by combining Viterbi predictions with samples drawn at random according to a continuous state sampling density. Furthermore, the set of continuous state estimates can be obtained by combining just a subset of Viterbi predictions with samples drawn at random according to a continuous state sampling density.

[0048] In one embodiment, the continuous state sampling density is given by a Viterbi mixture density.

[0049] In one embodiment, the set of continuous state estimates is updated based on the given measurement, and the optimal previous switching state optimizes a posterior transition probability over the updated set of state estimates.

[0050] The samples from a continuous state sampling density can be updated, for example, by a gradient descent procedure.

[0051] Alternatively, the samples can be updated by linearizing around sample positions and applying an Iterated Extended Kalman Filter.

[0052] In one embodiment, the measurement sequence comprises an image sequence. The transition probability is responsive to the comparison between an image feature model and the given image measurement.

[0053] The image feature model can be, for example, a template model or a contour model.

[0054] In one embodiment, the SLDS model can model, for example, the motion of a human figure, where the SLDS parameters may have been learned, for example, from training data containing figure motion.

[0055] Alternatively, the SLDS model can model the motions of a human face, where the SLDS parameters may have been learned, for example, from training data containing facial motion.

[0056] In yet another alternative, the SLDS model models the evolution of acoustic features in a speech waveform. The SLDS model can, for example, describe the dynamics of formants in a frequency-domain representation of speech.

[0057] In yet another embodiment, the SLDS model describes the evolution of financial data.

BRIEF DESCRIPTION OF THE DRAWINGS

[0058] The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of preferred embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.

[0059] FIG. 1 is a block diagram of a linear dynamical system, driven by white noise, whose state parameters are switched by a Markov chain model.

[0060] FIG. 2 is a dependency graph illustrating a fully coupled Bayesian network representation of the SLDS of FIG. 1.

[0061] FIG. 3 is a block diagram of an embodiment of the present invention based on approximate Viterbi inference.

[0062] FIGS. 4A and 4B comprise a flowchart illustrating the steps performed by the embodiment of FIG. 3.

[0063] FIG. 5 is a block diagram of an embodiment of the present invention based on approximate variational inference.

[0064] FIG. 6 is a dependency graph illustrating the decoupling of the hidden Markov model and SLDS in the embodiment of FIG. 5.

[0065] FIG. 7 is a flowchart illustrating the steps performed by the embodiment of FIG. 5.

[0066] FIGS. 8A and 8B comprise a flowchart illustrating the steps performed by a GPB2 embodiment of the present invention.

[0067] FIG. 9 comprises two graphs which illustrate learned segmentation of a “jog” motion sequence.

[0068] FIG. 10 is a block diagram illustrating classification of state space trajectories, as performed by the present invention.

[0069] FIG. 11 comprises several graphs which illustrate an example of segmentation.

[0070] FIG. 12 is a block diagram of a Kalman filter as employed by an embodiment of the present invention.

[0071] FIG. 13 is a diagram illustrating the operation of the embodiment of FIG. 12 for the specific case of figure tracking.

[0072] FIG. 14 is a diagram illustrating the mapping of templates.

[0073] FIG. 15 is a block diagram of an iterated extended Kalman filter (IEKF).

[0074] FIG. 16 is a block diagram of an embodiment of the present invention using an IEKF in which a subset of Viterbi predictions is selected and then updated.

[0075] FIG. 17 is a block diagram of an embodiment in which Viterbi predictions are first updated, after which a subset is selected.

[0076] FIG. 18 is a block diagram of an embodiment which combines SLDS prediction with sampling from a prior mixture density.

[0077] FIG. 19 is a block diagram of an embodiment in which Viterbi estimates are combined with updated samples drawn from a prior density.

[0078] FIG. 20 is a block diagram illustrating an embodiment of the present invention in which the framework for synthesis of state space trajectories in which an SLDS model is used as a generative model.

[0079] FIG. 21 is a dependency graph of an SLDS model, modified according to an embodiment of the present invention, with added continuous state constraints.

[0080] FIG. 22 is a dependency graph of an SLDS model, modified according to an embodiment of the present invention, with added switching state constraints.

[0081] FIG. 23 is a dependency graph of an SLDS model, modified according to an embodiment of the present invention, with both added continuous and switching state constraints.

[0082] FIG. 24 is a block diagram of the framework for a synthesis embodiment of the present invention using constraints and utilizing optimal control.

[0083] FIG. 25 is an illustration of a stick figure motion sequence as synthesized by an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

SWITCHING LINEAR DYNAMIC SYSTEM MODEL

[0084] FIG. 1 is a block diagram of a complex physical linear dynamic system (LDS) 10, driven by white noise v_k, also called “plant noise.” The LDS state parameters evolve in time according to some known model, such as a Markov chain (MC) model 12.

[0085] The system can be described using the following set of state-space equations:

[0086] x_t+1=A(s_t+1)x_t+v_t+1(s_t+1),

[0087] y_t=Cx_t+w_t, and

[0088] x₀=v₀(s₀) (Eq. 1)

[0089] for the physical system 10, and

[0090] Pr(s_t+1|s₁)=s′_t+1Πs_t, and

[0091] Pr(s₀)=π₀

[0092] for the switching model 12.

[0093] Here, x_tε^Ndenotes the hidden state of the LDS 10 at time t, and v_tis the state noise process. Similarly, y_tε^Mis the observed measurement at time t, and w_tis the measurement noise. Parameters A and C are the typical LDS parameters: the state transition matrix 14 and the observation matrix 16, respectively. Assuming the LDS models a Gauss-Markov process, the noise processes are independently distributed Gaussian:

[0094] v_t(s_t)˜N(0, Q(s_t)), t>0

[0095] v₀(s₀)˜N(x₀(s₀), Q₀(s₀))

[0096] w_t˜N(0, R).

[0097] where Q is the state noise variance and R is the measurement noise variance. The notation s′ is used to indicate the transpose of vector s.

[0098] The switching model 12 is assumed to be a discrete first-order Markov process. State variables of this model are written as s_t. They belong to the set of S discrete symbols {e₀, . . . , e_S−1}, where e_iis, for example, the unit vector of dimension S with a non-zero element in the i-th position. The switching model 12 is a first-order discrete Markov model defined with the state transition matrix Π whose elements are

[0099] Π(i, j)=Pr(s_t+1=e_i|s_t=e_j), (Eq. 2)

[0100] and which is given an initial state distribution Π₀.

[0101] Coupling between the LDS and the switching process is full and stems from the dependency of the LDS parameters A and Q on the switching process state s_t. Namely,

[0102] A(s_t=e_i)=A_i

[0103] Q(s_t=e_i)=Q_i

[0104] In other words, switching state s_tdetermines which of S possible models {(A₀,Q₀), . . . , (A_S−1,Q_S−1) } is used at time t.

[0105] FIG. 2 is a dependency graph 20 equivalently illustrating a rather simple but fully coupled Bayesian network representation of the SLDS, where each s_tdenotes an instance of one of the discrete valued action states which switch the physical system models having continuous valued states x and producing observations y. The full model can be written as the “joint distribution” P:

P (Y_{T}, X_{T}, S_{T}) = \Pr (s_{0}) \prod_{t = 1}^{T - 1} \Pr (s_{t} | s_{t - 1})

\Pr (x_{0} | s_{0}) \prod_{t = 1}^{T - 1} \Pr (x_{t} | x_{t - 1}, s_{t}) \prod_{t = 0}^{T - 1} \Pr (y_{t} | x_{t}) .

[0106] where Y_T, X_T, and S_Tdenote the sequences, of length T, of observation and hidden state variables, and switching variables, respectively. For example, Y_T={y₀, . . . , y_T−1}. In this dependency graph 20, the coupling between the switching states and the LDS states is full, i.e., switching states are time-dependent, LDS states are time-dependent, and switching and LDS states are intradependent.

[0107] We can now write an equivalent representation of the fully coupled SLDS as the above DBN, assuming that the necessary conditional probability distribution functions (pdfs) are appropriately defined. Assuming a Gauss-Markov process on the LDS, it follows:

[0108] x_t+1|x_t,s_t+1=e_i˜N(A_ix_t, Q_i),

[0109] y_t|x_t˜N(Cx_t, R),

[0110] x₀|s₀=e_i˜N(x_0,i, Q₀,i)

[0111] Recalling the Markov switching model assumption, the joint pdf of the complex DBN of duration T, or, equivalently, its Hamiltonian, where the Hamiltonian H(x) of a distribution P(x) is defined as any positive function such that P(x)=[(exp(−H(x)))/(Σ_ψexp(−H(ψ) ))], can be written as:

\begin{matrix} \begin{matrix} H (X_{T}, S_{T}, Y_{T}) = \frac{1}{2} \sum_{t = 1}^{T - 1} \sum_{i = 0}^{N - 1} [{(x_{t} - A_{i} x_{t - 1})}^{'} Q_{i}^{- 1} (x_{t} - A_{i} x_{t - 1}) + \\ \log | Q_{i} |] s_{t} (i) + \frac{1}{2} \sum_{i = 0}^{N - 1} [{(x_{0, i})}^{'} Q_{0, i}^{- 1} (x_{0, i}) + \\ \log | Q_{0, i} |] s_{0} (i) + \frac{NT}{2} \log 2 π + \frac{1}{2} \sum_{i = 0}^{T - 1} {(y_{t} - {Cx}_{t})}^{'} \\ R^{- 1} (y_{t} - {Cx}_{t}) + \frac{T}{2} \log | R | + \frac{MT}{2} log2π + \\ \sum_{t = 1}^{T - 1} s_{t}^{'} (- \log \prod) s_{t - 1} + s_{0}^{'} (- \log π_{0}) . \end{matrix} & (Eq . 3) \end{matrix}

INFERENCE

[0112] The goal of inference in SLDSs is to estimate the posterior probability of the hidden states of the system (s_tand x_t) given some known sequence of observations Y_Tand the known model parameters, i.e., the likelihood of a sequence of models as well as the estimates of states. Namely, we need to find the posterior

[0113] P(X_T, S_T|Y_T)=Pr(X_T, S_T|Y_T),

[0114] or, equivalently, its “sufficient statistics”. Given the form of P it is easy to show that these are the first and second-order statistics: mean and covariance among hidden states x_t, x_t−1, s_t, s_t−1.

[0115] If there were no switching dynamics, the inference would be straightforward—we could infer X_Tfrom Y_Tusing an LDS inference approach such as smoothing, as described by Rauch, “Solutions to the linear smoothing problem,” IEEE Trans. Automatic Control, AC-8(4):371-372, October 1963. However, the presence of switching dynamics embedded in matrix P makes exact inference more complicated. To see that, assume that the initial distribution of x₀at t=0 is Gaussian. At t=1, the pdf of the physical system state x₁becomes a mixture of S Gaussian pdfs since we need to marginalize over S possible but unknown models. At time t, we will have a mixture of S^tGaussians, which is clearly intractable for even moderate sequence lengths. It is therefore necessary to explore approximate inference techniques that will result in a tractable learning method. What follows are three preferred embodiments of the inference step.

APPROXIMATE VITERBI INFERENCE EMBODIMENT

[0116] FIG. 3 is a block diagram of an embodiment of a dynamics learning method based on approximate Viterbi inference. At step 32, switching dynamics of a number of SLDS motion models are learned from a corpus of state space motion examples 30. Parameters 36 of each SLDS are re-estimated, at step 34, iteratively so as to minimize the modeling cost of current state sequence estimates, obtained using the approximate Viterbi inference procedure. Approximate Viterbi inference is developed as an alternative to computationally expensive exact state sequence estimation.

[0117] The task of the Viterbi approximation approach of the present invention is to find the most likely sequence of switching states s_tfor a given observation sequence Y_TIf the best sequence of switching states is denoted S*_T, then the desired posterior P(X_T, S_T|Y_T) can be approximated as

[0118] P(X_T, S_T|Y_T)=P(X_T|S_T, Y_T)P(S_T|Y_T)≈P(X_T|S_T, Y_T)δ(S_T−S*_T), (Eq 4)

[0119] where δ(x)=1 if x=0 and δ(x)=0 if x≠0. In other words, the switching sequence posterior P(S_T|Y_T) is approximated by its mode. Applying Viterbi inference to two simpler classes of models, discrete state hidden Markov models and continuous state Gauss-Markov models is well-known. An embodiment of the present invention utilizes an algorithm for approximate Viterbi inference that generalizes the two approaches.

[0120] We would like to determine the switching sequence S*_Tsuch that S*_T=arg max_STP(S_T|Y_T). First, define the following probability J_t,iup to time t of the switching state sequence being in state i at time t given the measurement sequence Y_t:

\begin{matrix} J_{t, i} = \max_{S_{t - 1}} P (S_{t - 1}, s_{t} = e_{i}, Y_{t}) & (Eq.   5) \end{matrix}

[0121] If this quantity is known at time T, the probability of the most likely switching sequence S*_Tis simply P(S*_T|Y_T)∝max_iJ_T−1,i. In fact, a recursive procedure can be used to obtain the desired quantity. To see that, express J_t,iin terms of J_sat t−1. It follows that

\begin{matrix} \begin{matrix} J_{t, i} = \max_{S_{t - 1}} P (S_{t - 1}, s_{t} = e_{i}, Y_{t}) \\ = \max_{S_{t - 1}} P (S_{t - 1}, s_{t} = e_{i}, Y_{t - 1}, y_{t}) \\ = \max_{S_{t - 1}} P (y_{t} | S_{t - 1}, s_{t} = e_{i}, Y_{t - 1}) P (s_{t} = e_{i} | S_{t - 1}, Y_{t - 1}) \\ P (S_{t - 1}, Y_{t - 1}) \\ \approx \max_{j} {P (y_{t} | s_{t} = e_{i}, s_{t - 1} = e_{j}, S_{t - 2}^{*} (j), Y_{t - 1}) P (s_{t} = e_{i} | \\ s_{t - 1} = e_{j}) \max_{S_{t - 2}} P (S_{t - 2}, s_{t - 1} = e_{j}, Y_{t - 1})} \\ = \max_{j} {J_{t | t - 1, i, j} J_{t - 1, j}} \end{matrix} & (Eq . 6) \end{matrix}

[0122] where we denote

[0123] J_t|t−1,i,j=P(y_t|s_t=e_i, s_t−1=e_j,S*_t−2(j), Y_t−1)P(s_t=e_i|s_t−1=e_j) (Eq. 7)

[0124] as the “transition probability” from stated at time t−1 to state i at time t. Since this analysis takes place relative to time t, we refer to s_tas the “switching state,” and to s_t−1, as the “previous switching state.” S*_t−2(i) is the “best” switching sequence up to time t−1 when SLDS is in state i at time t−1:

\begin{matrix} S_{t - 2}^{*} (i) = \arg \max_{S_{t - 2}} J_{t - 1, i} & (Eq . 8) . \end{matrix}

[0125] Hence, the switching sequence posterior at time t can be recursively computed from the same at time t−1. The two scaling components in J_t|t−1,i,jare the likelihood associated with the transition j→i from t−1 to t, and the probability of discrete SLDS switching from j to i.

[0126] To find the likelihood term, note that concurrently with the recursion of Equation 6, for each pair of consecutive switching states j,i at times t−1,t, one can obtain the following statistics using the Kalman filter:

{\hat{X}}_{t | t, i} \overset{Δ}{=} ⟨ x_{t} | Y_{t}, s_{t} = e_{i} ⟩

Σ_{t | t, i} \overset{Δ}{=} ⟨ (x_{t} - {\hat{x}}_{t | t, i}) {(x_{t} - {\hat{x}}_{t | t, i})}^{'} | Y_{t}, s_{t} = e_{i} ⟩

{\hat{x}}_{t | t - 1, i, j} \overset{Δ}{=} ⟨ x_{t} | Y_{t - 1}, s_{t} = e_{i}, s_{t - 1} = e_{j} ⟩

Σ_{t | t - 1, i, j} \overset{Δ}{=} ⟨ (x_{t} - {\hat{x}}_{t | t, i, j}) {(x_{t - 1} - {\hat{x}}_{t | t, i, j})}^{'} | Y_{t}, s_{t} = e_{i}, s_{t - 1} = e_{j} ⟩

{\hat{x}}_{t | t, i, j} \overset{Δ}{=} ⟨ x_{t} | Y_{t}, s_{t} = e_{i}, s_{t - 1} = e_{j} ⟩

Σ_{t | t, i, j} \overset{Δ}{=} ⟨ (x_{t} - {\hat{x}}_{t | t, i}) {(x_{t} - {\hat{x}}_{t | t, i})}^{'} | Y_{t}, s_{t} = e_{i}, s_{t - 1} = e_{j} ⟩

[0127] where {circumflex over (x)}_t|t,iis the “best” filtered LDS state estimate at t when the switch is in state i at time t and a sequence of t measurements, Y_t, has been processed; {circumflex over (x)}_t|t−1,i,jand {circumflex over (x)}_t|t,i,jare the one-step predicted LDS state and the “best” filtered state estimates at time t, respectively, given that the switch is in state i at time t and in state j at time t−1 and only t−1 measurements are known. The two sets {{circumflex over (x)}_t|t−1,i,j} and {{circumflex over (x)}_t|t,i,j}, where i and j take on all possible values, are examples of “sets of continuous state estimates.” The set {{circumflex over (x)}_t|t−1,i,j} is obtained through “Viterbi prediction.” Similar definitions are easily obtained for filtered and predicted state variance estimates, Σ_t|t,iand Σ_t|t−1,i,jrespectively. For a given switch state transition j→i it is now easy to establish relationship between the filtered and the predicted estimates. From the theory of Kalman estimation, it follows that for transition j→i the following time updates hold:

[0128] {circumflex over (x)}_t|t−1,i,j=A_i{circumflex over (x)}_{t−1|t−1,j} (Eq. 9)

[0129] Σ_t|t−1,i,j=A_iΣ_{t−1|t−1,j}A_i′+Q_i (Eq. 10)

[0130] Given a new observation y_tat time t, each of these predicted estimates can now be filtered using a Kalman “measurement update” framework. For instance, the state estimate measurement update equation yields

[0131] {circumflex over (x)}_t|t,i,j={circumflex over (x)}_t|t−1,i,j+K_i,j(y_t−C{circumflex over (x)}_t|t−1,i,j), (Eq. 11)

[0132] where K_i,jis the Kalman gain matrix associated with the transition j→i.

[0133] Appropriate equations can be obtained that link and Σ_t|t−1,i,jand Σ_t|t,i,j. The likelihood term can then be easily computed as the probability of innovation y_t−C{circumflex over (x)}_t|t−1,i,jof j→i transition,

[0134] y_t|s_t=e_i, s_t−1=e_j, S*_t−2(j)˜N(y_t; C{circumflex over (x)}_t|t−1,i,j, CΣx_t|t−1,i,jC′+R) (Eq. 12)

[0135] Obviously, for every current switching state i there are S possible previous switching states. To maximize the overall probability at every time step and for every switching state, one “best” previous state j is selected:

[0136] ψ_t−1,i=arg max_j{J_t|t−1,i,jJ_t−1,j} (Eq. 13)

[0137] Since the best state is selected based on the continuous state predictions from the previous time step, ψ_t−1,iis referred to as the “optimal prior switching state.” The index of this state is kept in the state transition record entry ψ_t−1,i. Consequently, we now obtain a set of S best filtered LDS states and variances at time t:

[0138] {circumflex over (x)}_t|t,i={circumflex over (x)}_t|t,i,ψand Σ_t|t,i=Σ_t|t,i,ψ.

[0139] Once all T observations Y_T−1have been fused to decode the “best” switching state sequence, one uses the index of the best final state,

i_{T - 1}^{*} = \arg \max_{j} J_{T - 1, i},

[0140] and then traces back through the state transition record ψ_t−1,i, setting i*_t=ψ_t,i*. The switching model's sufficient statistics are now simply (s_t)=e_i*and (s_ts′_t−1)=e_i*e′_i*. Given the “best” switching state sequence, the sufficient LDS statistics can be easily obtained using Rauch-Tung-Streiber (RTS) smoothing. Smoothing is described in Anderson et al, “Optimal Filtering,” Prentice-Hall, Inc., Englewood Cliffs, N.J., 1979. For example,

⟨ x_{t}, s_{t} (i) ⟩ = {\begin{matrix} {\hat{x}}_{t | T - 1, i_{j}^{*}} & i = i_{t}^{*} \\ 0 & otherwise \end{matrix}

[0141] for i=0, . . . , S−1.

[0142] FIGS. 4A and 4B comprise a flowchart that summarizes an embodiment of the present invention employing the Viterbi inference algorithm for SLDSs, as described above. The steps are as follows:

\begin{matrix} Initialize LDS state estimates {\hat{x}}_{0 | - 1, i} and Σ_{0 | - 1, i}; & (Step 102) \\ Initialize J_{0, i} . & (Step 102) \\ for i = 1 : T - 1 & (Steps 104, 122) \\ for i = 1 : S & (Steps 106, 120) \\ for j = 1 : S & (Steps 108, 114) \\ Predict and filter LDS state estimates {\hat{x}}_{t | t, i, j} and Σ_{t | t, i, j} & (Step 110) \\ Find j \to 1 “ transition probability ” J_{t | t - 1, i, j} end & (Step 112) \\ Find best transition J_{t, i}, into state i; & (Step 116) \\ Update sequence probabilities J_{t, i} and LDS state estimates {\hat{x}}_{t | t, i} and Σ_{t | t, i} end & (Step 118) \\ Find “ best ” final switching state i_{T - 1}^{*} & (Step 124) \\ Backtrack to find “ best ” switching state sequence i_{t}^{*} & (Step 126) \\ Find {DBN}^{'} s sufficient statistics . & (Step 128) \end{matrix}

APPROXIMATE VARIATIONAL INFERENCE EMBODIMENT

[0143] FIG. 5 is a block diagram for an embodiment of the dynamics learning method based on approximate variational inference. Generally, reference numbers 40-46 correspond to reference numbers 30-36 of FIG. 3, the approximate Viterbi inference block 34 of FIG. 3 being replaced by the approximate variational inference block 44.

[0144] At step 42, the switching dynamics of one or more SLDS motion models are learned from a corpus of state space motion examples 40. Parameters 46 of each SLDS are re-estimated, at step 44, iteratively so as to minimize the modeling cost of current state sequence estimates that are obtained using the approximate variational inference procedure. Approximate variational inference is developed as an alternative to computationally expensive exact state sequence estimation.

[0145] A general structured variational inference technique for Bayesian networks is described in Jordan at al., “An Introduction to Variational Methods For Graphical Models,” Learning In Graphical Models, Kluwer Academic Publishers, 1998. They consider a parameterized distribution Q which is in some sense close to the desired conditional distribution P, but which is easier to compute. Q can then be employed as an approximation of P,

[0146] P(X_T, S_T|Y_T)≈Q(X_T, S_T|Y_T)

[0147] Namely, for a given set of observations Y_T, a distribution Q(X_T, S_T|η, Y_Twith an additional set of “variational parameters” h is defined such that Kullback-Leibler divergence between Q(X_T, S_T|η, Y_Tand P(X_T, S_T|Y_T) is minimized with respect to h:

η^{*} = \arg \min_{η} \sum_{S_{t}} \int_{X_{T}} Q (X_{T}, S_{T} | η, Y_{T} \log \frac{P (X_{T}, S_{T} | Y_{T})}{Q (X_{T}, S_{T} | η, Y_{T}} .

[0148] The dependency structure of Q is chosen such that it closely resembles the dependency structure of the, original distribution P. However, unlike P, the dependency structure of Q must allow a computationally efficient inference. In our case, we define Q by decoupling the switching and LDS portions of SLDS as shown in FIG. 6.

[0149] FIG. 6 illustrates the factorization of the original SLDS. The two subgraphs of the original network are a Hidden Markov Model (HMM) Q_S50 with variational parameters {q₀, . . . , q_T−1}, and a time-varying LDS. Q_X52 with variational parameters {{circumflex over (x)}₀, Â₀, . . . , Â_T−1, {circumflex over (Q)}₀, . . . , {circumflex over (Q)}_T−1}. More precisely, the Hamiltonian of the approximating dependency graph is defined as:

\begin{matrix} \begin{matrix} H_{Q} (X_{T}, S_{T}, Y_{T}) = \frac{1}{2} \sum_{t = 1}^{T - 1} {(x_{t} - {\hat{A}}_{t} x_{t - 1})}^{'} {\hat{Q}}_{t}^{- 1} (x_{t} - {\hat{A}}_{t} x_{t - 1}) + \\ \frac{1}{2} \log | {\hat{Q}}_{t} | + \frac{1}{2} {(x_{0} - {\hat{x}}_{0})}^{'} {\hat{Q}}_{0}^{- 1} (x_{0} - {\hat{x}}_{0}) + \\ \frac{1}{2} \log | {\hat{Q}}_{0} | + \frac{NT}{2} \log 2 π + \frac{1}{2} \sum_{t = 0}^{T - 1} {(y_{t} - {Cx}_{t})}^{'} R^{- 1} \\ (y_{t} - {Cx}_{t}) + \frac{T}{2} \log | R | + \frac{MT}{2} \log 2 π + \\ \sum_{t = 1}^{T - 1} s_{t}^{'} (- \log Π) s_{t - 1} + s_{0}^{'} (- \log π_{0}) + \\ \sum_{t = 1}^{T - 1} s_{t}^{'} (- \log q_{t}) . \end{matrix} & (Eq . 14) \end{matrix}

[0150] The two subgraphs 50, 52 are “decoupled,” thus allowing for independent inference, Q(X_T, S_T|η, Y_T)=Q(X_T|η, Y_T)Q_S(S_T|η). This is also reflected in the sufficient statistics of the posterior defined by the approximating network, e.g., (x_tx′_ts_t)=(x_tx′_t) (s_t).

[0151] The optimal values of the variational parameters h are obtained by setting the derivative of the KL-divergence with respect to h to zero. We can then arrive at the following optimal variational parameters:

\begin{matrix} \begin{matrix} {\hat{Q}}_{T - 1}^{- 1} = \sum_{i = 0}^{S - 1} Q_{i}^{- 1} ⟨ s_{t} (i) ⟩ \\ {\hat{Q}}_{t}^{- 1} = \sum_{i = 0}^{S - 1} Q_{i}^{- 1} ⟨ s_{t} (i) ⟩ + \sum_{i = 0}^{S - 1} A_{i}^{'} Q_{i}^{- 1} ⟨ s_{t + 1} (i) ⟩ - {\hat{A}}_{t + 1}^{'} {\hat{Q}}_{t + 1}^{- 1} {\hat{A}}_{t + 1}, \\ 0 < t < T - 1 \\ {\hat{Q}}_{0}^{- 1} = \sum_{i = 0}^{S - 1} Q_{0, i}^{- 1} ⟨ s_{0} (i) ⟩ + \sum_{i = 0}^{S - 1} A_{i}^{'} Q_{i}^{- 1} A_{i} ⟨ s_{1} (i) ⟩ - {\hat{A}}_{1}^{'} {\hat{Q}}_{1}^{- 1} \hat{A_{1}} \\ {\hat{A}}_{t} = {\hat{Q}}_{t} \sum_{i = 0}^{S - 1} Q_{i}^{- 1} A_{i} ⟨ s_{t} (i) ⟩ \\ {\hat{x}}_{0} = {\hat{Q}}_{0} \sum_{i = 0}^{S - 1} Q_{0, i}^{- 1} x_{0, i} ⟨ s_{0} (i) ⟩ \end{matrix} & (Eq . 15) \end{matrix}

log q₀(i)=−½((x₀−x_0,i)′{circumflex over (Q)}_0,i⁻¹(x₀−x_0,i))−½log|{circumflex over (Q)}_0,i|

[0152] log q_t(i)=−½((x_t−A_ix_t−1)′{circumflex over (Q)}_t⁻¹(x_t−A_ix_t−1))−½log|{circumflex over (Q)}_t,i|, t>0 (Eq. 16)

[0153] To obtain the expectation terms (s_t)=Pr(s_t|q₀, . . . , q_T−1), we use the inference in the HMM with output “probabilities” q_t, as described in Rabiner and Juang, “Fundamentals of Speech Recognition,” Prentice Hall, 1993. Similarly, to obtain (x_t)=E[x_t|Y_T], LDS inference is performed in the decoupled time-varying LDS via RTS smoothing. Since Â_t, {circumflex over (Q)}_tin the decoupled LDS Q_Xdepend on (s_t) from the decoupled HMM Q_s, and q_t, depends on (x_t), (x_tx′_t), (x_tx′_t−1) from the decoupled LDS, Equations 15 and 16 together with the inference solutions in the decoupled models form a set of fixed-point equations. Solution of this fixed-point set yields a tractable approximation to the intractable inference of the original fully coupled SLDS.

[0154] FIG. 7 is a flowchart summarizing the variational inference algorithm for fully coupled SLDSs, corresponding to the steps below:

[0155] error=∝; (Step 152)

[0156] Initialize (s_t); (Step 152)

[0157] while (error>maxError) { (Step 154)

[0158] Find {circumflex over (Q)}_t, Â_t, {circumflex over (x)}₀, from (s_t) using Equations 11; (Step 156)

[0159] Estimate (x_t), (x_tx′_t) and (x_tx′_t−1) from Y_Tusing time-varying LDS inference; (Step 158)

[0160] Find q_tfrom (x_t), (x_tx′_t) and (x_tx′_t−1) using Equations 12; (Step 160)

[0161] Estimate (s_t) from q_tusing HMM inference. (Step 162)

[0162] Update approximation error (KL divergence); (Step 164)

[0163] }

[0164] Variational parameters in Equations 15 and 16 have an intuitive interpretation. Variational parameters of the decoupled LDS {circumflex over (Q)}_tand Â_tin Equations 15 define a best unimodal (non-switching) representation of the corresponding switching system and are, approximately, averages of the original parameters weighted by a best estimates of the switching states P(s). Variational parameters of the decoupled HMM log q_t(i) in Equation 16 measure the agreement of each individual LDS with the data.

GENERAL PSEUDO BAYESIAN INFERENCE EMBODIMENT

[0165] The Generalized Pseudo Bayesian (GPB) approximation scheme first introduced in Bar-Shalom et al., “Estimation and Tracking: Principles, Techniques, and Software,” Artech House, Inc. 1993 and in Kim, “Dynamic Linear Models With Markov-Switching,” Journal of Econometrics, volume 60, pages 1-22, 1994, is based on the idea of “collapsing”, i.e., representing a mixture of M^tGaussians with a mixture of M^TGaussians, where r<t. A detailed review of a family of similar schemes appears in Kevin P. Murphy, “Switching Kalman Filters,” Technical Report 98-10, Compaq Cambridge Research Lab, 1998. We develop a SLDS inference scheme jointly in the switching and linear dynamic system states, derived from filtering GPB2 approach of Bar-Shalom et al. The algorithm maintains a mixture of M²Gaussians over all times.

[0166] GPB2 is closely related to the Viterbi approximation described previously. It differs in that instead of picking the most likely previous switching state j at every time step t and switching state i, we collapse the M Gaussians (one for each possible value of j) into a single Gaussian.

[0167] Consider the filtered and predicted means {circumflex over (x)}_t|t,i,jand {circumflex over (x)}_t|t−1,i,j, and their associated covariances, which were defined previously with respect to the approximate Viterbi embodiment. Assume that for each switching state i and pairs of states (i,j) the following distributions are defined at each time step:

[0168] Pr(s_t=i|Y_t)

[0169] Pr(s_t=i, s_t−1=j|Y_t)

[0170] Regular Kalman filtering update can be used to fuse the new measurement y_tand obtain S²new SLDS states at t for each S states at time t−1, in a similar fashion to the Viterbi approximation embodiment discussed previously.

[0171] Unlike Viterbi approximation which picks one best switching transition for each state i at time t, GPB2 “averages” over S possible transitions from t−1. Namely, it is easy to see that

[0172] Pr(s_t=i, s_t−1=j|Y_t)≈Pr(y_t|{circumflex over (x)}_t,i,j)Π(i, j)Pr(s_t−1=j|Y_t−1).

[0173] From there it follows immediately that the current distribution over the switching states

\Pr (s_{t} = i | Y_{t}) = \sum_{j} \Pr (s_{t} = i, s_{t - 1} = j | Y_{t})

[0174] and that each previous state j now has the following posterior

\Pr (s_{t - 1} = j | s_{t} = i, Y_{t}) = \frac{\Pr (s_{t} = i, s_{t - 1} = j | Y_{t})}{\Pr (s_{t} = i | Y_{t})} .

[0175] This posterior is important because it allows one to “collapse” or “average” the S transitions into each state i into one average state, e.g.

{\hat{x}}_{t | t, i} = \sum_{j} {\hat{x}}_{t | t, i, j} \Pr (s_{t - 1} = j | s_{t} = i, Y_{t}) .

[0176] Analogous expressions can be obtained for the variances S_t|t,iand S_t,t−1|t,i.

[0177] Smoothing in GPB2 is a more involved process that includes several additional approximations. Details can be found in Kevin P. Murphy, “Switching Kalman Filters,” Technical Report 98-10, Compaq Cambridge Research Lab, 1998. First an assumption is made that decouples the switching model from the LDS when smoothing the switching states. Smoothed switching states are obtained directly from Pr(s_t|Y_t) estimates, namely Pr(s_t=i|s_t+1=k, Y_T)≈Pr(s_t=i|s_t+1=k, Y_t). Additionally, it is assumed that {circumflex over (x)}_t+1|T,i,k≈{circumflex over (x)}_t+1|T,k. These two assumptions lead to a set of smoothing equations for each transition (i,k) from t to t+1 that obey an RTS smoother, followed by collapsing similar to the filtering step.

[0178] FIGS. 8A and 8B comprise a flowchart illustrating the steps employed by a GPB2 embodiment, as summarized by the following steps:

[0179] Initialize LDS state estimates {circumflex over (x)}_0|−1,iand Σ_0|−1,i; (Step 202)

[0180] Initialize Pr(s₀=i)=p(i), for i=0, . . . , S−1; (Step 202)

[0181] for t=1:T−1 (Steps 204, 222)

[0182] for i=1:S (Steps 206, 220)

[0183] for j=1:S (Steps 208, 216)

[0184] Predict and filter LDS state estimates {circumflex over (x)}_t|t,i,j, Σ_t|t,i,j; (Step 210)

[0185] Find switching state distributions Pr(s_t=i|Y_t), Pr(s_t−1=j|s_t=i,Y_t); (Step 212)

[0186] Collapse {circumflex over (x)}_t|t,i,j, Σ_t|t,i,jto {circumflex over (x)}_t|t,i, Σ_t|t,i; (Step 214)

[0187] end

[0188] Collapse {circumflex over (x)}_t|t,iand Σ_t|t,ito {circumflex over (x)}_t|tand Σ_t|t,i. (Step 218)

[0189] end

[0190] end

[0191] Do GPB2 smoothing; (Step 224)

[0192] Find sufficient statistics. (Step 226)

[0193] The inference process of the GPB2 embodiment is clearly more involved than those of the Viterbi or the variational approximation embodiments. Unlike Viterbi, GPB2 provides soft estimates of switching states at each time t. Like Viterbi, GPB2 is a local approximation scheme and as such does not guarantee global optimality inherent in the variational approximation. However, Xavier Boyen and Daphne Koller, “Tractable inference for complex stochastic processes,” Uncertainty in Artificial Intelligence, pages 33-42, Madison, Wis., 1998, provides complex conditions for a similar type of approximation in general DBNs that lead to globally optimal solutions.

LEARNING OF SLDS PARAMETERS

[0194] Learning in SLDSs can be formulated as the problem of maximum likelihood learning in general Bayesian networks. Hence, a generalized Expectation-Maximization (EM) algorithm can be used to find optimal values of SLDS parameters {A₀, . . . , A_s−1, C, Q₀, . . . , Q_s−1, R, Π, π₀}. A description of generalized EM can be found in, for example, Neal et al., “A new view of the EM algorithm that justifies incremental and other variants” in the collection “Learning in graphical models” (M. Jordan, editor), pages 355-368. MIT Press, 1999.

[0195] The EM algorithm consists of two steps, E and M, which are interleaved in an iterative fashion until convergence. The essential step is the expectation (E) step. This step is also known as the inference problem. The inference problem was considered in the two preferred embodiments of the method.

[0196] Given the sufficient statistics from the inference phase, it is easy to obtain parameter update equations for the maximization (M) step of the EM algorithm. Updated values of the model parameters are easily shown to be

{\hat{A}}_{i} = (\sum_{t = 1}^{T - 1} ⟨ x_{t} x_{t - 1}^{'} s_{t} (i) ⟩) {(\sum_{t = 1}^{T - 1} ⟨ x_{t - 1} x_{t - 1}^{'} s_{t} (i) ⟩)}^{- 1}

{\hat{Q}}_{i} = (\sum_{t = 1}^{T - 1} ⟨ x_{t} x_{t}^{'} s_{t} (i) ⟩ - {\hat{A}}_{i} ⟨ x_{t - 1} x_{t}^{'} s_{t} (i) ⟩) {(\sum_{t = 1}^{T - 1} ⟨ s_{t} (i) ⟩)}^{- 1}

\hat{C} = (\sum_{t = 0}^{T - 1} y_{t} ⟨ x_{t}^{'} ⟩) {(\sum_{t = 0}^{T - 1} ⟨ x_{t} x^{'} ⟩)}^{- 1}

\hat{R} = \frac{1}{T} \sum_{t = 0}^{T - 1} (y_{t} y_{t}^{'} - \hat{C} ⟨ x_{t} ⟩ y_{t}^{'})

\hat{Π} = (\sum_{t = 0}^{T - 1} ⟨ s_{t} s_{t - 1}^{'} ⟩) {diag (\sum_{t = 1}^{T - 1} ⟨ s_{t} ⟩)}^{- 1}

{\hat{π}}_{0} = ⟨ s_{0} ⟩ .

[0197] The operator (·) denotes conditional expectation with respect to the posterior distribution, e.g. (x_t)=Σ_S∫_Xx_tP(X,S|Y).

[0198] All the variable statistics are evaluated before updating any parameters. Notice that the above equations represent a generalization of the parameter update equations of classical (non-switching) LDS models.

[0199] The coupled E and M steps are the key components of the SLDS learning method. While the M step is the same for all preferred embodiments of the method, the E-step will vary with the approximate inference method.

APPLICATIONS OF SLDS

[0200] We applied our SLDS framework to the analysis of two categories of fronto-parallel motion: walking and jogging. Fronto-parallel motions exhibit interesting dynamics and are free from the difficulties of 3-D reconstruction. Experiments can be conducted easily using a single video source, while self-occlusions and cluttered backgrounds make the tracking problem non-trivial.

[0201] The kinematics of the figure are represented by a 2-D Scaled Prismatic Model (SPM). This model is described in Morris et al., “Singularity analysis for articulated object tracking,” Proceedings of Computer Vision and Pattern Recognition, pages 289-296, Santa Barbara, Calif., Jun. 23-25, 1998. The SPM lies in the image plane, with each link having one degree of freedom (DOF) in rotation and another DOF in length. A chain of SPM transforms can model the image displacement and foreshortening effects produced by 3-D rigid links. The appearance of each link in the image is described by a template of pixels which is manually initialized and deformed by the link's DOFs.

[0202] In our figure tracking experiments, we analyzed the motion of the legs, torso, and head, while ignoring the arms. Our kinematic model had eight DOFs, corresponding to rotations at the knees, hip and neck.

[0203] Learning

[0204] The first task we addressed was learning an SLDS model for walking and running. The training set consisted of eighteen sequences of six individuals jogging and walking at a moderate pace. Each sequence was approximately fifty frames in duration. The training data consisted of the joint angle states of the SPM in each image frame, which were obtained manually.

[0205] The two motion types were each modeled as multi-state SLDSs and then combined into a single complex SLDS. The measurement matrix in all cases was assumed to be identity, C=I. Initial state segmentation within each motion type was obtained using unsupervised clustering in a state space of some simple dynamics model, e.g., a constant velocity model. Parameters of the model (A, Q, R, x₀, P, π₀) were then reestimated using the EM-learning framework with approximate Viterbi inference. This yielded refined segmentation of switching states within each of the models.

[0206] FIG. 9 illustrates learned segmentation of a “jog” motion sequence. A two-state SLDS model was learned from a set of exemplary “jog” motion measurement sequences, an example of which is shown in the bottom graph. The top graph 62 depicts decoded switching states ((s_t)) inferred from the measurement sequence y_t, shown in the bottom graph 64, using the learned “jog” SLDS model.

[0207] Classification

[0208] The task of classification is to segment a state space trajectory into a sequence of motion regimes, according to learned models. For instance, in gesture recognition, one can automatically label portions of a long hand trajectory as some predefined, meaningful gestures. The SLDS framework is particularly suitable for motion trajectory classification.

[0209] FIG. 10 illustrates the classification of state space trajectories. Learned SLDS model parameters are used in approximate Viterbi inference 74 to decode a best sequence 78 of models 76 corresponding to the state space trajectory 70 to be classified.

[0210] The classification framework follows directly from the framework for approximate Viterbi inference in SLDSs, described previously. Namely, the approximate Viterbi inference 74 yields a sequence of switching states S_T(regime indexes) 70 that best describes the observed state space trajectory 70, assuming some current SLDS model parameters. If those model parameters are learned on a corpus of representative motion data, applying the approximate Viterbi inference on a state trajectory from the same family of motions will then result in its segmentation into the learned motion regimes.

[0211] Additional “constraints” 72 can be imposed on classification. Such constraints 72 can model expert knowledge about the domain of trajectories which are to be classified, such as domain grammars, which may not have been present during SLDS model learning. For instance, we may know that out of N available SLDS motion models, only M<N are present in the unclassified data. We may also know that those M models can only occur in some particular, e.g., deterministically or stochastically, known order. These classification constraints can then be superimposed on the SLDS motion model parameters in the approximate Viterbi inference to force the classification to adhere to them. Hence, a number of natural language modeling techniques from human speech recognition, for example, as discussed in Jelinek, “Statistical methods for speech recognition,” MIT Press, 1998, can be mapped directly into the classification SLDS domain.

[0212] Classification can also be performed using variational and GPB2 inference techniques. Unlike with Viterbi inference, these embodiments yield a “soft” classification, i.e., each switching state at every time instance can be active with some potentially non-zero probability. A soft switching state at time t is

\sum_{i = 0}^{S - 1} i ⟨ s_{t} (i) ⟩ .

[0213] To explore the classification ability of our learned model, we next considered segmentation of sequences of complex motion, i.e., motion consisting of alternations of “jog” and “walk.” Test sequences were constructed by concatenating in random order randomly selected and noise-corrupted training sequences. Transitions between sequences were smoothed using B-spline smoothing. Identification of two motion “regimes” was conducted using the proposed framework in addition to a simple HMM-based segmentation. Multiple choices of linear dynamic system and “jog”/“walk” switching orders were also compared.

[0214] Because “jog” and “walk” SLDS models were learned individually, whereas the test data contained mixed “jog” and “walk” regimes, it was necessary to impose classification constraints to combine the two models into a single “jog+walk” model. Since no preference was known a priori for either of the two regimes, the two were assumed equally likely but complementary, and their individual two-state switching models P_{jog and P}_walkwere concatenated into a single four-state switching model P_jog+walk. Each state of this new model simply carried over the LDS parameters of the individual “jog” and “walk” models.

[0215] Estimates of “best” switching states (s_t) indicated which of the two models can be considered to be driving the corresponding motion segment.

[0216] FIG. 11 illustrates an example of segmentation, depicting true switching state sequence (sequence of jog-walk motions) in the top graph, followed by HMM, Viterbi, GPB2, and variational state estimates using one switching state per motion type models first order SLDS model.

[0217] FIG. 11 contains several graphs which illustrate the impact of different learned models and inference methods on classification of “jog” and “walk” motion sequences, where learned “jog” and “walk” motion models have two switching states each. Continuous system states of the SLDS model contain information about angle of the human figure joints. The top graph 80 depicts correct classification of a motion sequence containing “jog” and “walk” motions (measurement sequence is not shown). The remaining graphs 82-88 show inferred classifications using, respectively from top to bottom, SLDS model with Viterbi inference, SLDS model with GPB2 inference, SLDS model with variational inference, and HMM model.

[0218] Similar results were obtained with four switching states each and second order SLDS.

[0219] Classification experiments on a set of 20 test sequences gave an error rate of 2.9% over a total of 8312 classified data points, where classification error was defined as the difference between inferred segmentation (the estimated switching states) and true segmentation (true switching states) accumulated over all sequences,

[0220] error=Σ_t=0^T−1|(s_t)−s_true,t|.

[0221] Tracking

[0222] The SLDS learning framework can improve the tracking of target objects with complex dynamical behavior, responsive to a sequence of measurements. A particular embodiment of the present invention tracks the motion of the human figure, using frames from a video sequence. Tracking systems generally have three identifiable steps: state prediction, measurement processing and posterior update. These steps are exemplified by the well-known Kalman Filter, described in Anderson and Moore, “Optimal Filtering,” Prentice Hall, 1979.

[0223] FIG. 12 is a standard block diagram for a Kalman Filter. A state prediction module 500 takes as input the state estimate from the previous time instant, {circumflex over (x)}_t−1|t−1. The output of the prediction module 500 is the predicted state {circumflex over (x)}_t|t−1. The measurement processing module 501 takes the predicted state, generates a corresponding predicted measurement, and combines it with the actual measurement y_tto form the “innovation” z_t. For an image, for example, states might be parameters such as angles, lengths and positions of objects or features, while the measurements might be the actual pixels. The predicted measurements might then be the predictions of pixel values and/or pixel locations. The innovation Z_tmeasures the difference between the predicted and actual measurement data.

[0224] The innovation z_tis passed to the posterior update module 502 along with the prediction. They are fused using the Kalman gain matrix to form the posterior estimate {circumflex over (x)}_t|t.

[0225] The delay element 503 indicates the temporal nature of the tracking process. It models the fact that the posterior estimate for the current frame becomes the input for the filter in the next frame.

[0226] FIG. 13 illustrates the operation of the prediction module 500 for the specific case of figure tracking. The dashed line 510 shows the position of a skeletal representation of the human figure at time t−1. The predicted position of the figure at time t is shown as a solid line 511. The actual position of the figure in the video frame at time t is shown as a dotted line 512. The unknown state x_trepresents the actual skeletal position for the sketched figure.

[0227] We now describe the process of computing the innovation z_twhich is the task of the measurement processing module 501, in the specific case of figure tracking using template features. A template is a region of pixels, often rectangular in shape. Tracking using template features is described in detail in James M. Rehg and Andrew P. Witkin, “Visual Tracking with Deformation Models,” Proceedings of IEEE Conference on Robotics and Automation, April 1991, Sacramento Calif., pages 844-850. In the figure tracking application, a pixel template is associated with each part of the figure model, describing its image appearance. The pixel template is an example of an “image feature model” which describes the measurements provided by the image.

[0228] For example, two templates can be used to describe the right arm, one for the lower and one for the upper arm. These templates, along with those for the left arm and the torso, describe the appearance of the subject's shirt. These templates can be initialized, for example, by capturing pixels from the first frame of the video sequence in which each part is visible. The use of pixel templates in figure tracking is described in detail in Daniel D. Morris and James M. Rehg, “Singularity Analysis for Articulated Object Tracking,” Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, June 1998, Santa Barbara Calif., pages 289-296.

[0229] Given a set of initialized figure templates, the innovation is the difference between the template pixel values and the pixel values in the input video frame which correspond to the predicted template position. We can define the innovation function that gives the pixel difference as a function of the state vector x and pixel index k:

[0230] z(x, k)=I_t(pos(x, k))−T(k) (Eq. 17)

[0231] We can then write the innovation at time t as

[0232] z_t(k)=z({circumflex over (x)}_t|t−1, k) (Eq. 18)

[0233] Equations 18 defines a vector of pixel differences, z_t, formed by subtracting pixels in the template model T from a region of pixels in the input video frame I_tunder the action of the figure state. In order to represent images as vectors, we require that each template pixel in the figure model be assigned a unique index k. This can be easily accomplished by examining the templates in a fixed order and scanning the pixels in each template in raster order. Thus z_t(k) represents the innovation for the kth template pixel, whose intensity value is given by T(k). Note that the contents of the template T(k) could be, for example, gray scale pixel values, color pixel values in RGB or YUV, Laplacian filtered pixels, or in general any function applied to a region of pixels. We use z(x) to denote the vector of pixel differences described by Equation (e1). Note that z_tdoes not define an innovation process in the strict sense of the Kalman filter, since the underlying system is nonlinear and non-Gaussian.

[0234] The deformation function pos(x,k) in Equation 17 gives the position of the kth template pixel, with respect to the input video frame, as a function of the model state x. Given a state prediction {circumflex over (x)}_t|t−1, the transform pos({circumflex over (x)}_t|t−1*) maps the template pixels into the current image, thereby selecting a subset of pixel measurements. In the case of figure tracking, the pos( ) function models the kinematics of the figure, which determine the relative motion of its parts.

[0235] FIG. 14 illustrates two templates 513 and 514 which model the right arm 525. Pixels that make up these templates 513, 514 are ordered, with pixels T₁through T₁₀₀belonging to the upper arm template 513, and pixels T₁₀₁through T₂₀₀belonging to the lower arm template 514. The mapping pos(x,k) is also illustrated. The location of each template 513, 514 under the transformation is shown as 513A, 514A respectively. The specific transformations of two representative pixel locations, T₄₈and T₁₈₁, are also illustrated.

[0236] Alternatively, the boundary of the figure in the image can be expressed as a collection of image contours whose shapes can be modeled for each part of the figure model. These contours can be measured in an input video frame and the innovation expressed as the distance in the image plane between the positions of predicted and measured contour locations. The use of contour features for tracking is described in detail in Demetri Terzopoulos and Richard Szeliski, “Tracking with Kalman Snakes,” which appears in “Active Vision,” edited by Andrew Blake and Alan Yuille, MIT Press, 1992, pages 3-20. In general, the tracking approach outlined above applies to any set of features which can be computed from a sequence of measurements.

[0237] In general, each frame in an image sequence generates a set of “image feature measurements,” such as pixel values, intensity gradients, or edges. Tracking proceeds by fitting an “image feature model,” such as a set of templates or contours, to the set of measurements in each frame.

[0238] A primary difficulty in visual tracking is the fact that the image feature measurements are related to the figure state only in a highly nonlinear way. A change in the state of the figure, such as raising an arm, induces a complex change in the pixel values produced in an image. The nonlinear function I(pos(x,*)) models this effect. The standard approach to addressing this nonlinearity is to use the Iterated Extended Kalman Filter (IEKF), which is described in Anderson and Moore, section 8.2. In this approach, the nonlinear measurement model in Equation 17 is linearized around the state prediction {circumflex over (x)}_t|t−1.

[0239] The linearizing function can be defined as

\begin{matrix} M_{t} (x, k) = \nabla {I_{t} (pos (x, k))}^{'} \frac{\partial pos}{\partial x} (x, k) & (Eq . 19) \end{matrix}

[0240] The first term on the right in Equation 19, ∇I_t(pos(x_tk))′, is the image gradient ∇I_t, evaluated at the image position of template pixel k. The second term,

\frac{\partial pos}{\partial x} (x, k),

[0241] is a 2×N kinematic Jacobian matrix, where N is the number of states, or elements, in x. Each column of this Jacobian gives the displacement in the image at pixel position k due to a small change in one of the model states. M_t(x,k) is a 1×N row vector. We denote by M_t(x) the M×N matrix formed by stacking up these rows for each of the M pixels in the template model. The linearized measurement model can then be written:

[0242] {overscore (C)}_t=M_t({circumflex over (x)}_t|t−1) (Eq. 20)

[0243] The standard Kalman filter equations can then be applied using the linearized measurement model from Equation 20 and the innovation from Equation 18. In particular, the posterior update equation (analogous to Equation 11 in the linear case) is:

[0244] {circumflex over (x)}_t|t={circumflex over (x)}_t|t−1+L_tz_t (Eq. 21)

[0245] where L_tis the appropriate Kalman gain matrix formed using {overscore (C)}_t.

[0246] FIG. 15 illustrates a block diagram of the IEKF. In comparison to FIG. 12, the measurement processing 501 and posterior update 502 blocks within the dashed box 506 are now iterated P times with the same measurement y_t, for some predetermined number P, before the final output 507 is reported and a new measurement y_tis introduced. This iteration produces a series of innovations z_tⁿand posterior estimates {circumflex over (x)}_t|tⁿwhich result from successive linearizations of the measurement model around the previous posterior estimate {circumflex over (x)}_t|tⁿ⁻¹. The iterations are initialized by setting {circumflex over (x)}_t|t^l={circumflex over (x)}_t|t−1. Upon exiting, we set {circumflex over (x)}_{t|t={circumflex over (x)}}_t|t^P.

[0247] In cases where the prediction is far from the correct state estimate, these iterations can improve accuracy. We denote as the “IEKF update module” 506 the subsystem of measurement processing 501 and posterior update 502 blocks, as well as delay 504, although in practice, delays 503 and 504 may be the same piece of hardware and/or software.

[0248] Clearly the quality of the IEKF solution depends upon the quality of the state prediction. The linearized approximation is only valid within a small range of state values around the current operating point, which is initialized by the prediction. More generally, there are likely to be many background regions in a given video frame that are similar in appearance to the figure. For example, a template that describes the appearance of a figure wearing a dark suit might match quite well to a shadow cast against a wall in the background. The innovation function defined in Equation 17 can be viewed as an objective function to be minimized with respect to x. It is clear that this function will in general have many local minima. The presence of local minima poses problems for any iterative estimation technique such as IEKF. An accurate prediction can reduce the likelihood of becoming trapped in a local minima by bringing the starting point for the iterations closer to the correct answer.

[0249] As alluded to previously, the dynamics of a complex moving object such as the human figure cannot be expressed using a simple linear dynamic model. Therefore, it is unlikely that the standard JEKF framework described above would be effective for figure tracking in video. A simple linear prediction of the figure's state would not provide sufficient accuracy in predicting figure motion.

[0250] The SLDS framework of the present invention, in contrast, can describe complex dynamics as a switched sequence of linear models. This framework can form an accurate predictor for video tracking. A straightforward implementation of this approach can be extrapolated directly from the approximate Viterbi inference.

[0251] In the first tracking embodiment, the Viterbi approach generates a set of S²hypotheses, corresponding to all possible transitions i, j between linear models from time step t−1 to t. Each of these hypotheses represents a prediction for the continuous state of the figure which selects a corresponding set of pixel measurements. It follows that each hypothesis has a distinct innovation equation:

[0252] z_t|t−1,i,j=z({circumflex over (x)}_t|t−1,i,j) (Eq. 22)

[0253] defined by Equation 17. Note that the only difference in comparison to Equations 18 is the use of the SLDS prediction in mapping templates into the image plane.

[0254] This embodiment, using SLDS models, is an application of the Viterbi inference algorithm described earlier to the particular measurement models used in visual tracking.

[0255] FIG. 16 is a block diagram which illustrates this approach. The Viterbi prediction block 510 generates the set of S²predictions {circumflex over (x)}_t|t−1,i,jaccording to Equation 9.

[0256] A selector 511 takes these inputs and selects, for each of the S possible switching states at time t, the most likely previous state ψ_t−1,i, as defined in Equation 13. This step is identical to the Viterbi inference procedure described earlier, except that the likelihood of the measurement sequence is computed using image features such as templates or contours. More specifically, Equation 7 expresses the transition likelihood J_t|t−1,i,jas the product of the measurement probability and the transition probability from the Markov chain.

[0257] In the case of template features, the measurement probability can be written

[0258] P(y_t|t−1,i,j)=P(y_t|s_t=e_i, s_t−1=e_j, S*_t−2(j)≈N(z_t|t−1,i,j; 0, {overscore (C)}_t|t−1,i,jΣ_t|t−1,i,j{overscore (C)}′_t|t−1,i,j+R) (Eq. 23)

[0259] where {overscore (C)}_t|t−1,i,j=M_t({circumflex over (x)}_t|t−1,i,j). The difference between Equations 23 and 12 is the use of the linearized measurement model for template features. By changing the measurement probability appropriately, the SLDS framework above can be adopted to any tracking problem.

[0260] The output of the selector 511 is a set of S hypotheses corresponding to the most probable state predictions given the measurement data. These are input to the IEKF update block 506, which filters these predictions against the measurements to obtain a set of S posterior state estimates. This block was illustrated in FIG. 15. This step applies the standard equations for the IEKF to features such as templates or contours, as described in Equations 17 through 21. The posterior estimates can be decoded and smoothed analogously to the case of Viterbi inference.

[0261] In computing the measurement probabilities, the selector 511 must make S²comparisons between all of the model pixels and the input image. Depending upon the size of the target and the image, this may represent a large computation. This computation can be reduced by considering only the Markov process probabilities and not the measurement probabilities in computing the best S switching hypotheses. In this case, the best hypotheses are given by

[0262] i*_t=arg min_j{−log Π(i, j)+J_t−1,j} (Eq. 24)

[0263] This is a substantial reduction in computation, at the cost of a potential loss of accuracy in picking the best hypotheses.

[0264] FIG. 17 illustrates a second tracking embodiment, in which the order of the IEKF update module 506 and selector 511A is reversed. In this case, the set of S²predictions are passed directly to the IEKF update module 506. The output of the update module 506 is a set of S²filtered estimates {circumflex over (x)}_t|t,i,j, each of which is the result of P iterations of the IEKF. As with the embodiment of FIG. 16, it is still necessary to reduce the total set of estimates to S hypotheses in order to control the complexity of the tracker.

[0265] The selector 511 A chooses the most likely transition j→i for each switching state based on the filtered estimates. This is analogous to the Viterbi inference case, which was described in the embodiment of FIG. 16 above. The key step is to compute the switching costs J_t,idefined in Equations 5 and 6. The difference in this case comes from the fact that the probability of the measurement is computed using the filtered posterior estimate rather than the prediction. This probability is given by:

[0266] P(y_t|t,i,j)=P(y_t|s_t=e_i, s_t−1=e_j, {circumflex over (x)}_t|t,i,j, S*_t−2(j))≈N(z({circumflex over (x)}_t|t,i,j); 0, M_t({circumflex over (x)}_t|t,i,j)Σ_t|t,i,jM_t({circumflex over (x)}_t|t,i,j)′+R)

[0267] The switching costs are then given by

[0268] J_t,i=max_j{J_t|t,i,jJ_t−1} (Eq. 25A)

[0269] where the “posterior transition probability” from state j at time t−1 to state i at time t is written

[0270] J_t|t,i,j=P(y_t|t,i,j)P(s_t=e_i|s_t−1=e_j) (Eq. 25B)

[0271] The selector 511A selects the transition j*→i, where j*=arg max_j{J_t|t,i,j, J_t−1|j}. The state j* is the “optimal posterior switching state,” and its value depends upon the posterior estimate for the continuous state at time t.

[0272] The potential advantage of this approach is that all of the S²predictions are given an opportunity to filter the measurement data. Since the system is nonlinear, it is possible that a hypothesis which has a low probability following prediction could in fact produce a posterior estimate which has a high probability.

[0273] The set of S²predictions used in the embodiments of FIGS. 16 and 17 can be viewed as specifying a set of starting points for local optimization of an objective function defined by ∥z_t(x)∥². In fact, as the covariance for the plant noise approaches infinity, the behavior of the IEKF module 506 approaches steepest-descent gradient search because the dynamic model no longer influences the posterior estimate.

[0274] When the objective function has many local minima relative to the uncertainty in the state dynamics, it may be advantageous to use additional starting points for search beyond the S²values provided by the SLDS predictor. This can be accomplished, for example, by drawing additional starting points at random from a “continuous state sampling density.” Additional starting points can increase the chance that one of the IEKF tracks will find the global minimum. We therefore first describe a procedure for generating additional starting points and then describe how they can be incorporated into the previous two embodiments.

[0275] A wide range of sampling procedures is available for generating additional starting points for search. In order to apply the IEKF update module 506 at a given starting point, a state prediction must be specified and a particular dynamic model selected. The easiest way to do this is to assume that new starting points are going to be obtained by sampling from the mixture density defined by the set of S²predictions. This density can be derived as follows:

\begin{matrix} P (x_{t} ❘ Y_{t - 1}) = \sum_{i, j} P (x_{t} ❘ s_{t} = e_{i}, s_{t - 1} = e_{j}, S_{t - 2}, Y_{t - 1}) \\ P (s_{t} = e_{i}, s_{t - 1} = e_{j}, S_{t - 2}, Y_{t - 1}) \\ \approx \sum_{i, j} P (x_{t} ❘ s_{t} = e_{i}, s_{t - 1} = e_{j}, S_{t - 2} = S_{t - 2}^{*} (j), Y_{t - 1}) \\ P (s_{t} = e_{i}, s_{t - 1} = e_{j}, S_{t - 2} = S_{t - 2}^{*} (j) ❘ Y_{t - 1}) \end{matrix}

[0276] The first term in the summed product is a Gaussian prior density from the Viterbi inference step. The second term is its likelihood, a scalar probability which we denote α_i,j. Rewriting in the form of a mixture of S²Gaussian kernels, i.e., the predictions, yields:

\begin{matrix} P (x_{t} ❘ Y_{t - 1}) \approx \sum_{i, j} α_{i, j} K_{i, j} (x_{t}) = \sum_{i, j} α_{i, j} N [x_{i}; {\hat{x}}_{t ❘ t - 1, i, j}, \sum_{t ❘ t - 1, i, j}] & (Eq . 26) \end{matrix}

[0277] where α_i,jcan be further expanded as

\begin{matrix} α_{i, j} = p (s_{t} = e_{i} ❘ s_{t - 1} = e_{j}, S_{t - 2}^{*} (j), Y_{t - 1}) \\ P (s_{t - 1} = e_{j}, S_{t - 2}^{*} (j) ❘ Y_{t - 1}) \\ = P (s_{t} = e_{i} ❘ s_{t - 1} = e_{j}) \frac{P (s_{t - 1} = e_{j}, S_{t - 2}^{*} (j), Y_{t - 1})}{P (Y_{t - 1})} \end{matrix}

[0278] Applying Equation 1 to the first term and Equations 5 and 8 to the second term yields

\begin{matrix} α_{i, j} = \frac{Π (i, j) J_{t - 1, j}}{P (Y_{t - 1})} & (Eq . 27) \end{matrix}

[0279] All of the terms in the numerator of Equation 27 are directly available from the Viterbi inference method. The denominator is a constant normalizing factor which can be rewritten to yield

\begin{matrix} α_{i, j} = \frac{Π (i, j) J_{t - 1, j}}{\sum_{i, j} Π (i, j) J_{t - 1, j}} & (Eq . 28) \end{matrix}

[0280] Equations 26 and 28 define a “Viterbi mixture density” from which additional starting points for search can be drawn. The steps for drawing R additional points are as follows:

[0281] Find mixture parameters, α_i,j, x_t|t−1,i,j, and Σ_t|t−1,i,jfrom Viterbi prediction For r=1 to R

[0282] Select a kernel K_i_,jat random according to the discrete distribution {α_i,j}

[0283] Select a state sample {overscore (x)}_i_,jat random according to the predicted Gaussian distribution K_i_,j

[0284] End

[0285] The rth sample is associated with a specific prediction (i_r, j_r), making it easy to apply the IEKF.

[0286] Given a set of starting points, we can apply the IEKF approach by modifying the IEKF equations to support linearization around arbitrary points. Consider a starting point {overscore (x)}. The nonlinear measurement model for template tracking can be written

[0287] z_t(x_t)=w_t

[0288] Expanding around {overscore (x)}, discarding high-order terms and rearranging gives

[0289] {overscore (y)}_t=z_t({overscore (x)})−{overscore (C)}_t{overscore (x)}=−{overscore (C)}_tx_t+w_t

[0290] where the auxiliary measurement {overscore (y)}_thas been defined to give a measurement model in standard form. It follows that the posterior update equation is

[0291] {circumflex over (x)}_t|t={circumflex over (x)}_t|t−1+L_t(z_t({overscore (x)})+{overscore (C)}_t({circumflex over (x)}_t|t−1−{overscore (x)})) (Eq. 29)

[0292] Note that if {overscore (x)}=x_t|t−1, which is the standard operating point for IEKF, then the above reduces to Equation 21. The additional term captures the effect of the new operating point. Equation 29 defines a modification of the IEKF update block to handle arbitrary starting points in computing the posterior update.

[0293] Note that the smoothness of the underlying nonlinear measurement model will determine the region in state space over which the linearized model {overscore (C)}_tis an accurate approximation. This region must be large enough relative to the distance ∥{circumflex over (x)}_t|t−1−{overscore (x)}∥. This requirement may not be met by a complex objective function.

[0294] An alternative in that case is to apply a standard gradient descent approach instead of IEKF, effectively discounting the role of the prior state prediction. A multiple hypothesis tracking (MHT) approach which implements this procedure is described in Tat-Jen Cham and James M. Rehg, “A Multiple Hypothesis Approach to Figure Tracking,” Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, June 1999, Ft. Collins, Colo., pages 239-245, incorporated herein by reference in its entirety. Although this article does not describe tracking with an SLDS model or sampling from an SLDS prediction, the MHT procedure provides a means for propagating a set of sampled states given a complex measurement function. This means can be used as an alternative to the IEKF update step.

[0295] FIG. 18 is a block diagram of a tracking embodiment which combines SLDS prediction with sampling from the prior mixture density to perform tracking. The output of the Viterbi predictor 510 follows two paths. The top path is similar to the embodiment of FIG. 16. The predictions are processed by a selector 515 and then input to an IEKF update block 506.

[0296] Along the bottom path in FIG. 18, the predictions are input to a sample generator 517, which produces a new set of R sample points for filtering, {{overscore (x)}_i_,j}_r=1^R. This set is unioned with the SLDS predictions from the selector 515 and input to the IEKF block 506. The output of the IEKF block 506 is a joint set of filtered estimates, corresponding to the SLDS predictions, which we now write as {overscore (x)}_t|t,i, and the sampled states {overscore (x)}_t|t,i_,j.

[0297] This combined output forms the input to a final selector 519 which selects one filtered estimate for each of the switching states to make up the final output set. This selection process is identical to the ones described earlier with respect to FIG. 17, except that there now can be more than one possible estimate for a given state transition (i,j), corresponding to different starting points for search.

[0298] FIG. 19 illustrates yet another tracking embodiment. The output of Viterbi prediction, which comprises “Viterbi estimates,” is input directly to an IEKF update block 506 while the output of the sample generator 517 goes to an MHT block 520, which implements the method of Cham and Rehg referred to above. As with the embodiment of FIG. 18, these two sets of filtered estimates are passed to a final selector 522. This final selector 522 chooses S of the posterior estimates, one for each possible switching state, as the final output. As with the embodiment of FIG. 18, this selector uses the posterior switching costs defined in Equation 25B.

[0299] It should be clear from the embodiments of FIGS. 18 and 19 that other variations on the same basic approach are also possible. For example, an additional selector can be added following the predictor of FIG. 19, or the MHT block can be replaced by a second IEKF block.

[0300] It has been assumed that the selector would be selecting a single most likely state distribution from a set of distributions associated with a particular switching state. Another possibility is to find a single distribution which most closely matches all of the possibilities. This is the Generalized Psuedo Bayesian approximation GPB2, described earlier. In any of the selector blocks for the embodiments discussed above, GPB2 could be used in place of Viterbi approximation as a method for reducing multiple hypotheses for a particular switching state down to a single hypothesis. In cases where no single distribution contains a majority of the probability mass for the set of hypotheses, this approach may be advantageous. The application of the previously described process for GPB2 inference to these embodiments is straightforward.

[0301] Synthesis and Interpolation

[0302] SLDS was introduced as a “generative” model; trajectories in the state space can be easily generated by simulating an SLDS. Nevertheless, SLDSs are still more commonly employed as a classifier or a filter/predictor than as a generative model. We now formulate a framework for using SLDSs as synthesizers and interpolators.

[0303] Consider again the generative model described previously. Provided SLDS parameters have been learned from a corpus of motion trajectories, driving the generative SLDS model with the appropriate state and measurement noise processes and switching model, will yield a state space trajectory consistent with that corpus. In other words, one will draw a sample (trajectory) defined by the probability distribution of the SLDS.

[0304] FIG. 20 illustrates a framework for synthesis of state space trajectories in which the SLDS is used as a generative model within a synthesis module 410. Given the parameters of the SLDS model 411, obtained using either SLDS learning or some other techniques, a switching state sequence s_tis first synthesized in the switching state synthesis module 412 by sampling from a Markoy chain with state transition probability matrix Π and initial state distribution π₀. The continuous state sequence x_tis then synthesized in the continuous state synthesis module 413 by sampling from a LDS with parameters A(s_t), Q(s_t), C, R, x₀(s₀), and Q₀(s₀).

[0305] The above procedure will produce a random sequence of samples from the SLDS model. If an average noiseless state trajectory is desired, the synthesis can be run with LDS noise parameters (Q(s_t), R, Q₀(s₀)) set to zero and switching states whose duration is equal to average state durations, as determined by the switching state transition matrix Π. For example, this would result in sequences of prototypical walk or jog motions, whereas the random sampling would exhibit deviations from such prototypes. Intermediate levels of randomness can be achieved by scaling the SLDS model noise parameters with factors between 0 and 1.

[0306] The model parameters can also be modified to meet new constraints that were, for instance, not present in the data used to learn the SLDS. For example, initial state mean x₀, variance Q₀and switching state distribution π can be changed so as to force the SLDS to start in some arbitrary state x_aof regime i_a, e.g., to start simulation in a “walking” regime i_awith figure posture x_a. To achieve this, set x₀(i_a=x_a, Q_0(i_a)=0, π(i_a)=1, and then proceed with the synthesis of this constrained model.

[0307] A framework of optimal control can be used to formalize synthesis under constraints. Optimal control of linear dynamic systems is described, for example, in B. Anderson and J. Moore, “Optimal Control: Linear Quadratic Methods,” Prentice Hall, Englewood Cliffs, N.J., 1990. For a LDS, the optimal control framework provides a way to design an optimal input or control u_tto the LDS, such that the LDS state x_tgets as close as possible to a desired state x_t^d. The desired states can also be viewed as constraint points. The same formalism can be applied to SLDSs. Namely, the system equation, Equation 1, can be modified as

[0308] x_t+1=A(s_t+1)x_t+u_t+1+v_t+1(s_t+1) (Eq. 1A)

[0309] FIG. 21 is a dependency graph of the modified SLDS 550 with added controls u_t552. A goal is to find u_tthat makes x_tas close as possible to a given x_t^d. Usually, a quadratic measure of closeness is used, i.e., a control u_tis desired such that the cost V^(x), or value function

V^{(x)} = ⟨ \sum_{t = 0}^{T - 1} [{(x_{t} - x_{t}^{d})}^{'} W_{t}^{(x)} (x_{t} - x_{t}^{d}) + u_{t}^{'} W_{t}^{(u)} u_{t}] ⟩

[0310] is minimized, where W_t^(x)and W_t^(u)are weight matrices. The optimal control is then

{\hat{u}}_{t} = \arg \min_{u} V^{(x)}

[0311] For instance, if a SLDS is used to simulate a motion of the human figure, x_t^dmight correspond to a desired figure posture at key frame t, and W_t^(x)might designate the key frame, i.e., W_t^(x)is large for the key frame, and small otherwise.

[0312] In addition to “closeness” constraints, other types of constraints can similarly be added. For example, one can consider a minimum-time constraint where the terminal timer T is to be minimized with the optimal control û_t. In that case, the value function to be minimized becomes V^(x)←V^(x)+T.

[0313] Other types of constraints that can be cast in this framework are the inequality or bounding constraints on the state x_tor control u_t(e.g., x_t>x^min, u_t<u^max). Such constraints could prevent, for example, the limbs of a simulated human figure from assuming physically unrealistic postures, or the control u_tfrom becoming unrealistically large.

[0314] If s_tis known, the solution for the best control u_tcan be derived using the framework of linear quadratic regulators (LQR) for time-varying LDS. When s_tis not known, the estimates of s_tobtained from Viterbi or variational inference can be used and the best control solution can then be found using LQR.

[0315] Alternatively, as shown in FIG. 22, the SLDS 560 can be modified to include inputs 562, i.e., controls, to the switching state. The modified SLDS 560 is then described by the following equation:

[0316] Pr(s_t+1=i|s_t=j, a_t+1=k)=Π^(a)(i, j, k)

[0317] where a_trepresents the control of the switching state at time t, and Π^(a)(i,j,k) defines a conditioned switching state transition matrix which depends on the control a_t562.

[0318] Using the switching control a_t562, constraints imposed on the switching states can be satisfied. Such constraints can be formulated similarly to constraints for the continuous control input of FIG. 21, e.g., switching state constraints, switching input constraints and minimum-time constraints. For example, a switching state constraint can guarantee that a figure is in the walking motion regime from time t_sto t_e. To find an optimal control â_tthat satisfies those constraints, one would have to use a modified value function that includes the cost of the switching state control. A framework for the switching state optimal control could be derived from the theory of reinforcement learning and Markov decision processes. See, for example, Sutton, R. S. and Barto, A. G., “Reinforcement Learning: An Introduction,” Cambridge, Mass., MIT Press, 1998.

[0319] For example, one would like to find a, which minimizes the following value function,

V^{(s)} = - ⟨ \sum_{t = 0}^{T - 1} γ^{'} c_{t} (s_{t}, s_{t - 1}, a_{t}) ⟩

[0320] Here, c_t(s_t,s_t−1,a_t) represents a cost for making the transition from switching state s_t−1to s_t, for a given control a_t, and γ is a discount or “forgetting” factor. The cost function c_tis designed to emphasize, with a low c_t, those states that agree with imposed constraints, and to penalize, with a high c_t, those states that violate the imposed constraints. Once the optimal control â_thas been designed, the modified generative SLDS model can be driven by noise to produce a synthetic trajectory.

[0321] As FIG. 23 illustrates, the SLDS system 750 can be modified to include both types of controls, continuous 572 and switching 574, as indicated by the following equation.

[0322] x_t+1=A(s_t+1)x_t+u_t+1+v(s_t+1)

[0323] Pr(s_t+1|s_t=j, a_t+1=k)=Π^(a)(i, j, k)

[0324] In this model 570, the mixed control (u_t, a_t) can lead to both a desired switching state, e.g., motion regime, and a desired continuous state, e.g., figure posture. For example, a constraint can be specified that requires the human figure to be in the walking regime i_dwith some specific posture x_dat time t. As in the case of the continuous and switching state optimal controls, additional constraints such as input bounding and minimum time can also be specified for the mixed state control. To find the optimal control (û_t, â_t), a value function can be used that includes the costs of the switching and the continuous state controls, e.g., V^(x)+V^(s). Again, once the optimal control (û_t, â_t) is designed, the modified generative SLDS model can be used to produce a synthetic trajectory.

[0325] FIG. 24 illustrates the framework 580, for synthesis under constraints, which utilizes optimal control. The SLDS model 582 is modified by a SLDS model modification module 584 to include the control terms or inputs. Using the modified model 585, an optimal control module 586 finds the optimal controls 587 which satisfy constraints 588. Finally, a synthesis model 590 generates synthesized trajectories 592 from the modified SLDS 585 and the optimal controls 587.

[0326] The use of optimal controls by the present invention to generate motion by sampling from SLDS models in the presence of constraints has broad applications in computer animation and computer graphics. The task of generating realistic or compelling motions for synthetic characters has long been recognized as an extremely challenging problem. One classical approach to this problem is based on the notion of spacetime constraints which was first introduced by Andrew Witkin and Michael Kass, “Spacetime Constraints” Computer Graphics, Volume 22, Number 4, August 1988 pages 159-168. In this approach, an optimal control problem is formulated over an analytic dynamical model derived from Newtonian physics. For example, in order to make a lamp hop in a realistic way, the animator would derive the physical equations which govern the lamp's motion. These equations involve the mass distribution of the lamp and forces such as gravity that are acting upon it.

[0327] Unfortunately, this method of animation has proved to be extremely difficult to use in practice. There are two main problems. First, it is extremely difficult to specify all of the equations and parameters that are necessary to produce a desired motion. In the case of the human figure, for example, specifying all of the model parameters required for realistic motion is a daunting task. The second problem is that the resulting equations of motion are highly complex and nonlinear, and usually involve an enormous number of state variables. For example, the jumping Luxo lamp described in the Witkin and Kass paper involved 223 constraints and 394 state variables. The numerical methods which must be used to solve control problems in such a large complex state space are also difficult to work with. Their implementation is complex and their convergence to a correct solution can be problematic.

[0328] In contrast, our approach of optimal control of learned SLDS models has the potential to overcome both of these drawbacks. By using a learned switching model, desired attributes such as realism can be obtained directly from motion data. Thus, there is no need to specify the physics of human motion explicitly in order to obtain useful motion synthesis. By incorporating additional constraints through the mechanism of optimal control, we enable an animator to achieve specific artistic goals by controlling the synthesized motion. One potential advantage of our optimal control framework over the classical spacetime approach is the linearity of the SLDS model once a switching sequence has been specified. This makes it possible to use optimal control techniques such as the linear quadratic regulator which are extremely stable and well-understood. Implementations of LQR can be found in many standard software packages such as Matlab. This stands in contrast to the sequential quadratic programming methods required by the classical spacetime approach.

[0329] The spacetime approach can be extended to include the direct use of motion capture data. This is described in Michael Gleicher, “Retargetting Motion to New Characters,” Proceedings of SIGGRAPH 98, in Computer Graphics Proceedings, Annual Conference series, 1998, pages 33-42. In this method, a single sequence of human motion data is modified to achieve a specific animation objective by filtering it with a biomechanical model of human motion and adjusting the model parameters. With this method, a motion sequence of a person walking can be adapted to a figure model whose proportions are different from that of the subject. Motions can also be modified to satisfy various equality or inequality constraints.

[0330] The use of motion capture data within the spacetime framework makes it possible to achieve realistic motion without the complete specification of biomechanical model parameters. However this approach still suffers from the complexity of the underlying numerical methods. Another disadvantage of this approach in contrast to the current invention is that there is no obvious way to generate multiple examples of the same type of motion or to generate new motions by combining several examples of motion data.

[0331] In contrast, sampling repeatedly from our SLDS framework can produce motions which differ in their small details but are qualitatively consistent. This type of randomness is necessary in order to avoid awkward repetitions in an animation application. Furthermore, the learning approach makes it possible to generalize from a set of motions to new motions that have not been seen before. In contrast, the approach of retargeting is based on modifying a single instance of motion data.

[0332] Another approach to synthesizing animations from learned models is described in Matthew Brand, “Voice Puppetry,” SIGGRAPH 99 Conference Proceedings, Annual Conference Series 1999, pages 21-28 and in Matthew Brand and Aaron Hertzmann, “Style Machines” SIGGRAPH 2000 Conference Proceedings, Annual Conference Series 2000, pages 183-192. This method uses sampling from a Hidden Markov Model to synthesize facial and figure animations learned from training data. Unlike our SLDS framework, the HMM representation is limited to using piecewise constant functions to model the feature data during learning. This can require a large number of discrete states in order to capture subtle effects when working with complex state space data.

[0333] In contrast, our framework employs a set of LDS models to describe feature data, resulting in models with much more expressive power. Furthermore, the prior art does not describe any mechanism for imposing constraints on the samples from the models. This may make it difficult to use this approach in achieving specific animation objectives.

[0334] To test the power of the learned SLDS synthesis/interpolation framework, we examined its use in synthesizing realistic-looking motion sequences and interpolating motion between missing frames. In one set of experiments, the learned walk/jog SLDS was used to generate a “synthetic walk” based on initial conditions learned by the SLDS model.

[0335] FIG. 25 illustrates a stick FIG. 220 motion sequence of the noise driven model. Depending on the amount of noise used to drive the model, the stick figure exhibits more or less “natural”-looking walk. Departure from the realistic walk becomes more evident as the simulation time progresses. This behavior is not unexpected as the SLDS in fact learns locally consistent motion patterns. FIG. 25 illustrates a synthesized walk motion over 50 frames using SLDS as a generative model. The states of the synthesized motion are shown on the graph 222.

[0336] Another realistic situation may call for filling in a small number of missing frames from a large motion sequence. SLDS can then be utilized as an interpolation function. In another set of experiments, we employed the learned walk/jog model to interpolate a walk motion over two sequences with missing frames. Missing-frame constraints were included in the interpolation framework by setting the measurement variances corresponding to those frames to infinity. The visual quality of the interpolation and the motion synthesized from it was high. As expected, the sparseness of the measurement set had definite bearing on this quality.

USE OF THE INVENTION

[0337] Our invention makes possible a number of core tasks related to the analysis and synthesis of the human figure motion:

[0338] Track figure motion in an image sequence using learned dynamic models.

[0339] Classify different types of human motion.

[0340] Synthesize motion using stochastic models that correspond to different types of motion.

[0341] Interpolate missing motion data from sparsely observed image sequences.

[0342] We anticipate that our invention could impact the following application areas:

[0343] Surveillance: Use of accurate dynamic models could lead to improved tracking in noisy video footage. The ability to interpolate missing data could be useful in situations where frame rates are low, as in Web or other network applications. The ability to classify motion into categories can benefit from the SLDS approach. Two forms of classification are possible. First, specific actions such as “opening a door” or “dropping a package” can be modeled using our approach. Second, it may be possible to recognize specific individuals based on the observed dynamics of their motion in image sequences. This could be used, for example, to recognize criminal suspects using surveillance cameras in public places such as airports or train stations.

[0344] User-interfaces: Interfaces based on vision sensing could benefit from improved tracking and better classification performance due to the SLDS approach.

[0345] Motion capture: Motion capture in unstructured environments can be enabled through better tracking techniques. In addition to the capture of live motion without the use of special clothing, it is also possible to capture motion from archival sources such as old movies.

[0346] Motion synthesis: The generation of human motion for computer graphics animation can be enabled through the use of a learned, generative stochastic model. By learning models from sample motions, it is possible to capture the natural dynamics implicit in real human motion without a laborious manual modeling process. Because the resulting models are stochastic, sampling from the models produces motion with a pleasing degree of randomness.

[0347] Video editing: Tracking algorithms based on powerful dynamic models can simplify the task of segmenting video sequences.

[0348] Video compression/decompression: The ability to interpolate a video sequence based on a sparse set of samples could provide a new approach to coding and decoding video sequences containing human or other motion. In practice, human motion is common in video sequences. By transmitting key frames detected using SLSD classification at a low sampling rate and interpolating, using SLDS interpolation, the missing frames from the transmitted model parameters, a substantial savings in bit-rate may be achievable.

[0349] It will be apparent to those of ordinary skill in the art that methods involved in the present system for tracking using switching linear dynamic system models may be embodied in a computer program product that includes a computer usable medium. For example, such a computer usable medium can include a readable memory device, such as a hard drive device, a CD-ROM, a DVD-ROM, or a computer diskette, having computer readable program code segments stored thereon. The computer readable medium can also include a communications or transmission medium, such as a bus or a communications link, either optical, wired, or wireless, having program code segments carried thereon as digital or analog data signals.

[0350] While this invention has been particularly shown and described with references to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention encompassed by the appended claims.

Claims

What is claimed is:

1. A computer data signal embodied in a carrier wave for determining, from a set of possible switching states and responsive to a sequence of measurements, a corresponding sequence of switching states for a system comprising a plurality of dynamic models, comprising:

program code that models the target with a switching linear dynamic system (SLDS) comprising a plurality of dynamic models;

program code that associates each dynamic model with a switching state such that a model is selected when its associated switching state is true;

program code that determines, for a given measurement, and for each possible switching state, a set of continuous state estimates;

program code that determines a state transition record by determining and recording, for a given measurement and for each possible switching state, an optimal previous switching state, based on the measurement sequence, wherein the optimal previous switching state optimizes a transition probability based on the set of continuous state estimates;

program code that fits a measurement model of the target to the measurement sequence; and

program code that estimates a trajectory responsive to the fitted measurement model, the state transition record and SLDS parameters, said estimated trajectory comprising a sequence of continuous state estimates of the target corresponding to the measurement sequence.

Patent Citations (10)

Patent	Date	Inventor	Cited By
US5325098(A)	1994-06-01	Blair et al.	Examiner
US5923712(A)	1999-07-01	Leyendecker et al.	Examiner
US6064703(A)	2000-05-01	Cusani et al.	Applicant
US6226409(B1)	2001-05-01	Cham et al.	Examiner
US6243037(B1)	2001-06-01	Pulford et al.	Examiner
US6256418(B1)	2001-07-01	Rehg et al.	Examiner
US6314204(B1)	2001-11-01	Cham et al.	Applicant
US6393046(B1)	2002-05-01	Kohli et al.	Examiner
US6396878(B1)	2002-05-01	Piirainen	Examiner
US6480876(B2)	2002-11-01	Rehg et al.	Examiner

Non-Patent Literature (18)

Pavlović, Vladimir, et al., Time-Series Classification Using Mixed State Dynamic Bayesian Networks, In Computer Vision and Pattern Recognition, pp. 609-615, Jun. 1999.Applicant
Pavlović, Vladimir, et al., A Dynamic Bayesian Network Approach to Figure Tracking Using Learned Dynamic Models.Applicant
Welch, Greg and Bishop, Gary, An Introduction to the Kalman Filter, Department of Computer Science, Univ. of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175, Sep. 17, 1997, pp. 1-16.Applicant
http://www.scs.leeds.ac.uk/scs-only/teaching-materials/HiddenMarkovModels/html_dev/main.html.Applicant
Shumway, R.H. and Stoffer, D.S., Dynamic Linear Models with Switching, Journal of the American Statistical Association, Sep. 1991, vol. 86, No. 415.Applicant
Bar-Shalom Y. Li, X-R, Estimation & Tracking: principles, techniques, and software. YBS, Storrs, CT, 1998, pp. 446-484.Applicant
Jordan, M.I., et al., An Introduction to Variational Methods for Graphical Models, Oct. 11, 1999, http://www.stat.berkeley.edu/tech-reports/index.html, Report#508.Applicant
Ghahramani, Z., et al., Switching State-Space Models, pp. 1-23. Technical Report CRG-TR-96-3, Dept. of Computer Science, University of Toronto.Applicant
Rabiner, L.R. and Juang, B.H., An Introduction to Hidden Markov Models, IEEE ASSP Magazine, Jan. 1986, pp. 4-16.Applicant
Kim, Chang-Jin, Dynamic Linear Models with Markov-Switching, Journal of Econometrics 60, (1994) pp. 1-22.Applicant
Krishnamurthy, V. and Evans, J., Finite-Dimensional Filters for Passive Tracking of Markov Jump Linear Systems, Automatica, vol. 34, No. 6, pp. 765-770, 1998.Applicant
Minka, Thomas P., From Hidden Markov Models to Linear Dynamical Systems, pp. 1-10. ftp://vismod.www.media.mit.edu/pub/tpminka/papers/minka-lds-tut.ps.gz.Applicant
Ghahramani, Z. and Hinton G.E., Parameter Estimation for Linear Dynamical Systems, pp. 1-6, Technical Report CRG-TR-96-2, Dept. of Computer Science, University of Toronto.Applicant
A Brief Introduction to Graphical Models and Bayesian Networks, http://www.cs.berkeley.edu/˜murphyk/Bayes/bayes.html, pp. 1-19.Applicant
Maybeck, P.S., Stochastic Models, Estimation, and Control, vol. I Academic Press, 1979.Applicant
Murphy, Kevin P., Switching Kalman Filters, Aug. 21, 1998, pp. 1-16.Applicant
Murphy, Kevin P., Inference and Learning in Hybrid Bayesian Networks, Report No. UCB/CSD-98-990, Jan. 1998, pp. 1-18.Applicant
Ghahramani, Zoubin and Hinton, G.E., Variational Learning for Switching State-Space Models, Gatsby Computational Neuroscience Unit,, pp. 1-26.Applicant

Abstract