scholarly journals Context-Aware Mouse Behavior Recognition Using Hidden Markov Models

2019 ◽  
Vol 28 (3) ◽  
pp. 1133-1148 ◽  
Author(s):  
Zheheng Jiang ◽  
Danny Crookes ◽  
Brian D. Green ◽  
Yunfeng Zhao ◽  
Haiping Ma ◽  
...  
Robotica ◽  
2014 ◽  
Vol 32 (2) ◽  
pp. 291-304 ◽  
Author(s):  
Michael Novitzky ◽  
Charles Pippin ◽  
Thomas R. Collins ◽  
Tucker R. Balch ◽  
Michael E. West

SUMMARYThis paper focuses on behavior recognition in an underwater application as a substitute for communicating through acoustic transmissions, which can be unreliable. The importance of this work is that sensor information regarding other agents can be leveraged to perform behavior recognition, which is activity recognition of robots performing specific programmed behaviors, and task-assignment. This work illustrates the use of Behavior Histograms, Hidden Markov Models (HMMs), and Conditional Random Fields (CRFs) to perform behavior recognition. We present challenges associated with using each behavior recognition technique along with results on individually selected test trajectories, from simulated and real sonar data, and real-time recognition through a simulated mission.


2015 ◽  
Vol 10 (3) ◽  
pp. 495-502 ◽  
Author(s):  
Yuexin Wu ◽  
Zhe Jia ◽  
Yue Ming ◽  
Juanjuan Sun ◽  
Liujuan Cao

Author(s):  
Chiraz Trabelsi ◽  
Bilel Moulahi ◽  
Sadok Ben Yahia

Recently, social bookmarking systems have received surging attention in academic and industrial communities. In fact, social bookmarking systems share with the Semantic Web vision the idea of facilitating the collaborative organization and sharing of knowledge on the web. The reason for the apparent success of the upcoming tools for resource sharing (social bookmarking systems, photo sharing systems, etc.) lies mainly in the fact that no specific skills are needed for publishing and editing, and an immediate benefit is yielded to each individual user, e.g., organizing one’s bookmarks in a browser-independent, persistent fashion, without too much overhead. As these systems grow larger, however, the users address the need of enhanced search facilities. Today, full-text search is supported, but the results are usually simply listed decreasingly by their upload date. The challenging research issue is, therefore, the development of a suitable prediction framework to support users in effectively retrieving the resources matching their real search intents. The primary focus of this chapter is to propose a new, context aware tag query prediction approach. Specifically, the authors adopted Hidden Markov Models and formal concept analysis to predict users’ search intentions based on a real folksonomy. Carried out experiments emphasize the relevance of the proposal and open many issues.


2015 ◽  
Vol 135 (12) ◽  
pp. 1517-1523 ◽  
Author(s):  
Yicheng Jin ◽  
Takuto Sakuma ◽  
Shohei Kato ◽  
Tsutomu Kunitachi

Author(s):  
M. Vidyasagar

This book explores important aspects of Markov and hidden Markov processes and the applications of these ideas to various problems in computational biology. It starts from first principles, so that no previous knowledge of probability is necessary. However, the work is rigorous and mathematical, making it useful to engineers and mathematicians, even those not interested in biological applications. A range of exercises is provided, including drills to familiarize the reader with concepts and more advanced problems that require deep thinking about the theory. Biological applications are taken from post-genomic biology, especially genomics and proteomics. The topics examined include standard material such as the Perron–Frobenius theorem, transient and recurrent states, hitting probabilities and hitting times, maximum likelihood estimation, the Viterbi algorithm, and the Baum–Welch algorithm. The book contains discussions of extremely useful topics not usually seen at the basic level, such as ergodicity of Markov processes, Markov Chain Monte Carlo (MCMC), information theory, and large deviation theory for both i.i.d and Markov processes. It also presents state-of-the-art realization theory for hidden Markov models. Among biological applications, it offers an in-depth look at the BLAST (Basic Local Alignment Search Technique) algorithm, including a comprehensive explanation of the underlying theory. Other applications such as profile hidden Markov models are also explored.


Sign in / Sign up

Export Citation Format

Share Document