38555873
Recognizing Human Action from Videos Using Histograms of Visual Words
We propose a new method for human action recognition from video sequences using histograms of visual words. Video sequences are represented by a novel "bag-of-words" representation, where each frame corresponds to a "word". The major difference between our model and previous "bag-of-words" models for recognition problems in computer vision is that, a "word" in our representation corresponds to a whole frame. The advantage of this representation is that the large-scale feature of a frame is better captured, which turns out to be important for recognition actions. We demonstrate our approach on two publicly available datasets. Our results are comparable to other state-of-the-art approaches for action recognition.
6926567
Semi-Latent Dirichlet Allocation: A Hierarchical Model for Human Action Recognition
We propose a new method for human action recognition from video sequences using latent topic models. Video sequences are represented by a novel "bag-of-words" representation, where each frame corresponds to a "word". The major difference between our model and previous latent topic models for recognition problems in computer vision is that, our model is trained in a "semi-supervised" way. Our model has several advantages over other similar models. First of all, the training is much easier due to the decoupling of the model parameters. Secondly, it naturally solves the problem of how to choose the appropriate number of latent topics. Thirdly, it achieves much better performance by utilizing the information provided by the class labels in the training set. We present action classification and irregularity detection results, and show improvement over previous methods.
1878790
Unsupervised Discovery of Action Classes
In this paper we consider the problem of describing the action being performed by human figures in still images. We will attack this problem using an unsupervised learning approach, attempting to discover the set of action classes present in a large collection of training images. These action classes will then be used to label test images. Our approach uses the coarse shape of the human figures to match pairs of images. The distance between a pair of images is computed using a linear programming relaxation technique. This is a computationally expensive process, and we employ a fast pruning method to enable its use on a large collection of images. Spectral clustering is then performed using the resulting distances. We present clustering and image labeling results on a variety of datasets.
9823069
Multiple Tree Models for Occlusion and Spatial Constraints in Human Pose Estimation
Tree-structured models have been widely used for human pose estimation, in either 2D or 3D. While such models allow efficient learning and inference, they fail to capture additional dependencies between body parts, other than kinematic constraints between connected parts. In this paper, we consider the use of multiple tree models, rather than a single tree model for human pose estimation. Our model can alleviate the limitations of a single tree-structured model by combining information provided across different tree models. The parameters of each individual tree model are trained via standard learning algorithms in a single tree-structured model. Different tree models can be combined in a discriminative fashion by a boosting procedure. We present experimental results showing the improvement of our approaches on two different datasets. On the first dataset, we use our multiple tree framework for occlusion reasoning. On the second dataset, we combine multiple deformable trees for capturing spatial constraints between non-connected body parts.
13971731
Video segmentation based on graphical models
This paper proposes a unified framework for spatiotemporal segmentation of video sequences. A Bayesian network is presented to model the interactions among the motion vector field, the intensity segmentation field, and the video segmentation field. The notions of distance transformation and Markov random field are used to express spatiotemporal constraints. Given consecutive frames, an optimization method is proposed to maximize the conditional probability density of the three fields in an iterative way. Experimental results show that the approach is robust and generates spatiotemporally coherent segmentation results.
18413233
Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks
Localization algorithm continues to be an important and challenging topic in today's wireless sensor networks (WSNs). In this paper, a novel range-free localization algorithm using expected hop progress (LAEP) to predict the location of any sensor in a WSN is proposed. This algorithm is based on an accurate analysis of hop progress in a WSN with randomly deployed sensors and arbitrary node density. By deriving the expected hop progress from a network model for WSNs in terms of network parameters, the distance between any pair of sensors can be accurately computed. Since the distance estimation is a key issue in localization systems for WSNs, the proposed range-free LAEP achieves better performance and less communication overhead as compared to some existent schemes like DV-Hop and RAW. In addition, we study the effect of anchor placement on the algorithm performance by deriving the corresponding mean position error range. Extensive simulations are performed and the results are observed to be in good agreement with the theoretical analysis.
19740000
Color Image Segmentation Based on Parameter-Dependent Connected Components
A theory of a parameter-dependent connected components of gray images that takes into account both the gray values of the pixels and the differences of the gray values of the neighboring pixels has been introduced in a previous work. The concept of the parameter-dependent connected components has been applied to gray-scaled images for segmentation successfully. In this paper, the author investigates a method to apply the concept of the parameterdependent connected components to color images for segmentation.
38323161
On validity of m-step multisplitting preconditioners for linear systems
Let Ax=b be a linear system where A is a symmetric positive definite (spd) matrix. m-step multisplitting preconditioners, which include the preconditioners based on multisplittings obtained by incomplete Cholesky factorizations [R. Bru, C. Corral, A. Martinez, J. Mas, SIAM J. Matrix Anal. Appl. 16 (1995) 1210-1222], for the conjugate gradient method are studied. The validity of the proposed m-step multisplitting preconditioners when A is an spd matrix is proved. Our results improve and extend previous ones.
18702956
A Dynamic Hidden Markov Random Field Model for Foreground and Shadow Segmentation
This paper proposes a dynamic hidden Markov random field (DHMRF) model for foreground object and moving shadow segmentation in indoor video scenes. Given an image sequence, temporal dependencies of consecutive segmentation fields and spatial dependencies within each segmentation field are unified in the novel dynamic probabilistic model that combines the hidden Markov model (HMM) and the Markov random field (MRF). An efficient approximate filtering algorithm is derived for the DHMRF model to recursively estimate the segmentation field from the history of observed images. The foreground and shadow segmentation method integrates both intensity and edge information: Moreover, models of background, shadow, and edge information are updated adoptively for nonstationary background processes. Experimental results show that the proposed approach can accurately detect moving objects and their cast shadows even in monocular grayscale video sequences