D YNA MM O : M INING AND S UMMARIZATION OF C OEVOLVING S EQUENCES WITH M ISSING V ALUES Lei Li joint work with Christos Faloutsos, James McCann, Nancy.

Slides:



Advertisements
Similar presentations
FUNNEL: Automatic Mining of Spatially Coevolving Epidemics Yasuko Matsubara, Yasushi Sakurai (Kumamoto University) Willem G. van Panhuis (University of.
Advertisements

Deepayan ChakrabartiCIKM F4: Large Scale Automated Forecasting Using Fractals -Deepayan Chakrabarti -Christos Faloutsos.
Towards Twitter Context Summarization with User Influence Models Yi Chang et al. WSDM 2013 Hyewon Lim 21 June 2013.
Multi-Label Prediction via Compressed Sensing By Daniel Hsu, Sham M. Kakade, John Langford, Tong Zhang (NIPS 2009) Presented by: Lingbo Li ECE, Duke University.
Randomized Sensing in Adversarial Environments Andreas Krause Joint work with Daniel Golovin and Alex Roper International Joint Conference on Artificial.
Toward Automatic Music Audio Summary Generation from Signal Analysis Seminar „Communications Engineering“ 11. December 2007 Patricia Signé.
Efficient Distribution Mining and Classification Yasushi Sakurai (NTT Communication Science Labs), Rosalynn Chong (University of British Columbia), Lei.
Modeling the Shape of People from 3D Range Scans
1.Introduction 2.Article [1] Real Time Motion Capture Using a Single TOF Camera (2010) 3.Article [2] Real Time Human Pose Recognition In Parts Using a.
Streaming Pattern Discovery in Multiple Time-Series Spiros Papadimitriou Jimeng Sun Christos Faloutsos Carnegie Mellon University VLDB 2005, Trondheim,
Summary & Homework Jinxiang Chai. Outline Motion data process paper summary Presentation tips Homework Paper assignment.
Introduction to Data-driven Animation Jinxiang Chai Computer Science and Engineering Texas A&M University.
I NCREMENTAL S INGULAR V ALUE D ECOMPOSITION A LGORITHMS FOR H IGHLY S CALABLE R ECOMMENDER S YSTEMS (S ARWAR ET AL ) Presented by Sameer Saproo.
WindMine: Fast and Effective Mining of Web-click Sequences SDM 2011Y. Sakurai et al.1 Yasushi Sakurai (NTT) Lei Li (Carnegie Mellon Univ.) Yasuko Matsubara.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 24: Motion Capture Ravi Ramamoorthi Most slides courtesy.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
Lecture 5: Learning models using EM
Spatial and Temporal Data Mining
Statistical Analysis of Transaction Dataset Data Visualization Homework 2 Hongli Li.
Learning the space of time warping functions for Activity Recognition Function-Space of an Activity Ashok Veeraraghavan Rama Chellappa Amit K. Roy-Chowdhury.
Online Piece-wise Linear Approximation of Numerical Streams with Precision Guarantees Hazem Elmeleegy Purdue University Ahmed Elmagarmid (Purdue) Emmanuel.
Energy-efficient Self-adapting Online Linear Forecasting for Wireless Sensor Network Applications Jai-Jin Lim and Kang G. Shin Real-Time Computing Laboratory,
Parsimonious Linear Fingerprinting for Time Series Lei Li joint work with B. Aditya Prakash, Christos Faloutsos School of Computer Science Carnegie Mellon.
Simple Calibration of Non-overlapping Cameras with a Mirror
Cut-And-Stitch: Efficient Parallel Learning of Linear Dynamical Systems on SMPs Lei Li Computer Science Department School of Computer Science Carnegie.
Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.
Fast and Exact Monitoring of Co-evolving Data Streams Yasuko Matsubara, Yasushi Sakurai (Kumamoto University) Naonori Ueda (NTT) Masatoshi Yoshikawa (Kyoto.
Improved Gene Expression Programming to Solve the Inverse Problem for Ordinary Differential Equations Kangshun Li Professor, Ph.D Professor, Ph.D College.
Annealing Paths for the Evaluation of Topic Models James Foulds Padhraic Smyth Department of Computer Science University of California, Irvine* *James.
A N A RCHITECTURE AND A LGORITHMS FOR M ULTI -R UN C LUSTERING Rachsuda Jiamthapthaksin, Christoph F. Eick and Vadeerat Rinsurongkawong Computer Science.
Time Series Data Analysis - I Yaji Sripada. Dept. of Computing Science, University of Aberdeen2 In this lecture you learn What are Time Series? How to.
BRAID: Discovering Lag Correlations in Multiple Streams Yasushi Sakurai (NTT Cyber Space Labs) Spiros Papadimitriou (Carnegie Mellon Univ.) Christos Faloutsos.
Fast Mining and Forecasting of Complex Time-Stamped Events Yasuko Matsubara (Kyoto University), Yasushi Sakurai (NTT), Christos Faloutsos (CMU), Tomoharu.
BRAID: Stream Mining through Group Lag Correlations Yasushi Sakurai Spiros Papadimitriou Christos Faloutsos SIGMOD 2005.
AutoPlait: Automatic Mining of Co-evolving Time Sequences Yasuko Matsubara (Kumamoto University) Yasushi Sakurai (Kumamoto University) Christos Faloutsos.
Jorge Almeida Laser based tracking of mutually occluding dynamic objects University of Aveiro 2010 Department of Mechanical Engineering 10 September 2010.
Carnegie Mellon School of Computer Science Forecasting with Cyber-physical Interactions in Data Centers Lei Li PDL Seminar 9/28/2011.
Abdullah Mueen Eamonn Keogh University of California, Riverside.
General ideas to communicate Show one particular Example of localization based on vertical lines. Camera Projections Example of Jacobian to find solution.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Efficient computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L 1 Norm Anders Eriksson and Anton van den Hengel.
Mingyang Zhu, Huaijiang Sun, Zhigang Deng Quaternion Space Sparse Decomposition for Motion Compression and Retrieval SCA 2012.
Gap-filling and Fault-detection for the life under your feet dataset.
Lei Li Computer Science Department Carnegie Mellon University Pre Proposal Time Series Learning completed work 11/27/2015.
Tell Me What You See and I will Show You Where It Is Jia Xu 1 Alexander G. Schwing 2 Raquel Urtasun 2,3 1 University of Wisconsin-Madison 2 University.
Stream Monitoring under the Time Warping Distance Yasushi Sakurai (NTT Cyber Space Labs) Christos Faloutsos (Carnegie Mellon Univ.) Masashi Yamamuro (NTT.
Analyzing wireless sensor network data under suppression and failure in transmission Alan E. Gelfand Institute of Statistics and Decision Sciences Duke.
Rick Parent - CIS681 Motion Capture Use digitized motion to animate a character.
Streaming Pattern Discovery in Multiple Time-Series Jimeng Sun Spiros Papadimitrou Christos Faloutsos PARALLEL DATA LABORATORY Carnegie Mellon University.
Chapter 8. Learning of Gestures by Imitation in a Humanoid Robot in Imitation and Social Learning in Robots, Calinon and Billard. Course: Robots Learning.
Learning Photographic Global Tonal Adjustment with a Database of Input / Output Image Pairs.
D YNA MM O : M INING AND S UMMARIZATION OF C OEVOLVING S EQUENCES WITH M ISSING V ALUES Christos Faloutsos joint work with Lei Li, James McCann, Nancy.
Multi-label Prediction via Sparse Infinite CCA Piyush Rai and Hal Daume III NIPS 2009 Presented by Lingbo Li ECE, Duke University July 16th, 2010 Note:
Locations. Soil Temperature Dataset Observations Data is – Correlated in time and space – Evolving over time (seasons) – Gappy (Due to failures) – Faulty.
WCPM 1 Chang-Tsun Li Department of Computer Science University of Warwick UK Image Clustering Based on Camera Fingerprints.
Facets: Fast Comprehensive Mining of Coevolving High-order Time Series Hanghang TongPing JiYongjie CaiWei FanQing He Joint Work by Presenter:Wei Fan.
Arizona State University1 Fast Mining of a Network of Coevolving Time Series Wei FanHanghang TongPing JiYongjie Cai.
SCS CMU Speaker Hanghang Tong Colibri: Fast Mining of Large Static and Dynamic Graphs Speaking Skill Requirement.
Spectral Algorithms for Learning HMMs and Tree HMMs for Epigenetics Data Kevin C. Chen Rutgers University joint work with Jimin Song (Rutgers/Palentir),
Enabling Real Time Alerting through streaming pattern discovery Chengyang Zhang Computer Science Department University of North Texas 11/21/2016 CRI Group.
Carnegie Mellon School of Computer Science Forecasting with Cyber-physical Interactions in Data Centers Lei Li PDL Seminar 9/28/2011.
Forecasting with Cyber-physical Interactions in Data Centers (part 3)
The Linear Dynamic System and its application in moction capture
Non-linear Mining of Competing Local Activities
Pre Proposal Time Series Learning completed work
Assessing uncertainties on production forecasting based on production Profile reconstruction from a few Dynamic simulations Gaétan Bardy – PhD Student.
Jimeng Sun · Charalampos (Babis) E
Smita Vijayakumar Qian Zhu Gagan Agrawal
Automatic Segmentation of Data Sequences
Finding Periodic Discrete Events in Noisy Streams
Presentation transcript:

D YNA MM O : M INING AND S UMMARIZATION OF C OEVOLVING S EQUENCES WITH M ISSING V ALUES Lei Li joint work with Christos Faloutsos, James McCann, Nancy Pollard June 9, 2009 Microsoft Research

C HALLENGE Multidimensional coevolving time series: Motion Capture sequence Temperature/humidity monitoring Daily Chlorine level measurement in drinking water system Big challenge: Missing observations Mining with missing values Find hidden patterns Use of hidden patterns 2 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

M ISSING VALUES IN M OCAP 3 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values Time Marker/Sensor Left Hand position Right Hand position

B LANK - OUTS IN M OCAP 4 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values Time Marker/Sensor Left Hand position Right Hand position

G OAL We want recovering, mining and summarization algorithms to be: 1. Effective: low reconstruction error, agreeing with human intuition (e.g. natural reconstructed motion for mocap) 2. Scalable: to time-duration T of the sequences. 3. Black-outs: It should be able to handle “black-outs”, when all markers dissappear (eg., a person running behind a wall, for a moment). 4. Automatic: The method should require no parameters to be set by the user. 5 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

O UTLINE Scenario and Motivation Proposed Methods – DynaMMo Experimental Results Conclusion Recovering missing values Compression and summarization Forecasting Segmentation 6 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

S CENARIO : M OTION C APTURE Motion Capture: Markers on human actors Cameras used to track the 3D positions Duration: dimensional body-local coordinates after preprocessing (31- bones) Challenge: Occlusions Other general scenario: Missing value in Sensor data: Out of battery, transmission error, etc Unable to observe, e.g. historical/future observation 7 From mocap.cs.cmu.edu Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

O BSERVATION AND M OTIVATION Left Hand Right Hand Left Foot Right Foot Dynamics: temporal moving pattern Correlation among multiple markers Use both dynamics and correlation to solve occlusion. 8 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

T HE U NDERLYING T IME S ERIES M ODEL L INEAR D YNAMICAL S YSTEMS z 1 = z 0 +ω 0 z n+1 = F∙z n +ω n x n = G∙z n +ε n Z1Z1 Z1Z1 Z2Z2 Z2Z2 Z3Z3 Z3Z3 Z4Z4 Z4Z4 X1X1 X1X1 X2X2 X2X2 X3X3 X3X3 X4X4 X4X4 N (F∙z 1, Λ) N (z 0, Γ) N (G∙z 3, Σ) N (F∙z 2, Λ) N (G∙z 1, Σ) N (G∙z 2, Σ) N (G∙z 4, Σ) N (F∙z 3, Λ) N (F∙z 4, Γ) … Model parameters: θ={ z 0, Γ, F, Λ, G, Σ} 9 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

D YNA MM O R ECOVERING A LGORITHM Expectation Maximization Intuition: Finding the best model parameters (θ) and missing values for X to minimize the expected loglikelihood: See details in paper 10 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

D YNA MM O I NTUITION : Left Hand Right Hand missing correlation dynamics 11 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

D YNA MM O C OMPRESSION : I NTUITION observations w/ missing values get hidden variables and model parameters keep only a (best) portion of them Same idea could be used in segmentation and forecasting 12 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

E XPERIMENT Dataset: – Chlorine: Chlorine level in drinking water system Duration 4310 time ticks 166 sequences – Mocap: full body human motion capture dataset – 58 motions – each with duration , 93 dimensions Occlusion: random mask out Baseline: – linear interpolation and spline – MSVD: Missing value SVD algorithm EM flavored version of SVD. 13 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

R ESULTS Reconstruction Error for random mask out Scalability: computation time to duration Forecasting case study Compression: error versus space Segmentation for synthetic and real data 14 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

D YNA MM O R ECONSTRUCTION R ESULT ( AVERAGE OVER 10 REPEATS ) 15 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values Chlorine dataset Reconstruction error better Mocap dataset average consecutive occlusion length worse easydifficult

S CATTER COMPARISON : D YNA MM O VS MSVD 16 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values error of MSVD error of DynaMMo

D YNA MM O S CALABILITY 17 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values Computation time sequence length (chlorine data)

D YNA MM O F ORECASTING 18 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values Actual Data Predicted signal using learned model

D YNA MM O C OMPRESSION 19 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values Compression ratio error better worse more space less space DynaMMo optimal compression

D YNA MM O S EGMENTATION 20 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values original data segmentation using reconstruction error

M OCAP S EGMENTATION R UNNING T RANSITION MOTION ( MOCAP #16.8) 21 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values left hip left femur segmentation using reconstruction error

C ONTRIBUTION We propose algorithms DynaMMo for DynaMMo meets all goals: 1. Effective: low reconstruction error, agreeing with human intuition (e.g. natural reconstructed motion for mocap) 2. Scalable: computation time linear to length/duration T of the sequences. 3. Black-outs: able to handle “black-outs”, when all markers dissappear. 4. Automatic: The methods should require few parameter to be set by the user. 22 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values Recovering missing values Compression and summarization Forecasting Segmentation

Q UESTION Thanks! Contact: 23 Christos Faloutsos Lei Li Nancy Pollard Jim McCann Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

B ACKUP SLIDES 24 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values

25 Li et al. DynaMMo: Mining and Summarization of Coevolving Sequences with Missing Values