DOCSLIB.ORG

Discrete Hidden Markov Models with Application to Isolated User- V T T P U B L I C a T I O N S Dependent Hand Gesture Recognition

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Discrete Hidden Markov Models with Application to Isolated User- V T T P U B L I C a T I O N S Dependent Hand Gesture Recognition 4 4 9 V T T P U B L I C A T I O N S VTT PUBLICATIONS 428 Kuusisto, Arto. Safety management systems – Audit tools and reliability of auditing. VTT PUBLICATIONS 449 2000. 175 p. + app. 48 p. 429 Olin, Markus, Pasanen, Antti, Ojaniemi, Ulla, Mroueh, Ulla-Maija, Walavaara, Marko, Larjava, Kari, Vasara, Petri, Lobbas, Pia & Lillandt, Katja. Implementation of IPPC- Vesa-Matti Mäntylä directive. Development of a new generation methodology and a case study in pulp industry. 2000. 81 p. 430 Virkajärvi, Ilkka. Feasibility of continuous main fermentation of beer using im- mobilized yeast. 2001. 87 p. + app. 50 p. Discrete hidden Markov models 432 Alfthan, Kaija. Structural stability and binding properties of soluble and membrane- anchored recombinant antibodies. 2001. 106 p. + app. 39 p. with application to isolated 433 Lauro, Marianna. α-Amylolysis of barley starch. 2001. 45 p. + app. 40 p. 434 Ronkainen, Helena. Tribological properties of hydrogenated and hydrogen-free Discrete hidden Markov models with application to isolated user-dependent hand gesture recognition user-dependent hand gesture diamond-like carbon coatings. 2001. 51 p. + app. 72 p. 436 Paajanen, Mika. The cellular polypropylene electret material – electromechanical properties. 2001. 66 p. + app. 50 p. recognition 437 Ikonen, Kari. Large inelastic deformation analysis of steel pressure vessels at high temperature. 2001. 141 p. + app. 15 p. 438 Pasanen, Antti. Phenomenon-Driven Process Design methodology. Computer V T T P u b l i c a t i o n s implementation and test usage. 2001. 140 p. + app. 26 p. 439 Ahonen, Petri. Aerosol production and crystallization of titanium dioxide from metal alkoxide droplets. 2001. 55 p. + app. 62 p. V T T P u b l i c a t i o n s 440 Niskanen, Pirjo. Finnish universities and the EU Framework Programme – Towards a new phase. Towards a new phase. 2001. 86 p. + app. 20 p. 441 Södergård, Caj (ed.). Integrated news publishing – Technology and user experiences. Report of the IMU2 project. 2001. 210 p. + app. 25 p. V T T P u b l i c a t i o n s 442 Moilanen, Markus. Management framework of distributed software objects and components. 2001. 153 p. + app. 45 p. 443 Pakanen, Jouko. Demonstrating a fault diagnostic method in an automated, computer- V T T P u b l i c a t i o n s controlled HVAC process. 2001. 45 p. + app. 2 p. 444 Holappa, Jarkko. Security threats and requirements for Java-based applications in the P networked home environment. 2001. 116 p. V T T P u b l i c a t i o n s 445 Vierimaa, Matias, Ronkainen, Jussi, Salo, Outi, Sandelin, Toni, Tihinen, Maarit, Freimut, Bernd & Parviainen, Päivi. MIKKO Handbook. Comprehensive collection and utilisation of software measurement data. 2001. 227 p. + app. 53 p. V T T P u b l i c a t i o n s 446 Holt, Erika E. Early age autogenous shrinkage of concrete. 2001. 184 p. + app. 9 p. 447 Rämä, Pirkko. Effects of weather-controlled variable message signing on driver behaviour. 2001. 55 p + app. 50 p. V T T P u b l i c a t i o n s 448 Kaksonen, Rauli. A Functional Method for Assessing Protocol Implementation Security. 2001. 128 p. + app. 15 p. 449 Mäntylä, Vesa-Matti. Discrete hidden Markov models with application to isolated user- V T T P u b l i c a t i o n s dependent hand gesture recognition. 2001. 104 p. Tätä julkaisua myy Denna publikation säljs av This publication is available from V T T P u b l i c a t i o n s VTT TIETOPALVELU VTT INFORMATIONSTJÄNST VTT INFORMATION SERVICE PL 2000 PB 2000 P.O.Box 2000 02044 VTT 02044 VTT FIN–02044 VTT, Finland Puh. (09) 456 4404 Tel. (09) 456 4404 Phone internat. + 358 9 456 4404 Faksi (09) 456 4374 Fax (09) 456 4374 Fax + 358 9 456 4374 ISBN 951–38–5875–8 (soft back ed.) ISBN 951–38–5876–6 (URL: http://www.inf.vtt.fi/pdf/) ISSN 1235–0621 (soft back ed.) ISSN 1455–0849 (URL: http://www.inf.vtt.fi/pdf/) TECHNICAL RESEARCH CENTRE OF FINLAND ESPOO 2001 VTT PUBLICATIONS 449 Discrete hidden Markov models with application to isolated user-dependent hand gesture recognition Vesa-Matti Mäntylä VTT Electronics TECHNICAL RESEARCH CENTRE OF FINLAND ESPOO 2001 ISBN 951–38–5875–8 (soft back ed.) ISSN 1235–0621 (soft back ed.) ISBN 951–38–5876–6 (URL:http://www.inf.vtt.fi/pdf/) ISSN 1455–0849 (URL:http://www.inf.vtt.fi/pdf/ ) Copyright © Valtion teknillinen tutkimuskeskus (VTT) 2001 JULKAISIJA – UTGIVARE – PUBLISHER Valtion teknillinen tutkimuskeskus (VTT), Vuorimiehentie 5, PL 2000, 02044 VTT puh. vaihde (09) 4561, faksi (09) 456 4374 Statens tekniska forskningscentral (VTT), Bergsmansvägen 5, PB 2000, 02044 VTT tel. växel (09) 4561, fax (09) 456 4374 Technical Research Centre of Finland (VTT), Vuorimiehentie 5, P.O.Box 2000, FIN–02044 VTT, Finland phone internat. + 358 9 4561, fax + 358 9 456 4374 VTT Elektroniikka, Verkkoteknologiat, Kaitoväylä 1, PL 1100, 90571 OULU puh. vaihde (08) 551 2111, faksi (08) 551 2320 VTT Elektronik, Nätteknologier, Kaitoväylä 1, PB 1100, 90571 ULEÅBORG tel. växel (08) 551 2111, fax (08) 551 2320 VTT Electronics, Networking Research, Kaitoväylä 1, P.O.Box 1100, FIN–90571 OULU, Finland phone internat. + 358 8 551 2111, fax + 358 8 551 2320 Otamedia Oy, Espoo 2001 Mäntylä, Vesa-Matti. Discrete hidden Markov models with application to isolated user-dependent hand gesture recognition. Espoo 2001. Technical Research Centre of Finland, VTT Publications 449. 104 p. Keywords discrete hidden Markov models, hand gesture recognition, stochastic processes, discrete Markov chains, Bayes classification Abstract The development of computers and the theory of doubly stochastic processes, have led to a wide variety of applications of the hidden Markov models (HMMs). Due to their computational efficiency, discrete HMMs are often favoured. HMMs offer a flexible way of presenting events with temporal and dynamical variations. Both of these matters are present in hand gestures, which are of increasing interest in the research of human-computer interaction (HCI) technologies. The exploitation of human-to-human communication modalities has become actual in HCI applications. It is even expected, that the existing HCI techniques become a bottleneck in the effective utilization of the available information flow. In this work it is given mathematically uniform presentation of the theory of discrete hidden Markov models. Especially, three basic problems, scoring, decoding and estimation, are considered. To solve these problems it is presented forward and backward algorithms, Viterbi algorithm, and Baum-Welch algorithms, respectively. The second purpose of this work is to present an application of discrete HMMs to recognize a collection of hand gestures from measured acceleration signals. In pattern recognition terms, it is created an isolated user-dependent recognition system. In the light of recognition results, the effect of several matters to the optimality of the recognizer is analyzed. 3 Preface The main ideas for this thesis have been induced by the work done in the Networking Research area of VTT Electronics, during last two years. This work has been submitted to the University of Oulu, Faculty of Natural Sci- ences, as part of the qualification for the degree of Licenciate of Philosophy. I want to express my gratitude to VTT Electronics for making possible the research and writing processes. Special thanks to Tapio Peltola, who has given valuable help concerning the theory of hidden Markov models and especially their practical implementa- tion. I would also like to thank Prof. Tapio Sepp¨anen, from the University of Oulu, for the valuable discussions about pattern recognition matters con- cerning the development of the recognition system. During the research and writing processes Esa Tuulari, Pekka Ruuska and Tapio Frantti have given encouraging comments, also. For this, special thanks to them. I would like to thank the supervisors of this thesis, PhD Erkki Laitinen from the Department of Mathematical Sciences of the University of Oulu and Prof. Petri M¨ah¨onen from VTT Electronics, for their valuable comments on writing this thesis. This work has been funded partially by Tekes, Technical Development Cen- tre Finland in the scope of the ITEA 99002 BEYOND project. In this con- nection, I want to express thanks to Mikko Kerttula. Oulu, August 2000 Vesa-Matti M¨antyl¨a 4 Contents Abstract 3 Preface 4 1 Introduction 7 1.1 Historical perspective . ................. 7 1.2 Motivation of hand gesture recognition . .......... 8 1.3 Pattern recognition concepts . .......... 9 1.4 Scopes of the research . ................. 11 2 Stochastic processes and discrete Markov chains 13 2.1 Probabilistic prerequisites . ................. 13 2.2 Markov chains ........................ 17 3 Discrete hidden Markov models 35 3.1 Formal definition and three basic problems . 35 3.2 Auxiliary properties of the conditional distributions . 39 3.3 Evaluation problem and forward-backward algorithm . 41 3.4 Decoding with smoothing and the Viterbi algorithm . 46 3.5 Parameter estimation and Baum-Welch algorithm . 54 3.6 Reestimates in forward and backward variables . 61 3.7 Implementation issues for HMMs . .......... 70 3.7.1 Scaling . ................. 70 3.7.2 Multiple observation sequences .......... 71 5 4 Bayes classification and context-dependency 73 5 HMM recognition system 77 5.1 Measurements ........................ 77 5.2 Preprocessing ........................ 78 5.3 Feature extraction . ................. 78 5.4 Vector quantization . ................. 81 5.5 Choice of the model parameters . .......... 83 5.6 Implementation . ................. 84 6 Results 86 7 Conclusions 96 References 100 6 1 Introduction 1.1 Historical perspective The roots of the theory of the hidden Markov models (HMMs) can be traced to the 1950s, when statisticians were studying the problem of characteriz- ing random processes for which the incomplete observations were avail- able.
Load more

Recommended publications
  • Multivariate Poisson Hidden Markov Models for Analysis of Spatial Counts
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by University of Saskatchewan's Research Archive MULTIVARIATE POISSON HIDDEN MARKOV MODELS FOR ANALYSIS OF SPATIAL COUNTS A Thesis Submitted to the Faculty of Graduate Studies and Research in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in the Department of Mathematics and Statistics University of Saskatchewan, Saskatoon, SK, Canada by Chandima Piyadharshani Karunanayake @Copyright Chandima Piyadharshani Karunanayake, June 2007. All rights Reserved. PERMISSION TO USE The author has agreed that the libraries of this University may provide the thesis freely available for inspection. Moreover, the author has agreed that permission for copying of the thesis in any manner, entirely or in part, for scholarly purposes may be granted by the Professor or Professors who supervised my thesis work or in their absence, by the Head of the Department of Mathematics and Statistics or the Dean of the College in which the thesis work was done. It is understood that any copying or publication or use of the thesis or parts thereof for finanancial gain shall not be allowed without my written permission. It is also understood that due recognition shall be given to the author and to the University of Saskatchewan in any scholarly use which may be made of any material in this thesis. Requests for permission to copy or to make other use of any material in the thesis should be addressed to: Head Department of Mathematics and Statistics University of Saskatchewan 106, Wiggins Road Saskatoon, Saskatchewan Canada, S7N 5E6 i ABSTRACT Multivariate count data are found in a variety of fields.
    [Show full text]
  • Regime Heteroskedasticity in Bitcoin: a Comparison of Markov Switching Models
    Munich Personal RePEc Archive Regime heteroskedasticity in Bitcoin: A comparison of Markov switching models Chappell, Daniel Birkbeck College, University of London 28 September 2018 Online at https://mpra.ub.uni-muenchen.de/90682/ MPRA Paper No. 90682, posted 24 Dec 2018 06:38 UTC Regime heteroskedasticity in Bitcoin: A comparison of Markov switching models Daniel R. Chappell Department of Economics, Mathematics and Statistics Birkbeck College, University of London [email protected] 28th September 2018 Abstract Markov regime-switching (MRS) models, also known as hidden Markov models (HMM), are used extensively to account for regime heteroskedasticity within the returns of financial assets. However, we believe this paper to be one of the first to apply such methodology to the time series of cryptocurrencies. In light of Moln´arand Thies (2018) demonstrating that the price data of Bitcoin contained seven distinct volatility regimes, we will fit a sample of Bitcoin returns with six m-state MRS estimations, with m ∈ {2,..., 7}. Our aim is to identify the optimal number of states for modelling the regime heteroskedasticity in the price data of Bitcoin. Goodness-of-fit will be judged using three information criteria, namely: Bayesian (BIC); Hannan-Quinn (HQ); and Akaike (AIC). We determined that the restricted 5-state model generated the optimal estima- tion for the sample. In addition, we found evidence of volatility clustering, volatility jumps and asymmetric volatility transitions whilst also inferring the persistence of shocks in the price data of Bitcoin. Keywords Bitcoin; Markov regime-switching; regime heteroskedasticity; volatility transitions. 1 2 List of Tables Table 1. Summary statistics for Bitcoin (23rd April 2014 to 31st May 2018) .
    [Show full text]
  • Poisson Processes Stochastic Processes
    Poisson Processes Stochastic Processes UC3M Feb. 2012 Exponential random variables A random variable T has exponential distribution with rate λ > 0 if its probability density function can been written as −λt f (t) = λe 1(0;+1)(t) We summarize the above by T ∼ exp(λ): The cumulative distribution function of a exponential random variable is −λt F (t) = P(T ≤ t) = 1 − e 1(0;+1)(t) And the tail, expectation and variance are P(T > t) = e−λt ; E[T ] = λ−1; and Var(T ) = E[T ] = λ−2 The exponential random variable has the lack of memory property P(T > t + sjT > t) = P(T > s) Exponencial races In what follows, T1;:::; Tn are independent r.v., with Ti ∼ exp(λi ). P1: min(T1;:::; Tn) ∼ exp(λ1 + ··· + λn) . P2 λ1 P(T1 < T2) = λ1 + λ2 P3: λi P(Ti = min(T1;:::; Tn)) = λ1 + ··· + λn P4: If λi = λ and Sn = T1 + ··· + Tn ∼ Γ(n; λ). That is, Sn has probability density function (λs)n−1 f (s) = λe−λs 1 (s) Sn (n − 1)! (0;+1) The Poisson Process as a renewal process Let T1; T2;::: be a sequence of i.i.d. nonnegative r.v. (interarrival times). Define the arrival times Sn = T1 + ··· + Tn if n ≥ 1 and S0 = 0: The process N(t) = maxfn : Sn ≤ tg; is called Renewal Process. If the common distribution of the times is the exponential distribution with rate λ then process is called Poisson Process of with rate λ. Lemma. N(t) ∼ Poisson(λt) and N(t + s) − N(s); t ≥ 0; is a Poisson process independent of N(s); t ≥ 0 The Poisson Process as a L´evy Process A stochastic process fX (t); t ≥ 0g is a L´evyProcess if it verifies the following properties: 1.
    [Show full text]
  • 12 : Conditional Random Fields 1 Hidden Markov Model
    10-708: Probabilistic Graphical Models 10-708, Spring 2014 12 : Conditional Random Fields Lecturer: Eric P. Xing Scribes: Qin Gao, Siheng Chen 1 Hidden Markov Model 1.1 General parametric form In hidden Markov model (HMM), we have three sets of parameters, j i transition probability matrix A : p(yt = 1jyt−1 = 1) = ai;j; initialprobabilities : p(y1) ∼ Multinomial(π1; π2; :::; πM ); i emission probabilities : p(xtjyt) ∼ Multinomial(bi;1; bi;2; :::; bi;K ): 1.2 Inference k k The inference can be done with forward algorithm which computes αt ≡ µt−1!t(k) = P (x1; :::; xt−1; xt; yt = 1) recursively by k k X i αt = p(xtjyt = 1) αt−1ai;k; (1) i k k and the backward algorithm which computes βt ≡ µt t+1(k) = P (xt+1; :::; xT jyt = 1) recursively by k X i i βt = ak;ip(xt+1jyt+1 = 1)βt+1: (2) i Another key quantity is the conditional probability of any hidden state given the entire sequence, which can be computed by the dot product of forward message and backward message by, i i i i X i;j γt = p(yt = 1jx1:T ) / αtβt = ξt ; (3) j where we define, i;j i j ξt = p(yt = 1; yt−1 = 1; x1:T ); i j / µt−1!t(yt = 1)µt t+1(yt+1 = 1)p(xt+1jyt+1)p(yt+1jyt); i j i = αtβt+1ai;jp(xt+1jyt+1 = 1): The implementation in Matlab can be vectorized by using, i Bt(i) = p(xtjyt = 1); j i A(i; j) = p(yt+1 = 1jyt = 1): 1 2 12 : Conditional Random Fields The relation of those quantities can be simply written in pseudocode as, T αt = (A αt−1): ∗ Bt; βt = A(βt+1: ∗ Bt+1); T ξt = (αt(βt+1: ∗ Bt+1) ): ∗ A; γt = αt: ∗ βt: 1.3 Learning 1.3.1 Supervised Learning The supervised learning is trivial if only we know the true state path.
    [Show full text]
  • A Stochastic Processes and Martingales
    A Stochastic Processes and Martingales A.1 Stochastic Processes Let I be either IINorIR+.Astochastic process on I with state space E is a family of E-valued random variables X = {Xt : t ∈ I}. We only consider examples where E is a Polish space. Suppose for the moment that I =IR+. A stochastic process is called cadlag if its paths t → Xt are right-continuous (a.s.) and its left limits exist at all points. In this book we assume that every stochastic process is cadlag. We say a process is continuous if its paths are continuous. The above conditions are meant to hold with probability 1 and not to hold pathwise. A.2 Filtration and Stopping Times The information available at time t is expressed by a σ-subalgebra Ft ⊂F.An {F ∈ } increasing family of σ-algebras t : t I is called a filtration.IfI =IR+, F F F we call a filtration right-continuous if t+ := s>t s = t. If not stated otherwise, we assume that all filtrations in this book are right-continuous. In many books it is also assumed that the filtration is complete, i.e., F0 contains all IIP-null sets. We do not assume this here because we want to be able to change the measure in Chapter 4. Because the changed measure and IIP will be singular, it would not be possible to extend the new measure to the whole σ-algebra F. A stochastic process X is called Ft-adapted if Xt is Ft-measurable for all t. If it is clear which filtration is used, we just call the process adapted.The {F X } natural filtration t is the smallest right-continuous filtration such that X is adapted.
    [Show full text]
  • Ergodicity, Decisions, and Partial Information
    Ergodicity, Decisions, and Partial Information Ramon van Handel Abstract In the simplest sequential decision problem for an ergodic stochastic pro- cess X, at each time n a decision un is made as a function of past observations X0,...,Xn 1, and a loss l(un,Xn) is incurred. In this setting, it is known that one may choose− (under a mild integrability assumption) a decision strategy whose path- wise time-average loss is asymptotically smaller than that of any other strategy. The corresponding problem in the case of partial information proves to be much more delicate, however: if the process X is not observable, but decisions must be based on the observation of a different process Y, the existence of pathwise optimal strategies is not guaranteed. The aim of this paper is to exhibit connections between pathwise optimal strategies and notions from ergodic theory. The sequential decision problem is developed in the general setting of an ergodic dynamical system (Ω,B,P,T) with partial information Y B. The existence of pathwise optimal strategies grounded in ⊆ two basic properties: the conditional ergodic theory of the dynamical system, and the complexity of the loss function. When the loss function is not too complex, a gen- eral sufficient condition for the existence of pathwise optimal strategies is that the dynamical system is a conditional K-automorphism relative to the past observations n n 0 T Y. If the conditional ergodicity assumption is strengthened, the complexity assumption≥ can be weakened. Several examples demonstrate the interplay between complexity and ergodicity, which does not arise in the case of full information.
    [Show full text]
  • Introduction to Stochastic Processes - Lecture Notes (With 33 Illustrations)
    Introduction to Stochastic Processes - Lecture Notes (with 33 illustrations) Gordan Žitković Department of Mathematics The University of Texas at Austin Contents 1 Probability review 4 1.1 Random variables . 4 1.2 Countable sets . 5 1.3 Discrete random variables . 5 1.4 Expectation . 7 1.5 Events and probability . 8 1.6 Dependence and independence . 9 1.7 Conditional probability . 10 1.8 Examples . 12 2 Mathematica in 15 min 15 2.1 Basic Syntax . 15 2.2 Numerical Approximation . 16 2.3 Expression Manipulation . 16 2.4 Lists and Functions . 17 2.5 Linear Algebra . 19 2.6 Predefined Constants . 20 2.7 Calculus . 20 2.8 Solving Equations . 22 2.9 Graphics . 22 2.10 Probability Distributions and Simulation . 23 2.11 Help Commands . 24 2.12 Common Mistakes . 25 3 Stochastic Processes 26 3.1 The canonical probability space . 27 3.2 Constructing the Random Walk . 28 3.3 Simulation . 29 3.3.1 Random number generation . 29 3.3.2 Simulation of Random Variables . 30 3.4 Monte Carlo Integration . 33 4 The Simple Random Walk 35 4.1 Construction . 35 4.2 The maximum . 36 1 CONTENTS 5 Generating functions 40 5.1 Definition and first properties . 40 5.2 Convolution and moments . 42 5.3 Random sums and Wald’s identity . 44 6 Random walks - advanced methods 48 6.1 Stopping times . 48 6.2 Wald’s identity II . 50 6.3 The distribution of the first hitting time T1 .......................... 52 6.3.1 A recursive formula . 52 6.3.2 Generating-function approach .
    [Show full text]
  • Particle Gibbs for Infinite Hidden Markov Models
    Particle Gibbs for Infinite Hidden Markov Models Nilesh Tripuraneni* Shixiang Gu* Hong Ge University of Cambridge University of Cambridge University of Cambridge [email protected] MPI for Intelligent Systems [email protected] [email protected] Zoubin Ghahramani University of Cambridge [email protected] Abstract Infinite Hidden Markov Models (iHMM’s) are an attractive, nonparametric gener- alization of the classical Hidden Markov Model which can automatically infer the number of hidden states in the system. However, due to the infinite-dimensional nature of the transition dynamics, performing inference in the iHMM is difficult. In this paper, we present an infinite-state Particle Gibbs (PG) algorithm to re- sample state trajectories for the iHMM. The proposed algorithm uses an efficient proposal optimized for iHMMs and leverages ancestor sampling to improve the mixing of the standard PG algorithm. Our algorithm demonstrates significant con- vergence improvements on synthetic and real world data sets. 1 Introduction Hidden Markov Models (HMM’s) are among the most widely adopted latent-variable models used to model time-series datasets in the statistics and machine learning communities. They have also been successfully applied in a variety of domains including genomics, language, and finance where sequential data naturally arises [Rabiner, 1989; Bishop, 2006]. One possible disadvantage of the finite-state space HMM framework is that one must a-priori spec- ify the number of latent states K. Standard model selection techniques can be applied to the fi- nite state-space HMM but bear a high computational overhead since they require the repetitive trainingexploration of many HMM’s of different sizes.
    [Show full text]
  • Hidden Markov Models (Particle Filtering)
    CSE 473: Artificial Intelligence Spring 2014 Hidden Markov Models & Particle Filtering Hanna Hajishirzi Many slides adapted from Dan Weld, Pieter Abbeel, Dan Klein, Stuart Russell, Andrew Moore & Luke Zettlemoyer 1 Outline § Probabilistic sequence models (and inference) § Probability and Uncertainty – Preview § Markov Chains § Hidden Markov Models § Exact Inference § Particle Filters § Applications Example § A robot move in a discrete grid § May fail to move in the desired direction with some probability § Observation from noisy sensor at each time § Is a function of robot position § Goal: Find the robot position (probability that a robot is at a specific position) § Cannot always compute this probability exactly è Approximation methods Here: Approximate a distribution by sampling 3 Hidden Markov Model § State Space Model § Hidden states: Modeled as a Markov Process P(x0), P(xk | xk-1) § Observations: ek P(ek | xk) Position of the robot P(x1|x0) x x x 0 1 … n Observed position from P(e |x ) 0 0 the sensor y0 y1 yn 4 Exact Solution: Forward Algorithm § Filtering is the inference process of finding a distribution over XT given e1 through eT : P( XT | e1:t ) § We first compute P( X1 | e1 ): § For each t from 2 to T, we have P( Xt-1 | e1:t-1 ) § Elapse time: compute P( Xt | e1:t-1 ) § Observe: compute P(Xt | e1:t-1 , et) = P( Xt | e1:t ) Approximate Inference: § Sometimes |X| is too big for exact inference § |X| may be too big to even store B(X) § E.g. when X is continuous § |X|2 may be too big to do updates § Solution: approximate inference by sampling § How robot localization works in practice 6 What is Sampling? § Goal: Approximate the original distribution: § Approximate with Gaussian distribution § Draw samples from a distribution close enough to the original distribution § Here: A general framework for a sampling method 7 Approximate Solution: Perfect Sampling Robot path till time n 1 Time 1 Time n Assume we can sample Particle 1 x0:n from the original distribution .
    [Show full text]
  • Hierarchical Dirichlet Process Hidden Markov Model for Unsupervised Bioacoustic Analysis
    Hierarchical Dirichlet Process Hidden Markov Model for Unsupervised Bioacoustic Analysis Marius Bartcus, Faicel Chamroukhi, Herve Glotin Abstract-Hidden Markov Models (HMMs) are one of the the standard HDP-HMM Gibbs sampling has the limitation most popular and successful models in statistics and machine of an inadequate modeling of the temporal persistence of learning for modeling sequential data. However, one main issue states [9]. This problem has been addressed in [9] by relying in HMMs is the one of choosing the number of hidden states. on a sticky extension which allows a more robust learning. The Hierarchical Dirichlet Process (HDP)-HMM is a Bayesian Other solutions for the inference of the hidden Markov non-parametric alternative for standard HMMs that offers a model in this infinite state space models are using the Beam principled way to tackle this challenging problem by relying sampling [lO] rather than Gibbs sampling. on a Hierarchical Dirichlet Process (HDP) prior. We investigate the HDP-HMM in a challenging problem of unsupervised We investigate the BNP formulation for the HMM, that is learning from bioacoustic data by using Markov-Chain Monte the HDP-HMM into a challenging problem of unsupervised Carlo (MCMC) sampling techniques, namely the Gibbs sampler. learning from bioacoustic data. The problem consists of We consider a real problem of fully unsupervised humpback extracting and classifying, in a fully unsupervised way, whale song decomposition. It consists in simultaneously finding the structure of hidden whale song units, and automatically unknown number of whale song units. We use the Gibbs inferring the unknown number of the hidden units from the Mel sampler to infer the HDP-HMM from the bioacoustic data.
    [Show full text]
  • Modelling Multi-Object Activity by Gaussian Processes 1
    LOY et al.: MODELLING MULTI-OBJECT ACTIVITY BY GAUSSIAN PROCESSES 1 Modelling Multi-object Activity by Gaussian Processes Chen Change Loy School of EECS [email protected] Queen Mary University of London Tao Xiang E1 4NS London, UK [email protected] Shaogang Gong [email protected] Abstract We present a new approach for activity modelling and anomaly detection based on non-parametric Gaussian Process (GP) models. Specifically, GP regression models are formulated to learn non-linear relationships between multi-object activity patterns ob- served from semantically decomposed regions in complex scenes. Predictive distribu- tions are inferred from the regression models to compare with the actual observations for real-time anomaly detection. The use of a flexible, non-parametric model alleviates the difficult problem of selecting appropriate model complexity encountered in parametric models such as Dynamic Bayesian Networks (DBNs). Crucially, our GP models need fewer parameters; they are thus less likely to overfit given sparse data. In addition, our approach is robust to the inevitable noise in activity representation as noise is modelled explicitly in the GP models. Experimental results on a public traffic scene show that our models outperform DBNs in terms of anomaly sensitivity, noise robustness, and flexibil- ity in modelling complex activity. 1 Introduction Activity modelling and automatic anomaly detection in video have received increasing at- tention due to the recent large-scale deployments of surveillance cameras. These tasks are non-trivial because complex activity patterns in a busy public space involve multiple objects interacting with each other over space and time, whilst anomalies are often rare, ambigu- ous and can be easily confused with noise caused by low image quality, unstable lighting condition and occlusion.
    [Show full text]
  • Non-Local Branching Superprocesses and Some Related Models
    Published in: Acta Applicandae Mathematicae 74 (2002), 93–112. Non-local Branching Superprocesses and Some Related Models Donald A. Dawson1 School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Canada K1S 5B6 E-mail: [email protected] Luis G. Gorostiza2 Departamento de Matem´aticas, Centro de Investigaci´ony de Estudios Avanzados, A.P. 14-740, 07000 M´exicoD. F., M´exico E-mail: [email protected] Zenghu Li3 Department of Mathematics, Beijing Normal University, Beijing 100875, P.R. China E-mail: [email protected] Abstract A new formulation of non-local branching superprocesses is given from which we derive as special cases the rebirth, the multitype, the mass- structured, the multilevel and the age-reproduction-structured superpro- cesses and the superprocess-controlled immigration process. This unified treatment simplifies considerably the proof of existence of the old classes of superprocesses and also gives rise to some new ones. AMS Subject Classifications: 60G57, 60J80 Key words and phrases: superprocess, non-local branching, rebirth, mul- titype, mass-structured, multilevel, age-reproduction-structured, superprocess- controlled immigration. 1Supported by an NSERC Research Grant and a Max Planck Award. 2Supported by the CONACYT (Mexico, Grant No. 37130-E). 3Supported by the NNSF (China, Grant No. 10131040). 1 1 Introduction Measure-valued branching processes or superprocesses constitute a rich class of infinite dimensional processes currently under rapid development. Such processes arose in appli- cations as high density limits of branching particle systems; see e.g. Dawson (1992, 1993), Dynkin (1993, 1994), Watanabe (1968). The development of this subject has been stimu- lated from different subjects including branching processes, interacting particle systems, stochastic partial differential equations and non-linear partial differential equations.
    [Show full text]