%0 Conference Paper
%B 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
%D 2010
%T Learning shift-invariant sparse representation of actions
%A Li,Yi
%A Fermüller, Cornelia
%A Aloimonos, J.
%A Hui Ji
%K action characterization
%K Action recognition
%K action retrieval
%K action synthesis
%K Character recognition
%K data compression
%K human motion capture
%K HUMANS
%K Image matching
%K Image motion analysis
%K image representation
%K Image sequences
%K Information retrieval
%K joint movements
%K large convex minimizations
%K learning (artificial intelligence)
%K learning shift-invariant sparse representation
%K Matching pursuit algorithms
%K minimisation
%K Minimization methods
%K MoCap data compression
%K Motion analysis
%K motion capture analysis
%K motion disorder disease
%K motion sequences
%K orthogonal matching pursuit
%K Parkinson diagnosis
%K Parkinson's disease
%K Pursuit algorithms
%K shift-invariant basis functions
%K short basis functions
%K snippets
%K sparse linear combination
%K split Bregman algorithm
%K time series
%K time series data
%K Unsupervised learning
%K unsupervised learning algorithm
%X A central problem in the analysis of motion capture (MoCap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should facilitate the recognition, synthesis, and characterization of actions. We propose an unsupervised learning algorithm for automatically decomposing joint movements in human motion capture (MoCap) sequences into shift-invariant basis functions. Our formulation models the time series data of joint movements in actions as a sparse linear combination of short basis functions (snippets), which are executed (or “activated”) at different positions in time. Given a set of MoCap sequences of different actions, our algorithm finds the decomposition of MoCap sequences in terms of basis functions and their activations in time. Using the tools of L1 minimization, the procedure alternately solves two large convex minimizations: Given the basis functions, a variant of Orthogonal Matching Pursuit solves for the activations, and given the activations, the Split Bregman Algorithm solves for the basis functions. Experiments demonstrate the power of the decomposition in a number of applications, including action recognition, retrieval, MoCap data compression, and as a tool for classification in the diagnosis of Parkinson (a motion disorder disease).
%B 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
%I IEEE
%P 2630 - 2637
%8 2010/06/13/18
%@ 978-1-4244-6984-0
%G eng
%R 10.1109/CVPR.2010.5539977