/99 $10.00 (c) 1999 IEEE
|
|
- Rebecca Leonard
- 5 years ago
- Views:
Transcription
1 The PDAF Based Active Contour N. Peterfreund Center for Engineering Systems Advanced Research Oak Ridge National Laboratory, P.O.Box 8 Oak Ridge, TN, vp@ornl.gov Abstract We present a new active contour model in spatiovelocity space which is based on the probability data association lter (PDAF) approach. It employs a directional-based measurement model of image potential and of optical-ow along the contour points. The proposed directional approach of measurements is the basis for the velocity-based discrimination between measurements of the object to that of image clutter. The model chooses the appropriate measurements which are most consistent with previous estimation of motion in the sense of the PDAF approach. In order to obtain reliable measurements of image motion and of gradientbased image potential, we propose a directional smoothing operator which is the basis for discriminating the objects measurements from that of image clutter. The method was applied toreal world tracking problems such as a walking leg and a waving hand. Introduction Visual tracking of nonrigid objects with active contour models has been the subject of intensive research during the past years (e.g. [8], [], [], [] and [7]). One of the major problems in tracking with these models arise in the presence of image clutter. During tracking of moving objects, the spurious objects could then "trap" parts of the active contour, and thus may result with serious tracking problems [3]. The problem is caused, mainly, by the error introduced within the system measurements [3]. Due to pre-smoothing of the image sequence, which is essential to reduce noise and to obtain reliable measurements of image velocity [] and of image potential [], the image clutter introduces large errors to the systems measurements. In order to reduce the sensitivity of tracking to image clutter, we propose in this work a new active contour model with directional-based measurements of image velocity and of gradient-based image potential. The problem of incorporating the appropriate measurements to obtain optimal tracking in the sense of the PDAF approach, is the subject of this work. Considerable work has been done on the subject of object tracking with visual sensors. In this paper we focus on methods which are based on the Kalman ltering approach, in which models of objects dynamics and of measurement noise are incorporated to obtain the optimal minimum variance estimation of state (e.g. [3]). Examples of applications of this method in visual tracking problems can be found in 3-D model-based tracking [], [8] and in contour-based tracking of ob < vl vr > vl Figure.: Illustration of velocity estimation in the vicinity of the intersection region between two moving objects. (a) two moving objects (b) the resulting estimation of motion. ject's contour [5], [8], [5]. Recently a new stochastic snake model was proposed for visual tracking in spatiovelocity space [3]. This method, which is a generalization of the velocity snake proposed by Peterfrend [], employs measurements of both gradient-based image potential and of optical-ow to obtain optimal estimation of the contour position and velocity. Though the proposed method increase the robustness of tracking to measurements noise [3], it may fail however in the present of high contrast image clutter. Due to pre-smoothing operation (which is essential to reduce image noise), this clutter may introduce bias into velocity and potential eld measurements, and thus may result with target loss. The problem is illustrated in Figure., where velocity estimation in the vicinity of the intersection region between two moving objects, results in some weighted averaging of both velocities. The edge-based potential eld measurements in the vicinity of the intersection point, suer from the same problem and could result with attracting forces towards image clutter. In order to overcome this problem, we propose in this work a new directional based approach for measurements of image motion and potential. This method is based on new directional smoothing and derivative operators. Referring to the problem introduced in Figure.,onecould then obtain two unbiased directional measurements of image velocity and of potential eld. The tracking scheme could then choose the appropriate directional measurements which are most consistent with previous estimation of motion. This tracking approach is the subject of this work. We use the following notions: The vector x (x; y) denote -D spatial coordinates. The spatial gradient of ascalar function I(x; t) is given by ri (I x ;I y ) where and denote the partial derivatives of I vr /99 $. (c) 999 IEEE
2 with respect to x and y, respectively. The matrix O MN denote an M N zero matrix, O M is an M dimensional zero vector, and I M denote an M M identity matrix. The Velocity Snake Model: Kalman Filtering Approach In this section we review the continuous-time stochastic model of the velocity snake, originally proposed in [3]. This model is based on the Extended Kalman ltering method (e.g. [3]) with system measurements of image motion and of gradient based image potential. The discrete-time version of this model is given in [3]. Consider the closed contour v(s; t) (x(s; t); y(s; t)) for some spatial parametric domain s [; ] and time t [; ). Let and v The dynamics of the Real-Time velocity snake model, originally proposed in [], is given by v tt + ri(ri v t + I @ (w v s (w v ss ),rp (v(s; t);t) : () where P is the potential eld energy of the contour, and ; ; ; w and w are some positive scalars. The discretization of the velocity snake model in space is based onequidistant sampling of v(s; ) along s, with u [u ;:::;u M ] and u i v(s i ; ) denoting the snake points, and on nite dierence approximation of partial derivatives in space [7], [5]. The stochastic contour model is based on discretization in space of the velocity snake (). Let [x ;x :::x M ] T and [y ;y :::y M ] T denote the vectors of sampling points corresponding to u, with u i [x i ;y i ], V [ T ; T ] T and _V [ _ T ; _ T ] T, where _V denote the derivative of V with respect to t. Wedenote the Gaussian probability density with mean vector h and covariance matrix Q by N(h; Q). The Markov process model corresponding to () with is given by [3] OMM V_V d dt, where V_ V OMM I M u p + K K I M,, T M q ; q N(;Q) D () D Here the matrix K consists of the deformation constraints imposed byw and w in () [5], [7], and D is the space derivative-approximation matrix [3]. Let [ x ; y ], where x and y are diagonal matrices with the diagonal elements given by I x (u) and I y (u), respectively, [Px T (u); Py T (u)] T. The measurement vector of () is given by [3] I t u p, _ V + M w (3) : Note that the second measurement vector I t results from rst order approximation of the intensity preserving equation I(V;t + dt) I(V, Vdt;t); _ which is a special case of the optical-ow constraint equation []. T The estimation problem of ^V [^V T V ^_ ] T is solved by the Extended Kalman Filter method [3]. The state estimation of () is then given by [3], OMM where, for OMM d ^V I M dt,, T ^V;t)+G( ^V;t) I t ( ^V;t)+ ^_V I M H [ ;,] and L we have the Kalman gain matrix () L L L T ; (5) L G( ^V;t)LH T W,, L L T W, : () The covariance matrix L of ^V is given by the solution of the continuous-time matrix Riccati equation (e.g. [3]). 3 The PDAF Tracking Approach in Spatio-Velocity Space In this section we present the probabilistic data association lter (PDAF) corresponding to the stochastic model in previous section. This method, which is based on the formalism proposed in [5], improves the robustness of tracking as it results with reliable measurements even in the presence of large image clutter. According to the proposed model of system measurements, a number of directional measurements of image potential and motion are sampled at each snake point. The tracking model then evaluates the probability of having each of these measurements, based on previous estimation of motion. Modeling of velocity and potential eld measurements as a weighted average of directional measurements, is the basis for the proposed PDAF snake model approach. Within this model, the weight applied to each measurement is dened as the probability of having it, given previous estimation of motion. Next we dene the directional measurements. The "right hand" and "left hand" directional derivatives of ascalar function I(x; y) along x, are dened as D + x I lim dx! + I(x+dx;y),I(x;y) dx D, x I lim dx!, I(x+dx;y),I(x;y) dx ; Here + denote small positive scalar, and, asmall negative one. The directional derivatives along y are dened in a similar manner. The proposed scheme is the basis for computation of directional measurement w N(;W) of : the gradient of image potential and of optical-ow. (7) In this work we limit the directional measurements to the four types given in Figure /99 $. (c) 999 IEEE
3 D x D y D x D+y Figure 3.: Example of four types of directional measurements, where D x + and D x, denote the "right hand" and the "left hand" directional derivatives along x, respectively, and D y + and D, y are the corresponding measurements along y axis. 3. The PDAF Tracking Model The following is based on the PDAF approach proposed in [5]. Consider the system state at time k, V(k), and let Z k fz(j)g k j denote the vector of state measurements, where z(j) is the measurement at time j. We assume that z(k) fz i (k)g m k for some i m k where z i (k) is the i'th measurement vector. In our model, z i (k) denes the vector of velocity and potential eld measurements along the contour points, where each pair of measurements of velocity and of potential eld at a contour point is chosen from one of the four types of directional measurements as dened in Figure 3.. We assume that the probability of having V(k), based on the set of system measurements Z k,,, satises k, P V(k)jZ N V(k); ^V, (k);l, (k) (8) where N(;a;Q) denote the normal probability distribution with mean a and covariance matrix Q, and ^V, (k) and L, (k) are the estimation of V(k) based onz k,, and the corresponding covariance matrix of estimation, respectively. In the proposed model we assume that only one of the m k measurements was generated by the system [5]. Let i denote the assumption that z i (k) is the true measurement. The probability i (k) that i is the true assumption, satises i (k)p ( i jz k ) D y with D+x i From probability theory, it follows that P (V(k)jZ k ) i D+y D+x i (9) P (VjZ k ; i )P ( i jz k ) () Let ^V(k) E(V(k)jZ k ) denote the optimal estimator of V(k) [5], and ^V i (k) E(V(k)jZ k ; i ) denote the one under the assumption i. It follows from (9) and () that ^V(k) i i (k) ^V i (k) () Let L(k) and L i (k) for i :::m k denote the covariance matrices of ^V(k) and ^V i (k), respectively. Similar to computation of ^V(k) in (), it can be shown that L(k) i i L i (k)+ i i ^V i ^V T i, ^V ^V T () A major problem with the proposed estimation approach is the large number of measurements (and assumptions) m k. In case of M dimensional vector z i (k) with each component chosen from one of L dierent directional measurements (in our case we assume L ), we have on the total m k M L measurements vectors. We shall show that this approach degenerates to only LM types of measurements and assumptions. 3. The PDAF-Based Active Contour Model In this section we apply the proposed PDAF approach to the tracking model (), (3). Measurement Model Consider the set of measurements at the vector of snake points u. Each measurement at a snake point is assumed tohavefourtypes of directional measurements, as proposed in Figure 3.. Let C [c ;:::;c M ] with c i :::, where c i ;:::; denote the type ofdirectional measurement at the i'th point and c i denote a spurious measurement. Using (3), the set of measurements at time k are then given C (u) u p I t (u), C _V + w z C (k) C [c ;:::;c M ] c i ;:::; (3) C and C correspond to the appropriate directional derivatives dened byc. Note that as I t denote derivative along time, it does not contain the superscript C. System Model: The Continuous Time Approach We assume the system model () with a diagonal covariance matrix of measurement noise W I M,for some >. Using ()-() and a rst order approximation of integration along time, we have ^V C ^V +t where A ^V, B@PC + G C (I t + C ^_V ) G C, () L L CT (5) and A and B are the appropriate matrices in (). Substituting ^V C into (), the optimal estimate ^V, based on the measurement set (3), satises d ^V dt f () /99 $. (c) 999 IEEE
4 where L types of directional measurements as dened in Figure 3.. Using (3), we have (, c zi c i V _ + w i ;:::;M (k)i t (u i ) c ;:::; (9) b c f A ^V, BE(@PC ), L E( CT I t )+E( CT C ) ^_ V and E() denote expectation. The result is obtained under lim t!. Analyzing the products CT I t, CT C,and@P C,itfollowsthateach component of these terms depends only on measurements on a single snake point. Hence the expectation of each component is independent of other snake points, and depends only on the four types of directional measurements on that snake point. Let c i(u i ) for c i ;:::; denote the probability of having the type ofdirectional measurement dened by c i, at the snake point u i. The i expectation of the i'th component of CT I t, h CT I t i Ic i x (u i )I t (u i ),is then given by h X E( CT I t ) ii c i c i (u i )I c i x (u i )I t (u i ) (7) The same property holds for all components in CT C C. Next we compute the dynamics of the covariance matrix of ^V. Using the continuous-time matrix Ricatti equation (e.g. [3]) and (), it can be shown that the covariance matrix of ^V satises where dl dt E(F C )L + LE(F C ) T, L E( CT C ) L T L + Q + ^Vf T + f ^V T (8) E(F ) L I M,, +E(@ P ), T From analysis of components P, it follows that the matrix consists of M nonzero components, where each component is only function of a single snake point. Hence, the expectation is done similar to (7). From the above results, it follows that the complexity of computation of each of the components in () and (8) is only in the order of M. This is in contrast to the original result in () and () which have a complexity in the order of M. Probability Evaluation and Validation of Measurements The probability c i(u i ) of having a given directional measurement at the snake point u i is dened as the probability of the corresponding directional velocity measurement. Let zi c (k) denote the directional measurement of velocity at snake point u i,where c denote a spurious measurement, and c ;:::; correspond to the four where c i is the i'th row of C corresponding to the directional measurement c, and w N(; ). The random variable b is uniformly distributed over [,a; a] for some a>. Consider the continuous-time estimation problem. Given the estimation ^V of state at time step k, the corresponding covariance matrix L, and the potential eld C,forsomeC, theprediction of velocity measurement at the snake point u i is zi c, [, c i] ^V C, and Si c, (k) c i LC, c i T () where the prediction of state ^V C, is given by () with G C, and the corresponding covariance matrix L C, is obtained from the Ricatti equation with no system measurements. It can be shown that both ^z i c, and Si c, depend only on current estimation ^V and on the measurement of potential eld at the snake point u i. No other measurements on other snake points aect this estimation. The probability c i i (u i) of having the appropriate velocity measurement at the snake point u i is thus independent of the measurements at the other snake points, and hence, can be evaluated separately. Under the gaussian assumption of measurements noise, the probability of having a directional measurement at a snake point u i is dened as c (u i ) r expf,(z c i, ^zc i, ) T S c i,, (z c i, ^zc i, )g i ;::: r a i () where r denote the normalization scalar. Note that in the case where i we assume uniform probability distribution function over [,a; a]. On Spatial Directional Smoothing and Dierentiation In order to obtain reliable measurements of optical- ow (e.g. []) and to increase the "domain of attraction" of image potential at the object's boundary, the image sequence should be smoothed using a low pass operation. In the presence of clutter boundary, however, this smoothing operation might introduce errors within the system measurements, as illustrated in Figure.. According to this result, most samples of image potential within the region between the two image boundaries (object-left, clutter-right) would point towards the clutter edge, and thus might cause serious tracking problems. The same applies to measurements of optical- ow. In order to overcome this problem, we propose in this work the right-hand and left-hand smoothing operators given in Figure.. It is shown that when applying the left-hand smoothing lter, measurements within the region between the two boundaries would be /99 $. (c) 999 IEEE
5 (a) (b) Figure.: (a) A two boundary one-dimensional image, (b) The image in (a) after low-pass ltering operation. (a) (b) (c) (d) Figure.: (a) Right-hand directional pre-smoothing lter, (b) left-hand directional pre-smoothing lter, (c) the ltering result of the image in.(a) with the righthand smoothing lter, (d) the ltering result of the image in.(a) with the left-hand smoothing lter. only aected by the left boundary, and via-versa when applying the right-hand smoothing lter. According to the directional based measurement approach proposed in this work, prior to calculation of right hand directional derivatives, a right hand directional pre-smoothing lter would be applied. The same holds for left hand measurements. This method can be directly extended to the two dimensional case by applying one-dimensional lter along each axis. 5 Experimental Results We demonstrated the performance of the proposed tracking scheme by applying it to real image sequence with nonrigid objects such as a human leg andawaving hand. We employed the discrete approximation of the model ()-(8). The parameters of the dynamical model were initialized to obtain stable tracking using stability analysis of a linearized model, in the presence of a constant velocity motion of image boundary []. These parameters were then adjusted manually to improve the performance of tracking, resulting with, 3and w w. These parameters could be obtained automatically using learning methods as the one proposed in [8]. The sampling interval was set to t. The contour lines were initialized manually using polygonal approximation of shape. The results of tracking the waving hand are given in Figure 5. (a)-(f). The positions of snake points in previous frame are marked withred dots, the current estimation and the corresponding velocities by the blue lines and arrows. Points which were detected tohave only spurious measurements are markedwithagreen star. In 5. (a), (d) we present the results at the 'th frame, in (b), (e) the ones at the 'th, and in (c), (f) the ones at the 'th frame. In 5.(d) we also show the probabilities of the directional measurements. It is shown that the directional probabilities tends to zero in the vicinity of the shelf at the top right hand side of the hand. The results of tracking the walking leg are given in Figure 5. (g)-(l), with (g), (j) denoting the ones at the 'th frame, (h), (k) at the 8'th, and (i), (l) the ones at the 55'th frame. It can be shown that measurements at the moving hand were detected to be spurious. The kalman snake model of Szeliski and Terzopoulos [5] failed totrack these objects (see [3] for these results). Conclusions We proposed in this work a new active contour model which is based on directional measurements of image velocity and of edge-based potential eld, and on the Probability Data Association lter method. The directional-based approach, separates measurements of image motion from that of image clutter at each snake point. The system then incorporates these measurements into a single measurement vector using weighted averaging, where a weight is dened tobetheproba- bility of having the measurement, given previous estimation of motion. According to the proposed approach, for M contour points with four types of direction measurements at each point, we have on the total M types of measurement vectors. We show that these measurements degenerate into a single M dimensional measurement vector, wherein each scalar is given by a weighted averaging of the four types of measurements at this point. Tracking a moving object with a dynamical tracking system, can be viewed asacontrol problem wherein the image potential and motion dene the system inputs, the smoothing constraints on shape and velocity are used to increase the stability of the system, and the motion control is used as velocity feedback to reduce tracking errors in the presence ofconstant motion of image boundary []. The parameters of the system are chosen to obtain stable tracking in the presence ofknown limits on image motion and on potential-eld characteristics. Within the proposed control frame-work, the the system parameters are chosen in a way that, during tracking, the trajectory will remain within the "domain of attraction" of the objects contour. This domain of attraction is function of the known limits on image motion, and the properties of image potential. In the case of image motion which is higher then the dened limits, the system contour is no longer guaranteed to stay within the "domain of attraction" of the object's contour and might converge to other objects which belong to image clutter. This problem of change in the limits on image motion is the subject of current research work /99 $. (c) 999 IEEE
6 References [] G. Adiv, \Determining Three-Dimensional Motion and Structure from Optical Flow Generated by Several Moving Objects, IEEE Trans. Pattern Anal. and Machine Intell., Vol PAMI-7, No., pp. 38-, 985. [] A.A. Amini, R.W. Curwen and J.C. Gore, \Snakes and Splines for Tracking Non-Rigid Heart Motion", in B. Buxton and R. Cipolla (Eds.), Computer- Vision: ECCV'9, Springer-Verlag, pp. 5-, 99. [3] K.J. Astrom and B. Wittenmark, Adaptive Control, Addison-Wesley, 995. [] J.L. Barron, D.J. Fleet and S.S. Beauchemin, \Performance of Optical Flow Techniques", Int. J. of Computer Vision, Vol., No., pp.3-77, 99. [5] Y. Bar-Shalom and T.E. Fortmann, Tracking and Data Association, Academic Press Inc., Orlando, Florida, 988. [] B. Bascle and R. Deriche, \Stereo Matching, Reconstruction and Renement of 3D Curves using Deformable Contours', in Proc. 'th Int. Conf. on Computer Vision, Berlin, Germany, pp. -3, 993. [7] B. Bascle and R. Deriche, \Energy-Based Methods for D Curve Tracking, Reconstruction and Renement of 3D Curves and Applications", in Proc. of SPIE: Geometric Methods in Computer Vision II, San Diego, CA., pp. 8-93, 993. [8] A. Blake and M. Isard, \3D Position, Altitude and Shape Input using Video Tracking of Hands and Lips", in Proc. Computer Graphics, SIGGRAPH, pp. 7-78, 99. [9] I.J. Cox and S.L. Hingorani, \An Ecient Implementation of Reid's Multiple Hypothesis Tracking Algorithm and Its Evaluation for the Purpose of Visual Tracking, IEEE Trans. Pattern Anal. and Machine Intell., Vol. 8, No., pp. 38-, 99. [] R. Curwen and A. Blake, \Dynamic Contours: Real-Time Active Splines", in A. Blake and A. Yuille (Eds), Active Vision, MIT Press, pp , 99. [] M.P. Dubuisson, S. Lakshmanan and A.K. Jain, \Vehicle Segmentation and Classication using Deformable Templates", IEEE Trans. Pattern Anal. and Machine Intel., Vol. 8, No. 3, pp , 99. [] D. B. Gennery, \Visual Tracking of Known Three-Dimensional Objects", Int. J. of Computer Vision, Vol. 7, No. 3, pp. 3-7, 99. [3] M.S. Grewal and A.P. Andrew, Kalman Filtering: Theory and Practice, Prentice Hall Inc., Upper Saddle River, New Jersey, 993. [] B.K.P. Horn and B.G. Schunk, \Determining Optical Flow", Articial Intelligence, Vol. 7, pp. 85-, 98. [5] M. Isard and A. Blake, \Visual Tracking by Stochastic Propagation of Conditional Density", in Proc. 'th European Conf. on Computer Vision, Cambridge, England, pp , 99. [] M. Kass, A. Witkin and D. Terzopoulos, \Snakes: Active Contour Models", Int. J. Computer Vision, Vol., No., pp. 3-33, 987. [7] F. Leymarie and M.D. Levine, \Tracking Deformable Objects in the Plane Using an Active Contour Models", IEEE Trans. Pattern Anal. and Machine Intell., Vol. 5, No., pp. 7-3, 993. [8] D. G. Lowe, \Robust Model-Based Motion- Tracking Through the Integration of Search and Estimation", Int. J. of Computer Vision, Vol. 8, No., pp. 3-, 99. [9] M.R. Luettgen, W.C. Karl and A.S. Willsky, \Ef- cient Multiscale Regularization with Applications to the Computation of Optical Flow", IEEE Trans. Image Processing, Vol. 3, No., pp. -, 99. [] R. Malladi, J.A. Sethian and B.C. Vemuri, \Shape Modeling with Front Propagation: A Level Set Approach", IEEE Trans. Pattern Anal. and Machine Intell., Vol. 7, No., pp , 995. [] D. Metaxas and D. Terzopoulos, \Shape and Nonrigid Motion Estimation Through Physics-Based Sythesis", IEEE Trans. Pattern Anal. and Machine Intell., Vol. 5, No., pp , 993. [] N. Peterfreund, \The Velocity Snake", in Proc. IEEE Nonrigid and Articulated Motion Workshop, Virgin Islands, 997. [3] N. Peterfreund, \Robust Tracking of Position and Velocity with Kalman Snakes, in Proc. ICCV, Jan [] S. Rowe and A. Blake, \Statistical Mosaics for Tracking", Image and Vision Computing, Vol., No. 8, pp. 59-5, 99. [5] D. Terzopoulos and R. Szeliski, \Tracking with Kalman Snakes", in A. Blake and A. Yuille (Eds.), Active Vision, MITPress, pp. 3-, /99 $. (c) 999 IEEE
7 (a) (b) (c) (d) (e) (f) (g) (h) (i) (j) (k) (l) Figure 5.: Tracking results of the waving hand (a)-(f) and the walking leg (g)-(l) /99 $. (c) 999 IEEE
On Mean Curvature Diusion in Nonlinear Image Filtering. Adel I. El-Fallah and Gary E. Ford. University of California, Davis. Davis, CA
On Mean Curvature Diusion in Nonlinear Image Filtering Adel I. El-Fallah and Gary E. Ford CIPIC, Center for Image Processing and Integrated Computing University of California, Davis Davis, CA 95616 Abstract
More informationNo. of dimensions 1. No. of centers
Contents 8.6 Course of dimensionality............................ 15 8.7 Computational aspects of linear estimators.................. 15 8.7.1 Diagonalization of circulant andblock-circulant matrices......
More informationCSC487/2503: Foundations of Computer Vision. Visual Tracking. David Fleet
CSC487/2503: Foundations of Computer Vision Visual Tracking David Fleet Introduction What is tracking? Major players: Dynamics (model of temporal variation of target parameters) Measurements (relation
More informationHuman Pose Tracking I: Basics. David Fleet University of Toronto
Human Pose Tracking I: Basics David Fleet University of Toronto CIFAR Summer School, 2009 Looking at People Challenges: Complex pose / motion People have many degrees of freedom, comprising an articulated
More informationNonlinear Dynamical Shape Priors for Level Set Segmentation
To appear in the Journal of Scientific Computing, 2008, c Springer. Nonlinear Dynamical Shape Priors for Level Set Segmentation Daniel Cremers Department of Computer Science University of Bonn, Germany
More informationA Generative Model Based Approach to Motion Segmentation
A Generative Model Based Approach to Motion Segmentation Daniel Cremers 1 and Alan Yuille 2 1 Department of Computer Science University of California at Los Angeles 2 Department of Statistics and Psychology
More informationMarkov chain Monte Carlo methods for visual tracking
Markov chain Monte Carlo methods for visual tracking Ray Luo rluo@cory.eecs.berkeley.edu Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720
More informationCarnegie Mellon University Forbes Ave. Pittsburgh, PA 15213, USA. fmunos, leemon, V (x)ln + max. cost functional [3].
Gradient Descent Approaches to Neural-Net-Based Solutions of the Hamilton-Jacobi-Bellman Equation Remi Munos, Leemon C. Baird and Andrew W. Moore Robotics Institute and Computer Science Department, Carnegie
More informationing a minimal set of layers, each describing a coherent motion from the scene, which yield a complete description of motion when superposed. Jepson an
The Structure of Occlusion in Fourier Space S. S. Beauchemin Dept. of Computer Science The University of Western Ontario London, Canada N6A 5B7 e-mail: beau@csd.uwo.ca J. L. Barron Dept. of Computer Science
More informationControllability and Observability: Tools for Kalman Filter Design
Controllability and Observability: Tools for Kalman Filter Design B Southall zy, B F Buxton y and J A Marchant z z Silsoe Research Insitute, Wrest Park, Silsoe, Bedfordshire MK45 4HS, UK y Department of
More informationConvergence Properties of Curvature Scale Space Representations
Convergence Properties of Curvature Scale Space Representations Farzin Mokhtarian Department of Electronic and Electrical Engineering University of Surrey Guildford, Surrey GU2 5XH Email: F.Mokhtarian@ee.surrey.ac.uk
More informationCover page. : On-line damage identication using model based orthonormal. functions. Author : Raymond A. de Callafon
Cover page Title : On-line damage identication using model based orthonormal functions Author : Raymond A. de Callafon ABSTRACT In this paper, a new on-line damage identication method is proposed for monitoring
More informationDegeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations
Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations Lihi Zelnik-Manor Michal Irani Dept. of Computer Science and Applied Math The Weizmann Institute of Science
More informationManaging Uncertainty
Managing Uncertainty Bayesian Linear Regression and Kalman Filter December 4, 2017 Objectives The goal of this lab is multiple: 1. First it is a reminder of some central elementary notions of Bayesian
More informationComparison of DDE and ETDGE for. Time-Varying Delay Estimation. H. C. So. Department of Electronic Engineering, City University of Hong Kong
Comparison of DDE and ETDGE for Time-Varying Delay Estimation H. C. So Department of Electronic Engineering, City University of Hong Kong Tat Chee Avenue, Kowloon, Hong Kong Email : hcso@ee.cityu.edu.hk
More informationε ε
The 8th International Conference on Computer Vision, July, Vancouver, Canada, Vol., pp. 86{9. Motion Segmentation by Subspace Separation and Model Selection Kenichi Kanatani Department of Information Technology,
More informationDensity Propagation for Continuous Temporal Chains Generative and Discriminative Models
$ Technical Report, University of Toronto, CSRG-501, October 2004 Density Propagation for Continuous Temporal Chains Generative and Discriminative Models Cristian Sminchisescu and Allan Jepson Department
More informationROYAL INSTITUTE OF TECHNOLOGY KUNGL TEKNISKA HÖGSKOLAN. Department of Signals, Sensors & Systems
The Evil of Supereciency P. Stoica B. Ottersten To appear as a Fast Communication in Signal Processing IR-S3-SB-9633 ROYAL INSTITUTE OF TECHNOLOGY Department of Signals, Sensors & Systems Signal Processing
More informationImproved Kalman Filter Initialisation using Neurofuzzy Estimation
Improved Kalman Filter Initialisation using Neurofuzzy Estimation J. M. Roberts, D. J. Mills, D. Charnley and C. J. Harris Introduction It is traditional to initialise Kalman filters and extended Kalman
More informationUniversity oftoronto, Toronto, Ontario M5S 3H5. we eliminate the need to estimate the scale of the covariance
Removal of Translation Bias when using Subspace Methods W. James MacLean Department of Computer Science, University oftoronto, Toronto, Ontario M5S 3H5 maclean@vis.toronto.edu Abstract Given estimates
More informationNONUNIFORM SAMPLING FOR DETECTION OF ABRUPT CHANGES*
CIRCUITS SYSTEMS SIGNAL PROCESSING c Birkhäuser Boston (2003) VOL. 22, NO. 4,2003, PP. 395 404 NONUNIFORM SAMPLING FOR DETECTION OF ABRUPT CHANGES* Feza Kerestecioğlu 1,2 and Sezai Tokat 1,3 Abstract.
More informationAffine Structure From Motion
EECS43-Advanced Computer Vision Notes Series 9 Affine Structure From Motion Ying Wu Electrical Engineering & Computer Science Northwestern University Evanston, IL 68 yingwu@ece.northwestern.edu Contents
More informationContinuous State MRF s
EE64 Digital Image Processing II: Purdue University VISE - December 4, Continuous State MRF s Topics to be covered: Quadratic functions Non-Convex functions Continuous MAP estimation Convex functions EE64
More informationRobust Motion Segmentation by Spectral Clustering
Robust Motion Segmentation by Spectral Clustering Hongbin Wang and Phil F. Culverhouse Centre for Robotics Intelligent Systems University of Plymouth Plymouth, PL4 8AA, UK {hongbin.wang, P.Culverhouse}@plymouth.ac.uk
More informationCONDENSATION Conditional Density Propagation for Visual Tracking
CONDENSATION Conditional Density Propagation for Visual Tracking Michael Isard and Andrew Blake Presented by Neil Alldrin Department of Computer Science & Engineering University of California, San Diego
More informationFigure : Learning the dynamics of juggling. Three motion classes, emerging from dynamical learning, turn out to correspond accurately to ballistic mot
Learning multi-class dynamics A. Blake, B. North and M. Isard Department of Engineering Science, University of Oxford, Oxford OX 3PJ, UK. Web: http://www.robots.ox.ac.uk/vdg/ Abstract Standard techniques
More informationIntroduction to motion correspondence
Introduction to motion correspondence 1 IPAM - UCLA July 24, 2013 Iasonas Kokkinos Center for Visual Computing Ecole Centrale Paris / INRIA Saclay Why estimate visual motion? 2 Tracking Segmentation Structure
More informationIn: Proc. BENELEARN-98, 8th Belgian-Dutch Conference on Machine Learning, pp 9-46, 998 Linear Quadratic Regulation using Reinforcement Learning Stephan ten Hagen? and Ben Krose Department of Mathematics,
More informationFilter for Car Tracking Based on Acceleration and Steering Angle
Filter for Car Tracking Based on Acceleration and Steering Angle Conference or Workshop Item Accepted Version Maybank, S.J., Worrall, A.D. and Sullivan, G.D. (1996) Filter for Car Tracking Based on Acceleration
More informationSegmentation of Dynamic Scenes from the Multibody Fundamental Matrix
ECCV Workshop on Vision and Modeling of Dynamic Scenes, Copenhagen, Denmark, May 2002 Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Dept of EECS, UC Berkeley Berkeley,
More informationAverage Reward Parameters
Simulation-Based Optimization of Markov Reward Processes: Implementation Issues Peter Marbach 2 John N. Tsitsiklis 3 Abstract We consider discrete time, nite state space Markov reward processes which depend
More informationChapter 7 Interconnected Systems and Feedback: Well-Posedness, Stability, and Performance 7. Introduction Feedback control is a powerful approach to o
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 7 Interconnected
More informationsize within a local area. Using the image as a matched lter, a nite number of scales are searched within a local window to nd the wavelet coecients th
In Proceeding of the 3rd International Workshop on Digital Mammography Chicago, U.S.A. 1996, pp. 447-450 Segmentation of Masses Using Continuous Scale Representations Andrew Laine a, Walter Huda b, Dongwei
More informationTime Series Prediction by Kalman Smoother with Cross-Validated Noise Density
Time Series Prediction by Kalman Smoother with Cross-Validated Noise Density Simo Särkkä E-mail: simo.sarkka@hut.fi Aki Vehtari E-mail: aki.vehtari@hut.fi Jouko Lampinen E-mail: jouko.lampinen@hut.fi Abstract
More informationPerformance Comparison of Two Implementations of the Leaky. LMS Adaptive Filter. Scott C. Douglas. University of Utah. Salt Lake City, Utah 84112
Performance Comparison of Two Implementations of the Leaky LMS Adaptive Filter Scott C. Douglas Department of Electrical Engineering University of Utah Salt Lake City, Utah 8411 Abstract{ The leaky LMS
More informationDirect estimation of ane image deformations using visual. front-end operations with automatic scale selection. Tony Lindeberg
Proc. 5th International Conference on Computer Vision, (Cambridge, MA), June 1995, pages 134{141. Direct estimation of ane image deformations using visual front-end operations with automatic scale selection
More informationSTONY BROOK UNIVERSITY. CEAS Technical Report 829
1 STONY BROOK UNIVERSITY CEAS Technical Report 829 Variable and Multiple Target Tracking by Particle Filtering and Maximum Likelihood Monte Carlo Method Jaechan Lim January 4, 2006 2 Abstract In most applications
More informationThe recovery of motion information from visual input is an important task for both natural
MIT Media Laboratory Vision and Modeling Technical Report 65. Computing Optical Flow Distributions Using Spatio-temporal Filters Eero P. Simoncelli y and Edward H. Adelson z Vision and Modeling Group,
More informationy(n) Time Series Data
Recurrent SOM with Local Linear Models in Time Series Prediction Timo Koskela, Markus Varsta, Jukka Heikkonen, and Kimmo Kaski Helsinki University of Technology Laboratory of Computational Engineering
More informationDetermining the Translational Speed of a Camera from Time-Varying Optical Flow
Determining the Translational Speed of a Camera from Time-Varying Optical Flow Anton van den Hengel, Wojciech Chojnacki, and Michael J. Brooks School of Computer Science, Adelaide University, SA 5005,
More informationMixture Models and EM
Mixture Models and EM Goal: Introduction to probabilistic mixture models and the expectationmaximization (EM) algorithm. Motivation: simultaneous fitting of multiple model instances unsupervised clustering
More informationoutput dimension input dimension Gaussian evidence Gaussian Gaussian evidence evidence from t +1 inputs and outputs at time t x t+2 x t-1 x t+1
To appear in M. S. Kearns, S. A. Solla, D. A. Cohn, (eds.) Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 999. Learning Nonlinear Dynamical Systems using an EM Algorithm Zoubin
More informationBUMPLESS SWITCHING CONTROLLERS. William A. Wolovich and Alan B. Arehart 1. December 27, Abstract
BUMPLESS SWITCHING CONTROLLERS William A. Wolovich and Alan B. Arehart 1 December 7, 1995 Abstract This paper outlines the design of bumpless switching controllers that can be used to stabilize MIMO plants
More informationIntroduction to Machine Learning
Introduction to Machine Learning Brown University CSCI 1950-F, Spring 2012 Prof. Erik Sudderth Lecture 25: Markov Chain Monte Carlo (MCMC) Course Review and Advanced Topics Many figures courtesy Kevin
More informationA Fast Algorithm for. Nonstationary Delay Estimation. H. C. So. Department of Electronic Engineering, City University of Hong Kong
A Fast Algorithm for Nonstationary Delay Estimation H. C. So Department of Electronic Engineering, City University of Hong Kong Tat Chee Avenue, Kowloon, Hong Kong Email : hcso@ee.cityu.edu.hk June 19,
More informationIn Situ Evaluation of Tracking Algorithms Using Time Reversed Chains
In Situ Evaluation of Tracking Algorithms Using Time Reversed Chains Hao Wu, Aswin C Sankaranarayanan and Rama Chellappa Center for Automation Research and Department of Electrical and Computer Engineering
More informationNotes on Regularization and Robust Estimation Psych 267/CS 348D/EE 365 Prof. David J. Heeger September 15, 1998
Notes on Regularization and Robust Estimation Psych 67/CS 348D/EE 365 Prof. David J. Heeger September 5, 998 Regularization. Regularization is a class of techniques that have been widely used to solve
More informationIncorporation of Time Delayed Measurements in a. Discrete-time Kalman Filter. Thomas Dall Larsen, Nils A. Andersen & Ole Ravn
Incorporation of Time Delayed Measurements in a Discrete-time Kalman Filter Thomas Dall Larsen, Nils A. Andersen & Ole Ravn Department of Automation, Technical University of Denmark Building 326, DK-2800
More informationRiccati difference equations to non linear extended Kalman filter constraints
International Journal of Scientific & Engineering Research Volume 3, Issue 12, December-2012 1 Riccati difference equations to non linear extended Kalman filter constraints Abstract Elizabeth.S 1 & Jothilakshmi.R
More informationParticle Filters for Change Detection and Shape Tracking
Particle Filters for Change Detection and Shape Tracking Namrata Vaswani School of Electrical and Computer Engineering Georgia Institute of Technology http://users.ece.gatech.edu/ namrata Change Detection
More informationThe Bias-Variance dilemma of the Monte Carlo. method. Technion - Israel Institute of Technology, Technion City, Haifa 32000, Israel
The Bias-Variance dilemma of the Monte Carlo method Zlochin Mark 1 and Yoram Baram 1 Technion - Israel Institute of Technology, Technion City, Haifa 32000, Israel fzmark,baramg@cs.technion.ac.il Abstract.
More informationTracking Human Heads Based on Interaction between Hypotheses with Certainty
Proc. of The 13th Scandinavian Conference on Image Analysis (SCIA2003), (J. Bigun and T. Gustavsson eds.: Image Analysis, LNCS Vol. 2749, Springer), pp. 617 624, 2003. Tracking Human Heads Based on Interaction
More informationA Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer. Christian{Albrechts{Universitat zu Kiel
A Novel Approach to the 2D Analytic Signal? Thomas Bulow and Gerald Sommer Christian{Albrechts{Universitat zu Kiel Institute of Computer Science, Cognitive Systems Preuerstrae 1{9, 24105 Kiel Tel:+49 431
More informationState estimation of linear dynamic system with unknown input and uncertain observation using dynamic programming
Control and Cybernetics vol. 35 (2006) No. 4 State estimation of linear dynamic system with unknown input and uncertain observation using dynamic programming by Dariusz Janczak and Yuri Grishin Department
More informationAn Adaptive LQG Combined With the MRAS Based LFFC for Motion Control Systems
Journal of Automation Control Engineering Vol 3 No 2 April 2015 An Adaptive LQG Combined With the MRAS Based LFFC for Motion Control Systems Nguyen Duy Cuong Nguyen Van Lanh Gia Thi Dinh Electronics Faculty
More information1 Introduction Independent component analysis (ICA) [10] is a statistical technique whose main applications are blind source separation, blind deconvo
The Fixed-Point Algorithm and Maximum Likelihood Estimation for Independent Component Analysis Aapo Hyvarinen Helsinki University of Technology Laboratory of Computer and Information Science P.O.Box 5400,
More informationPose estimation from point and line correspondences
Pose estimation from point and line correspondences Giorgio Panin October 17, 008 1 Problem formulation Estimate (in a LSE sense) the pose of an object from N correspondences between known object points
More informationAuxiliary signal design for failure detection in uncertain systems
Auxiliary signal design for failure detection in uncertain systems R. Nikoukhah, S. L. Campbell and F. Delebecque Abstract An auxiliary signal is an input signal that enhances the identifiability of a
More informationbelow, kernel PCA Eigenvectors, and linear combinations thereof. For the cases where the pre-image does exist, we can provide a means of constructing
Kernel PCA Pattern Reconstruction via Approximate Pre-Images Bernhard Scholkopf, Sebastian Mika, Alex Smola, Gunnar Ratsch, & Klaus-Robert Muller GMD FIRST, Rudower Chaussee 5, 12489 Berlin, Germany fbs,
More informationConditions for Suboptimal Filter Stability in SLAM
Conditions for Suboptimal Filter Stability in SLAM Teresa Vidal-Calleja, Juan Andrade-Cetto and Alberto Sanfeliu Institut de Robòtica i Informàtica Industrial, UPC-CSIC Llorens Artigas -, Barcelona, Spain
More informationDeformation and Viewpoint Invariant Color Histograms
1 Deformation and Viewpoint Invariant Histograms Justin Domke and Yiannis Aloimonos Computer Vision Laboratory, Department of Computer Science University of Maryland College Park, MD 274, USA domke@cs.umd.edu,
More informationSimultaneous Multi-frame MAP Super-Resolution Video Enhancement using Spatio-temporal Priors
Simultaneous Multi-frame MAP Super-Resolution Video Enhancement using Spatio-temporal Priors Sean Borman and Robert L. Stevenson Department of Electrical Engineering, University of Notre Dame Notre Dame,
More informationFeature Extraction with Weighted Samples Based on Independent Component Analysis
Feature Extraction with Weighted Samples Based on Independent Component Analysis Nojun Kwak Samsung Electronics, Suwon P.O. Box 105, Suwon-Si, Gyeonggi-Do, KOREA 442-742, nojunk@ieee.org, WWW home page:
More informationKalman Filters with Uncompensated Biases
Kalman Filters with Uncompensated Biases Renato Zanetti he Charles Stark Draper Laboratory, Houston, exas, 77058 Robert H. Bishop Marquette University, Milwaukee, WI 53201 I. INRODUCION An underlying assumption
More informationThe Kalman Filter. Data Assimilation & Inverse Problems from Weather Forecasting to Neuroscience. Sarah Dance
The Kalman Filter Data Assimilation & Inverse Problems from Weather Forecasting to Neuroscience Sarah Dance School of Mathematical and Physical Sciences, University of Reading s.l.dance@reading.ac.uk July
More informationWINDS FROM METEOSAT AND GMS WV-IMAGERY USING VARIATIONAL TECHNIQUES. M. Rohn. Institut für Meteorologie, Freie Universität Berlin Berlin, F.R.G.
WINDS FROM METEOSAT AND GMS WV-IMAGERY USING VARIATIONAL TECHNIQUES M. Rohn Institut für Meteorologie, Freie Universität Berlin 14195 Berlin, F.R.G. ABSTRACT A new method is described where motion analysis
More informationSubmitted to Electronics Letters. Indexing terms: Signal Processing, Adaptive Filters. The Combined LMS/F Algorithm Shao-Jen Lim and John G. Harris Co
Submitted to Electronics Letters. Indexing terms: Signal Processing, Adaptive Filters. The Combined LMS/F Algorithm Shao-Jen Lim and John G. Harris Computational Neuro-Engineering Laboratory University
More informationTwo-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix
Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Stefano Soatto Shankar Sastry Department of EECS, UC Berkeley Department of Computer Sciences, UCLA 30 Cory Hall,
More informationA Factorization Method for 3D Multi-body Motion Estimation and Segmentation
1 A Factorization Method for 3D Multi-body Motion Estimation and Segmentation René Vidal Department of EECS University of California Berkeley CA 94710 rvidal@eecs.berkeley.edu Stefano Soatto Dept. of Computer
More informationLearning Gaussian Process Models from Uncertain Data
Learning Gaussian Process Models from Uncertain Data Patrick Dallaire, Camille Besse, and Brahim Chaib-draa DAMAS Laboratory, Computer Science & Software Engineering Department, Laval University, Canada
More informationSquare-Root Algorithms of Recursive Least-Squares Wiener Estimators in Linear Discrete-Time Stochastic Systems
Proceedings of the 17th World Congress The International Federation of Automatic Control Square-Root Algorithms of Recursive Least-Squares Wiener Estimators in Linear Discrete-Time Stochastic Systems Seiichi
More informationESTIMATOR STABILITY ANALYSIS IN SLAM. Teresa Vidal-Calleja, Juan Andrade-Cetto, Alberto Sanfeliu
ESTIMATOR STABILITY ANALYSIS IN SLAM Teresa Vidal-Calleja, Juan Andrade-Cetto, Alberto Sanfeliu Institut de Robtica i Informtica Industrial, UPC-CSIC Llorens Artigas 4-6, Barcelona, 88 Spain {tvidal, cetto,
More informationMark J. L. Orr 1. Advanced Robotics Research Ltd. University Road. Salford M5 4PP. England. John Hallam and Robert B. Fisher
Fusion Through Interpretation Mark J. L. Orr 1 Advanced Robotics Research Ltd. University Road Salford M5 4PP England (tel.: +44 61 745 7384 e-mail: mjo@arrc.salf.ac.uk) John Hallam and Robert B. Fisher
More informationThe Discrete Kalman Filtering of a Class of Dynamic Multiscale Systems
668 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL 49, NO 10, OCTOBER 2002 The Discrete Kalman Filtering of a Class of Dynamic Multiscale Systems Lei Zhang, Quan
More informationFiltering in a Unit Quaternion Space for Model-Based Object Tracking
Filtering in a Unit Quaternion Space for Model-Based Object Tracking Aleš Ude Kawato Dynamic Brain Project, Exploratory Research for Advanced Technology, Japan Science and Technology Corporation, - Hikaridai
More informationAn Invariance Property of the Generalized Likelihood Ratio Test
352 IEEE SIGNAL PROCESSING LETTERS, VOL. 10, NO. 12, DECEMBER 2003 An Invariance Property of the Generalized Likelihood Ratio Test Steven M. Kay, Fellow, IEEE, and Joseph R. Gabriel, Member, IEEE Abstract
More informationFUNDAMENTAL FILTERING LIMITATIONS IN LINEAR NON-GAUSSIAN SYSTEMS
FUNDAMENTAL FILTERING LIMITATIONS IN LINEAR NON-GAUSSIAN SYSTEMS Gustaf Hendeby Fredrik Gustafsson Division of Automatic Control Department of Electrical Engineering, Linköpings universitet, SE-58 83 Linköping,
More informationSliding Window Test vs. Single Time Test for Track-to-Track Association
Sliding Window Test vs. Single Time Test for Track-to-Track Association Xin Tian Dept. of Electrical and Computer Engineering University of Connecticut Storrs, CT 06269-257, U.S.A. Email: xin.tian@engr.uconn.edu
More informationPrediction, filtering and smoothing using LSCR: State estimation algorithms with guaranteed confidence sets
2 5th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 2-5, 2 Prediction, filtering and smoothing using LSCR: State estimation algorithms with
More information1 Introduction Robust statistics methods provide tools for statistics problems in which underlying assumptions are inexact. A robust procedure should
Pattern Recognition, Vol.29, No.1, pages 159-166, 1996. Robustizing Robust M-Estimation Using Deterministic Annealing S. Z. Li School of Electrical and Electronic Engineering Nanyang Technological University
More informationRobotics 2 Target Tracking. Kai Arras, Cyrill Stachniss, Maren Bennewitz, Wolfram Burgard
Robotics 2 Target Tracking Kai Arras, Cyrill Stachniss, Maren Bennewitz, Wolfram Burgard Slides by Kai Arras, Gian Diego Tipaldi, v.1.1, Jan 2012 Chapter Contents Target Tracking Overview Applications
More informationAn Adaptive Bayesian Network for Low-Level Image Processing
An Adaptive Bayesian Network for Low-Level Image Processing S P Luttrell Defence Research Agency, Malvern, Worcs, WR14 3PS, UK. I. INTRODUCTION Probability calculus, based on the axioms of inference, Cox
More informationImage Analysis. Feature extraction: corners and blobs
Image Analysis Feature extraction: corners and blobs Christophoros Nikou cnikou@cs.uoi.gr Images taken from: Computer Vision course by Svetlana Lazebnik, University of North Carolina at Chapel Hill (http://www.cs.unc.edu/~lazebnik/spring10/).
More informationAbnormal Activity Detection and Tracking Namrata Vaswani Dept. of Electrical and Computer Engineering Iowa State University
Abnormal Activity Detection and Tracking Namrata Vaswani Dept. of Electrical and Computer Engineering Iowa State University Abnormal Activity Detection and Tracking 1 The Problem Goal: To track activities
More informationSliding Window Recursive Quadratic Optimization with Variable Regularization
11 American Control Conference on O'Farrell Street, San Francisco, CA, USA June 29 - July 1, 11 Sliding Window Recursive Quadratic Optimization with Variable Regularization Jesse B. Hoagg, Asad A. Ali,
More informationTHE PROBLEMS OF ROBUST LPC PARAMETRIZATION FOR. Petr Pollak & Pavel Sovka. Czech Technical University of Prague
THE PROBLEMS OF ROBUST LPC PARAMETRIZATION FOR SPEECH CODING Petr Polla & Pavel Sova Czech Technical University of Prague CVUT FEL K, 66 7 Praha 6, Czech Republic E-mail: polla@noel.feld.cvut.cz Abstract
More informationCS4495/6495 Introduction to Computer Vision. 6B-L1 Dense flow: Brightness constraint
CS4495/6495 Introduction to Computer Vision 6B-L1 Dense flow: Brightness constraint Motion estimation techniques Feature-based methods Direct, dense methods Motion estimation techniques Direct, dense methods
More informationN.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a
WHEN IS A MAP POISSON N.G.Bean, D.A.Green and P.G.Taylor Department of Applied Mathematics University of Adelaide Adelaide 55 Abstract In a recent paper, Olivier and Walrand (994) claimed that the departure
More informationNon Linear Latent Variable Models
Non Linear Latent Variable Models Neil Lawrence GPRS 14th February 2014 Outline Nonlinear Latent Variable Models Extensions Outline Nonlinear Latent Variable Models Extensions Non-Linear Latent Variable
More informationParticle Filter Track Before Detect Algorithms
Particle Filter Track Before Detect Algorithms Theory and Applications Y. Boers and J.N. Driessen JRS-PE-FAA THALES NEDERLAND Hengelo The Netherlands Email: {yvo.boers,hans.driessen}@nl.thalesgroup.com
More informationThe optimal filtering of a class of dynamic multiscale systems
Science in China Ser. F Information Sciences 2004 Vol.47 No.4 50 57 50 he optimal filtering of a class of dynamic multiscale systems PAN Quan, ZHANG Lei, CUI Peiling & ZHANG Hongcai Department of Automatic
More informationNON-LINEAR NOISE ADAPTIVE KALMAN FILTERING VIA VARIATIONAL BAYES
2013 IEEE INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING NON-LINEAR NOISE ADAPTIVE KALMAN FILTERING VIA VARIATIONAL BAYES Simo Särä Aalto University, 02150 Espoo, Finland Jouni Hartiainen
More informationStructural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems
Structural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems M. ISAL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, sc. C, 1-3, 08038 arcelona
More informationVideo and Motion Analysis Computer Vision Carnegie Mellon University (Kris Kitani)
Video and Motion Analysis 16-385 Computer Vision Carnegie Mellon University (Kris Kitani) Optical flow used for feature tracking on a drone Interpolated optical flow used for super slow-mo optical flow
More informationDistributed estimation in sensor networks
in sensor networks A. Benavoli Dpt. di Sistemi e Informatica Università di Firenze, Italy. e-mail: benavoli@dsi.unifi.it Outline 1 An introduction to 2 3 An introduction to An introduction to In recent
More informationAdaptive linear quadratic control using policy. iteration. Steven J. Bradtke. University of Massachusetts.
Adaptive linear quadratic control using policy iteration Steven J. Bradtke Computer Science Department University of Massachusetts Amherst, MA 01003 bradtke@cs.umass.edu B. Erik Ydstie Department of Chemical
More informationExact Consensus Controllability of Multi-agent Linear Systems
Exact Consensus Controllability of Multi-agent Linear Systems M. ISAEL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, Esc. C, 1-3, 08038 arcelona SPAIN maria.isabel.garcia@upc.edu
More informationDiscriminative Direction for Kernel Classifiers
Discriminative Direction for Kernel Classifiers Polina Golland Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139 polina@ai.mit.edu Abstract In many scientific and engineering
More informationGaussian Processes for Regression. Carl Edward Rasmussen. Department of Computer Science. Toronto, ONT, M5S 1A4, Canada.
In Advances in Neural Information Processing Systems 8 eds. D. S. Touretzky, M. C. Mozer, M. E. Hasselmo, MIT Press, 1996. Gaussian Processes for Regression Christopher K. I. Williams Neural Computing
More informationEM-algorithm for Training of State-space Models with Application to Time Series Prediction
EM-algorithm for Training of State-space Models with Application to Time Series Prediction Elia Liitiäinen, Nima Reyhani and Amaury Lendasse Helsinki University of Technology - Neural Networks Research
More information