N-mode Analysis (Tensor Framework) Behrouz Saghafi

Similar documents
Multilinear Subspace Analysis of Image Ensembles

Shape Outlier Detection Using Pose Preserving Dynamic Shape Models

Face Recognition. Face Recognition. Subspace-Based Face Recognition Algorithms. Application of Face Recognition

Human Action Recognition under Log-Euclidean Riemannian Metric

Symmetric Two Dimensional Linear Discriminant Analysis (2DLDA)

Multilinear Analysis of Image Ensembles: TensorFaces

Dimensionality Reduction:

Uncorrelated Multilinear Principal Component Analysis through Successive Variance Maximization

Lecture 13 Visual recognition

Example: Face Detection

CVPR A New Tensor Algebra - Tutorial. July 26, 2017

Higher Order Separable LDA Using Decomposed Tensor Classifiers

A Tensor Approximation Approach to Dimensionality Reduction

Matrix-Tensor and Deep Learning in High Dimensional Data Analysis

Robust Tensor Factorization Using R 1 Norm

A Multi-Affine Model for Tensor Decomposition

Tensor Canonical Correlation Analysis for Action Classification

Lecture 24: Principal Component Analysis. Aykut Erdem May 2016 Hacettepe University

Fisher Tensor Decomposition for Unconstrained Gait Recognition

THERE is an increasing need to handle large multidimensional

Slice Oriented Tensor Decomposition of EEG Data for Feature Extraction in Space, Frequency and Time Domains

A Human Behavior Recognition Method Based on Latent Semantic Analysis

Multiscale Tensor Decomposition

Face recognition Computer Vision Spring 2018, Lecture 21

Lecture: Face Recognition

A new truncation strategy for the higher-order singular value decomposition

CITS 4402 Computer Vision

Salt Dome Detection and Tracking Using Texture Analysis and Tensor-based Subspace Learning

Advanced Introduction to Machine Learning CMU-10715

Chaotic Invariants for Human Action Recognition

Robust Motion Segmentation by Spectral Clustering

Tracking Human Heads Based on Interaction between Hypotheses with Certainty

Linear Subspace Models

Region Covariance: A Fast Descriptor for Detection and Classification

Face Detection and Recognition

Deriving Principal Component Analysis (PCA)

Principal Component Analysis

Recognition Using Class Specific Linear Projection. Magali Segal Stolrasky Nadav Ben Jakov April, 2015

Joint Weighted Dictionary Learning and Classifier Training for Robust Biometric Recognition

Iterative Laplacian Score for Feature Selection

Face Recognition from Video: A CONDENSATION Approach

2D Image Processing Face Detection and Recognition

Activity Recognition using Dynamic Subspace Angles

Simultaneous and Orthogonal Decomposition of Data using Multimodal Discriminant Analysis

Lecture: Face Recognition and Feature Reduction

Data Mining and Matrices

Image Analysis & Retrieval. Lec 14. Eigenface and Fisherface

Non-parametric Classification of Facial Features

A RAIN PIXEL RESTORATION ALGORITHM FOR VIDEOS WITH DYNAMIC SCENES

Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization

Lecture: Face Recognition and Feature Reduction

Chapter 2 Face Recognition in Subspaces

Principal Component Analysis (PCA)

Theoretical Performance Analysis of Tucker Higher Order SVD in Extracting Structure from Multiple Signal-plus-Noise Matrices

Face Recognition in Subspaces

Learning Discriminative Canonical Correlations for Object Recognition with Image Sets

On the convergence of higher-order orthogonality iteration and its extension

Image Analysis & Retrieval Lec 14 - Eigenface & Fisherface

Robot Image Credit: Viktoriya Sukhanova 123RF.com. Dimensionality Reduction

Karhunen Loéve Expansion of a Set of Rotated Templates

Boosting: Algorithms and Applications

Linear Discriminant Analysis Using Rotational Invariant L 1 Norm

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Riemannian Metric Learning for Symmetric Positive Definite Matrices

Tensor-Based Dictionary Learning for Multidimensional Sparse Recovery. Florian Römer and Giovanni Del Galdo

Gait Recognition using Dynamic Affine Invariants

Machine Learning (Spring 2012) Principal Component Analysis

GAIT RECOGNITION THROUGH MPCA PLUS LDA. Haiping Lu, K.N. Plataniotis and A.N. Venetsanopoulos

Nonlinear Dynamical Shape Priors for Level Set Segmentation

COS 429: COMPUTER VISON Face Recognition

A Novel Activity Detection Method

A Constraint Generation Approach to Learning Stable Linear Dynamical Systems

Low-Rank Tensor Completion by Truncated Nuclear Norm Regularization

CSC487/2503: Foundations of Computer Vision. Visual Tracking. David Fleet

Visual Tracking via Geometric Particle Filtering on the Affine Group with Optimal Importance Functions

Level-Set Person Segmentation and Tracking with Multi-Region Appearance Models and Top-Down Shape Information Appendix

CPSC 340: Machine Learning and Data Mining. More PCA Fall 2016

Face Recognition Using Laplacianfaces He et al. (IEEE Trans PAMI, 2005) presented by Hassan A. Kingravi

Adaptive Covariance Tracking with Clustering-based Model Update

Lecture 17: Face Recogni2on

A Hierarchical Convolutional Neural Network for Mitosis Detection in Phase-Contrast Microscopy Images

December 20, MAA704, Multivariate analysis. Christopher Engström. Multivariate. analysis. Principal component analysis

System 1 (last lecture) : limited to rigidly structured shapes. System 2 : recognition of a class of varying shapes. Need to:

Degeneracies, Dependencies and their Implications in Multi-body and Multi-Sequence Factorizations

OBJECT DETECTION AND RECOGNITION IN DIGITAL IMAGES

Data Mining Techniques

Discriminant Uncorrelated Neighborhood Preserving Projections

DISCRIMINATIVE DECORELATION FOR CLUSTERING AND CLASSIFICATION

Two heads better than one: Pattern Discovery in Time-evolving Multi-Aspect Data

Face detection and recognition. Detection Recognition Sally

ENGG5781 Matrix Analysis and Computations Lecture 10: Non-Negative Matrix Factorization and Tensor Decomposition

18 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 19, NO. 1, JANUARY 2008

Computation. For QDA we need to calculate: Lets first consider the case that

Note on Algorithm Differences Between Nonnegative Matrix Factorization And Probabilistic Latent Semantic Indexing

Kronecker Decomposition for Image Classification

Robotics 2 AdaBoost for People and Place Detection

Linear dimensionality reduction for data analysis

Unsupervised Learning: K- Means & PCA

Multi-scale Geometric Summaries for Similarity-based Upstream S

Lecture 17: Face Recogni2on

Transcription:

N-mode Analysis (Tensor Framework) Behrouz Saghafi

N-mode Analysis (Tensor Framework) Drawback of 1-mode analysis (e.g. PCA): Captures the variance among just a single factor Our training set contains changes in more than 1 factor: People, action, viewpoint, etc This motivates analysis in multiple modes.

N-mode Analysis (Related work) Ding and Ye [1] extend the common matrix SVD to 2D-SVD. 2D-LDA has been introduced [2]. Vasilescu and Terzopoulos [3-5] : proposed the idea of using N-mode SVD on the data tensor to decompose it into multiple factors. Have Applied it on face recognition and also synthesis and recognition of human signatures and actions. [1] C. Ding and J. Ye, "Two-dimensional Singular Value Decomposition (2DSVD) for 2D Maps and Images," in SIAM Int'l Conf. Data Mining, 2005. [2] K. Inoue and K. Urahama, "Non-Iterative Two-Dimensional Linear Discriminant Analysis," in ICPR, 2006. [3] M. A. O. Vasilescu and D. Terzopoulos, "Multilinear Image Analysis for Facial Recognition," in ICPR, 2002. [4] M. A. O. Vasilescu and D. Terzopoulos, "Multilinear Analysis of Image Ensembles: TensorFaces," in ECCV, 2002. [5] M. A. O. Vasilescu, "Human Motion Signatures: Analysis, Synthesis, Recognition," in ICPR (3), 2002, pp. 456-460.

Drawback of Vasilescu s method on action recognition Using point trajectories as features for representing actions. Instead, sillhouettes are more informative cues. Point Trajectories require accurate and expensive tracking methods, but silhouettes can be approximated through edgemaps, so are extracted more efficiently. Data tensor comprises three modes :actions, people and joint angles. We separate the modes regarding frames and pixels because they contain different types of information (without making the computation cost increase sensibly). In action recognition, they assumed the person to be known. They have used a very small motion capture database comprising three simple actions: walk, ascend stairs and descent stairs. No numerical evaluation of the results is provided.

Tensors Tensor: extend the concepts of vectors and matrices into higher orders. A I1... In... IN The order of tensor is N. An element of A is denoted as a i... i where n... i A 1 i 1 N n n mode n vectors of tensor : the n-dimensional vectors obtained by varying index i n while keeping the other indices fixed or the column vectors of matrix that results from flattening the tensor. A( n ) I

Flattening a tensor

Product of a tensor by a matrix B A M B MA n ( n) ( n)

N-mode SVD (HD-SVD) SVD: D U U T 1 2 SVD (in term of mode-n products): D U U 1 1 2 2 N-mode SVD: Core tensor D Z U U... U... U 1 1 2 2 n n N N Mode matrices

N-mode Action Video Analysis > form tensor D from the image ensembles: Scenario 1 (3 modes) Mode 1: pixels Mode 2: actions Mode 3: people Mode 1: pixels Scenario 2 (4 modes) Mode 2: frames Mode 3: actions Mode 4: people

N-mode Action Video Analysis For 3-mode scenario:

N-mode Action Video Analysis N-mode SVD: Data tensor D Z U U U U D B U 1 pixels 2 frames 3 actions 4 people 3 actions Basis tensor Action space embedded matrix Basis Tensor Computation: B Z U U U D 1 pixels 2 frames 4 people 3 U T actions

linear projections Index into the basis tensor for a particular t & p : B t, p Flatten along the action mode: B tp, (actions) For training frames y B x T a t, p(action) t, a, p x B y T t, a, p t, p(action) a therefore Given an unknown frame x, project it into a set of candidate embedded vectors for every t and p: T y t, p t, p(action) compare each t, pagainst the learned vectors a to find the action class in a nearest neighbor framework. y B y x

Experimental Results (Data Sets) Weizmann Database: A widely used database with a reasonable size Contains ten action classes performed by nine different human subjects. Actions include bending (bend), jumping jack (jack), jumping-forward-on-two-legs (jump), jumping-in-place-on-twolegs (pjump), running (run), galloping sideways (side), skipping (skip), walking (walk), waving-one-hand (wave1), and wavingtwo-hands (wave2).

Experimental Results (Data Sets) Weizmann Database:

Experimental Results (Preprocessing) We use the silhouettes provided All the silhouettes are centered and normalized into the same dimension (64 48) We find the sequence periods using [1] which uses absolute correlation between frames. In 3-mode scenario: We use the max period to select equal length subsequences. In 4-mode scenario: We warp all the sequences into the same temporal duration using bicubic interpolation technique. [1] R. Cutler and L. Davis, "Robust Real-Time Periodic Motion Detection, Analysis, and Applications," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, pp. 781-796, 2000.

Experimental Results 1-mode (PCA) 77.78% 3-mode 80.25% 4-mode 85.19% Neibles et al. (CVPR 2007) 72.8%