scispace - formally typeset
Journal ArticleDOI

Selecting Key Poses on Manifold for Pairwise Action Recognition

TLDR
A novel approach for key poses selection is proposed, which models the descriptor space utilizing a manifold learning technique to recover the geometric structure of the descriptors on a lower dimensional manifold and develops a PageRank-based centrality measure.
Abstract
In action recognition, bag of visual words based approaches have been shown to be successful, for which the quality of codebook is critical. In a large vocabulary of poses (visual words), some key poses play a more decisive role than others in the codebook. This paper proposes a novel approach for key poses selection, which models the descriptor space utilizing a manifold learning technique to recover the geometric structure of the descriptors on a lower dimensional manifold. A PageRank-based centrality measure is developed to select key poses according to the recovered geometric structure. In each step, a key pose is selected from the manifold and the remaining model is modified to maximize the discriminative power of selected codebook. With the obtained codebook, each action can be represented with a histogram of the key poses. To solve the ambiguity between some action classes, a pairwise subdivision is executed to select discriminative codebooks for further recognition. Experiments on benchmark datasets showed that our method is able to obtain better performance compared with other state-of-the-art methods.

read more

Citations
More filters
Journal ArticleDOI

Image-Based Three-Dimensional Human Pose Recovery by Multiview Locality-Sensitive Sparse Retrieval

TL;DR: This approach improves traditional methods by adopting multiview locality-sensitive sparse coding in the retrieving process, and incorporates a local similarity preserving term into the objective of sparse coding, which groups similar silhouettes to alleviate the instability of sparse codes.
Journal ArticleDOI

Boosted key-frame selection and correlated pyramidal motion-feature representation for human action recognition

TL;DR: A novel method for human action recognition based on boosted key-frame selection and correlated pyramidal motion feature representations and the correlogram, which focuses not only on probabilistic distributions within one frame but also on the temporal relationships of the action sequence is proposed.
Journal ArticleDOI

$p$ -Laplacian Regularized Sparse Coding for Human Activity Recognition

TL;DR: The experimental results demonstrate that the proposed pLSC algorithm outperforms the manifold regularized sparse coding algorithms including the standard Laplacian regularization sparse coding algorithm with a proper p.
Journal ArticleDOI

Silhouette Analysis-Based Action Recognition Via Exploiting Human Poses

TL;DR: The proposed scheme takes advantages of local and global features and, therefore, provides a discriminative representation for human actions and outperforms the state-of-the-art methods on the IXMAS action recognition dataset.
Journal ArticleDOI

Learning Discriminative Key Poses for Action Recognition

TL;DR: A new classifier named weighted local naive Bayes nearest neighbor is proposed for the final action classification, which is demonstrated to be more accurate and robust than other classifiers, e.g., support vector machine (SVM) and naive Baye nearest neighbor.
References
More filters
Journal ArticleDOI

LIBSVM: A library for support vector machines

TL;DR: Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
Proceedings ArticleDOI

Histograms of oriented gradients for human detection

TL;DR: It is shown experimentally that grids of histograms of oriented gradient (HOG) descriptors significantly outperform existing feature sets for human detection, and the influence of each stage of the computation on performance is studied.
Journal ArticleDOI

Nonlinear dimensionality reduction by locally linear embedding.

TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
Journal ArticleDOI

The anatomy of a large-scale hypertextual Web search engine

TL;DR: This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Journal ArticleDOI

A global geometric framework for nonlinear dimensionality reduction.

TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
Related Papers (5)