Social Interpretable Tree for Pedestrian Trajectory Prediction

被引:0
作者
Shi, Liushuai [1 ]
Wang, Le [2 ]
Long, Chengjiang [3 ]
Zhou, Sanping [2 ]
Zheng, Fang [1 ]
Zheng, Nanning [2 ]
Hua, Gang [4 ]
机构
[1] Xi An Jiao Tong Univ, Sch Software Engn, Xian, Peoples R China
[2] Xi An Jiao Tong Univ, Inst Artificial Intelligence & Robot, Xian, Peoples R China
[3] JD Finance Amer Corp, Mountain View, CA USA
[4] Wormpex AI Res, Bellevue, WA USA
来源
THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2022年
基金
中国博士后科学基金; 国家重点研发计划;
关键词
NETWORK;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Understanding the multiple socially-acceptable future behaviors is an essential task for many vision applications. In this paper, we propose a tree-based method, termed as Social Interpretable Tree (SIT), to address this multi-modal prediction task, where a hand-crafted tree is built depending on the prior information of observed trajectory to model multiple future trajectories. Specifically, a path in the tree from the root to leaf represents an individual possible future trajectory. SIT employs a coarse-to-fine optimization strategy, in which the tree is first built by high-order velocity to balance the complexity and coverage of the tree and then optimized greedily to encourage multimodality. Finally, a teacher-forcing refining operation is used to predict the final fine trajectory. Compared with prior methods which leverage implicit latent variables to represent possible future trajectories, the path in the tree can explicitly explain the rough moving behaviors (e.g., go straight and then turn right), and thus provides better interpretability. Despite the hand-crafted tree, the experimental results on ETH-UCY and Stanford Drone datasets demonstrate that our method is capable of matching or exceeding the performance of state-of-the-art methods. Interestingly, the experiments show that the raw built tree without training outperforms many prior deep neural network based approaches. Meanwhile, our method presents sufficient flexibility in long-term prediction and different best-of-K predictions.
引用
收藏
页码:2235 / 2243
页数:9
相关论文
共 46 条
  • [41] Shadow Inpainting and Removal Using Generative Adversarial Networks with Slice Convolutions
    Wei, Jinjiang
    Long, Chengjiang
    Zou, Hua
    Xiao, Chunxia
    [J]. COMPUTER GRAPHICS FORUM, 2019, 38 (07) : 381 - 392
  • [42] A Learning Algorithm for Continually Running Fully Recurrent Neural Networks
    Williams, Ronald J.
    Zipser, David
    [J]. NEURAL COMPUTATION, 1989, 1 (02) : 270 - 280
  • [43] Xu W., 2021, ICCV
  • [44] Monte Carlo Denoising via Auxiliary Feature Guided Self-Attention
    Yu, Jiaqi
    Nie, Yongwei
    Long, Chengjiang
    Xu, Wenju
    Zhang, Qing
    Li, Guiqing
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2021, 40 (06):
  • [45] Zhang LH, 2020, AAAI CONF ARTIF INTE, V34, P9539
  • [46] Zhang P., 2019, CVPR, P12085