Activity recognition using binary tree SVM

This paper presents an effective classification method based on Support Vector Machines (SVM) in the context of activity recognition. Local features that capture both spatial and temporal information in activity videos have made significant progress recently. Efficient and effective features, feature representation and classification plays a crucial role in activity recognition. For classification, SVMs are popularly used because of their simplicity and efficiency; however the common multi-class SVM approaches applied suffer from limitations including having easily confused classes and been computationally inefficient. We propose using a binary tree SVM to address the shortcomings of multi-class SVMs in activity recognition. We proposed constructing a binary tree using Gaussian Mixture Models (GMM), where activities are repeatedly allocated to subnodes until every new created node contains only one activity. Then, for each internal node a separate SVM is learned to classify activities, which significantly reduces the training time and increases the speed of testing compared to popular the `one-against-the-rest' multi-class SVM classifier. Experiments carried out on the challenging and complex Hollywood dataset demonstrates comparable performance over the baseline bag-of-features method.

Comment on “Whole-genome analyses resolve early branches in the tree of life of modern birds”

Jarvis et al. (Research Articles, 12 December 2014, p. 1320) presented molecular clock analyses that suggested that most modern bird orders diverged just after the mass extinction event at the Cretaceous-Paleogene boundary (about 66 million years ago). We demonstrate that this conclusion results from the use of a single inappropriate maximum bound, which effectively precludes the Cretaceous diversification overwhelmingly supported by previous molecular studies.