20. Persistence
Diagram
Compute PCs for each joint that explain 95% of the
variation
Data streams !" # ∶
ℝ → ℝ'
from joints
Pick 10-second
Window
Project to PC Directions to
obtain (",* # : ℝ → ℝ
TDE: Compute ,",* and
delay embedding for each
- and .
Obtain point cloud /",* by
subsampling delay
embedding
TDA: Compute 012 from /",* and
maximum persistent interval length
3",*
Features 45 = 32,2 … 389,8:
are
used for classification using k-NN
AI Pipeline for Recognition
33. References
• Richmond, T., Lokare, N., & Lobaton, E. (accepted 2017, May). “Robust Trajectory-based Density Estimation for
Geometric Structure Recovery,” European Signal and Image Processing Conference (EUSIPCO).
• Lokare, N., Benavides, D., Juneja, S., & Lobaton, E. (2016, December). “Hierarchical Activity Clustering Analysis
for Robust Graphical Structure Recovery,” IEEE Global Conf. on Signal and Information Processing (GlobalSIP),
2016.
• Dirafzoon, A., Lokare, N., & Lobaton, E. (2016, December). “Action Classification from Motion Capture Data using
Topological Data Analysis,” IEEE Global Conf. on Signal and Information Processing (GlobalSIP).