Improving the Accuracy of Action Classification Using View-Dependent Context Information

Proceedings of: 6th International Conference, HAIS 2011, Wroclaw, Poland, May 23-25, 2011This paper presents a human action recognition system that decomposes the task in two subtasks. First, a view-independent classifier, shared between the multiple views to analyze, is applied to obtain an initial guess of the posterior distribution of the performed action. Then, this posterior distribution is combined with view based knowledge to improve the action classification. This allows to reuse the view-independent component when a new view has to be analyzed, needing to only specify the view dependent knowledge. An example of the application of the system into an smart home domain is discussed.This work was supported in part by Projects CICYT TIN2008-06742-C02-02/ TSI, CICYT TEC2008-06732-C02-02/TEC, CAM CONTEXTS (S2009/ TIC-1485) and DPS2008-07029-C02-02.Publicad

A General Purpose Context Reasoning Environment to Deal with Tracking Problems: An Ontology-based Prototype

Proceedings of: 6th International Conference on Hybrid Artificial Intelligence Systems (HAIS 2011). Wroclaw, Poland, May 23-25, 2011The high complexity of semantics extraction with automatic video analysis has forced the researchers to the generalization of mixed approaches based on perceptual and context data. These mixed approaches do not usually take in account the advantages and benefits of the data fusion discipline. This paper presents a context reasoning environment to deal with general and specific tracking problems. The cornerstone of the environment is a symbolic architecture based on the Joint Directors of Laboratories fusion model. This architecture may build a symbolic data representation from any source, check the data consistency, create new knowledge and refine it through inference obtaining a higher understanding level of the scene and providing feedback to autocorrect the tracking errors. An ontology-based prototype has been developed to carry out experimental tests. The prototype has been proved against tracking analysis occlusion problems.This work was supported in part by Projects CICYT TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, CAM CONTEXTS (S2009/ TIC-1485) and DPS2008-07029-C02-02.Publicad

Anytime Discovery of a Diverse Set of Patterns with Monte Carlo Tree Search

International audienceThe discovery of patterns that accurately discriminate one class label from another remains a challenging data mining task. Subgroup discovery (SD) is one of the frameworks that enables to elicit such interesting patterns from labeled data. A question remains fairly open: How to select an accurate heuristic search technique when exhaustive enumeration of the pattern space is infeasible? Existing approaches make use of beam-search, sampling, and genetic algorithms for discovering a pattern set that is non-redundant and of high quality w.r.t. a pattern quality measure. We argue that such approaches produce pattern sets that lack of diversity: Only few patterns of high quality, and different enough, are discovered. Our main contribution is then to formally define pattern mining as a game and to solve it with Monte Carlo tree search (MCTS). It can be seen as an exhaustive search guided by random simulations which can be stopped early (limited budget) by virtue of its best-first search property. We show through a comprehensive set of experiments how MCTS enables the anytime discovery of a diverse pattern set of high quality. It out-performs other approaches when dealing with a large pattern search space and for different quality measures. Thanks to its genericity, our MCTS approach can be used for SD but also for many other pattern mining tasks