NDLI: Scalable action recognition with a subspace forest

Content Provider	IEEE Xplore Digital Library
Author	O'Hara, S. Draper, B.A.
Copyright Year	2012
Description	Author affiliation: Colorado State University, 1873 Campus Delivery, Fort Collins, CO 80523 (O'Hara, S.; Draper, B.A.)
Abstract	We present a novel structure, called a Subspace Forest, designed to provide an efficient approximate nearest neighbor query of subspaces represented as points on Grassmann manifolds. We apply this structure to action recognition by representing actions as subspaces spanning a sequence of thumbnail image tiles extracted from a tracked entity. The Subspace Forest lifts the concept of randomized decision forests from classifying vectors to classifying subspaces, and employs a splitting method that respects the underlying manifold geometry. The Subspace Forest is an inherently parallel structure and is highly scalable due to O(log N) recognition time complexity. Our experimental results demonstrate state-of-the-art classification accuracies on the well-known KTH Actions and UCF Sports benchmarks, and a competitive score on Cambridge Gestures. In addition to being both highly accurate and scalable, the Subspace Forest is built without supervision and requires no extensive validation stage for model selection. Conceptually, the Subspace Forest could be used anywhere set-to-set feature matching is desired.
Starting Page	1210
Ending Page	1217
File Size	562311
Page Count	8
File Format	PDF
ISBN	9781467312264
ISSN	10636919
e-ISBN	9781467312288
e-ISBN	9781467312271
DOI	10.1109/CVPR.2012.6247803
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-16
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vegetation Manifolds Entropy Vectors Accuracy Scalability Decision trees
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Revisiting Example Dependent Cost-Sensitive Learning with Decision Trees

Multiple Instance Learning with Response-Optimized Random Forests

Alternating Decision Forests

Scalable Sparse Subspace Clustering

Subspace segmentation with a Minimal Squared Frobenius Norm Representation

Learning Scalable Discriminative Dictionary with Sample Relatedness

Tracking Tetrahymena pyriformis cells using decision trees

Ensemble Learning for Confidence Measures in Stereo Vision

Computation strategies for volume local binary patterns applied to action recognition

Scalable action recognition with a subspace forest

Similar Documents

Revisiting Example Dependent Cost-Sensitive Learning with Decision Trees

Multiple Instance Learning with Response-Optimized Random Forests

Alternating Decision Forests

Scalable Sparse Subspace Clustering

Subspace segmentation with a Minimal Squared Frobenius Norm Representation

Learning Scalable Discriminative Dictionary with Sample Relatedness

Tracking Tetrahymena pyriformis cells using decision trees

Ensemble Learning for Confidence Measures in Stereo Vision

Computation strategies for volume local binary patterns applied to action recognition

Scalable action recognition with a subspace forest