Linear and Deep Order-Preserving Wasserstein Discriminant Analysis

被引:3
作者
Su, Bing [1 ]
Zhou, Jiahuan [2 ]
Wen, Ji-Rong [1 ]
Wu, Ying [2 ]
机构
[1] Renmin Univ China, Beijing Key Lab Big Data Management & Anal Method, Gaoling Sch Artificial Intelligence, Beijing 100872, Peoples R China
[2] Northwestern Univ, Dept Elect & Comp Engn, Evanston, IL 60208 USA
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Hidden Markov models; Feature extraction; Dimensionality reduction; Three-dimensional displays; Joints; Training; Distortion measurement; Optimal transport; order-preserving Wasserstein distance; barycenter; dimensionality reduction; sequence classification; ACTION RECOGNITION; LDA;
D O I
10.1109/TPAMI.2021.3050750
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Supervised dimensionality reduction for sequence data learns a transformation that maps the observations in sequences onto a low-dimensional subspace by maximizing the separability of sequences in different classes. It is typically more challenging than conventional dimensionality reduction for static data, because measuring the separability of sequences involves non-linear procedures to manipulate the temporal structures. In this paper, we propose a linear method, called order-preserving Wasserstein discriminant analysis (OWDA), and its deep extension, namely DeepOWDA, to learn linear and non-linear discriminative subspace for sequence data, respectively. We construct novel separability measures between sequence classes based on the order-preserving Wasserstein (OPW) distance to capture the essential differences among their temporal structures. Specifically, for each class, we extract the OPW barycenter and construct the intra-class scatter as the dispersion of the training sequences around the barycenter. The inter-class distance is measured as the OPW distance between the corresponding barycenters. We learn the linear and non-linear transformations by maximizing the inter-class distance and minimizing the intra-class scatter. In this way, the proposed OWDA and DeepOWDA are able to concentrate on the distinctive differences among classes by lifting the geometric relations with temporal constraints. Experiments on four 3D action recognition datasets show the effectiveness of OWDA and DeepOWDA.
引用
收藏
页码:3123 / 3138
页数:16
相关论文
共 86 条
  • [1] Baradel F., 2017, ARXIV 170310106
  • [2] Bauschke HH., 2000, OPTIMIZATION, V48, P409, DOI DOI 10.1080/02331930008844513
  • [3] Coding Kendall's Shape Trajectories for 3D Action Recognition
    Ben Tanfous, Amor
    Drira, Hassen
    Ben Amor, Boulbaba
    [J]. 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 2840 - 2849
  • [4] ITERATIVE BREGMAN PROJECTIONS FOR REGULARIZED TRANSPORTATION PROBLEMS
    Benamou, Jean-David
    Carlier, Guillaume
    Cuturi, Marco
    Nenna, Luca
    Peyre, Gabriel
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2015, 37 (02) : A1111 - A1138
  • [5] Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction
    Bian, Wei
    Tao, Dacheng
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (05) : 1037 - 1050
  • [6] Bregman LM., 1967, USSR COMP MATH MATH, V7, P200, DOI DOI 10.1016/0041-5553(67)90040-7
  • [7] SkeleMotion: A New Representation of Skeleton Joint Sequences Based on Motion Information for 3D Action Recognition
    Caetano, Carlos
    Sena, Jessica
    Bremond, Francois
    dos Santos, Jefersson A.
    Schwartz, William Robson
    [J]. 2019 16TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED VIDEO AND SIGNAL BASED SURVEILLANCE (AVSS), 2019,
  • [8] Cavazza J, 2016, INT C PATT RECOG, P408, DOI 10.1109/ICPR.2016.7899668
  • [9] A new LDA-based face recognition system which can solve the small sample size problem
    Chen, LF
    Liao, HYM
    Ko, MT
    Lin, JC
    Yu, GJ
    [J]. PATTERN RECOGNITION, 2000, 33 (10) : 1713 - 1726
  • [10] Non-Linear Temporal Subspace Representations for Activity Recognition
    Cherian, Anoop
    Sra, Suvrit
    Gould, Stephen
    Hartley, Richard
    [J]. 2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 2197 - 2206