๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Learning Variable-Length Markov Models of Behavior

โœ Scribed by Aphrodite Galata; Neil Johnson; David Hogg


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
264 KB
Volume
81
Category
Article
ISSN
1077-3142

No coin nor oath required. For personal study only.

โœฆ Synopsis


In recent years there has been an increased interest in the modeling and recognition of human activities involving highly structured and semantically rich behavior such as dance, aerobics, and sign language. A novel approach for automatically acquiring stochastic models of the high-level structure of an activity without the assumption of any prior knowledge is presented. The process involves temporal segmentation into plausible atomic behavior components and the use of variable-length Markov models for the efficient representation of behaviors. Experimental results that demonstrate the synthesis of realistic sample behaviors and the performance of models for longterm temporal prediction are presented.


๐Ÿ“œ SIMILAR VOLUMES


Three models of song learning: Evidence
โœ Marler, Peter ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 131 KB ๐Ÿ‘ 1 views

Research on avian song learning sals that are recognized innately but fail to develop has traditionally been based on an instructional in songs of social isolates. A third model combines model, as exemplified by the sensorimotor model of instruction, in the memorization phase, with selection song de

Predicting peptides that bind to MHC mol
โœ Hiroshi Mamitsuka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 186 KB ๐Ÿ‘ 2 views

The binding of a major histocompatibility complex (MHC) molecule to a peptide originating in an antigen is essential to recognizing antigens in immune systems, and it has proved to be important to use computers to predict the peptides that will bind to an MHC molecule. The purpose of this paper is t

Queue length distributions in a markov m
โœ Ora E. Percus; J. K. Percus ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 265 KB

In (41, we treated the problem of passage through a discrete-time clock-regulated multistage queueing network by modeling the input time series (a,,) to each queue as a Markov chain. We showed how to transform probability transition information from the input of one queue to the input of the next in