Efficient Trajectory Similarity Computation with Contrastive Learning

被引:14
|
作者
Deng, Liwei [1 ]
Zhao, Yan [2 ]
Fu, Zidan [1 ]
Sun, Hao [3 ]
Liu, Shuncheng [1 ]
Zheng, Kai [1 ]
机构
[1] Univ Elect Sci & Technol China, Chengdu, Peoples R China
[2] Aalborg Univ, Aalborg, Denmark
[3] Peking Univ, Beijing, Peoples R China
关键词
Trajectory Similarity Computation; Contrastive Learning; Efficiency;
D O I
10.1145/3511808.3557308
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The ubiquity of mobile devices and the accompanying deployment of sensing technologies have resulted in a massive amount of trajectory data. One important fundamental task is trajectory similarity computation, which is to determine how similar two trajectories are. To enable effective and efficient trajectory similarity computation, we propose a novel robust model, namely Contrastive Learning based Trajectory Similarity Computation (CL-TSim). Specifically, we employ a contrastive learning mechanism to learn the latent representations of trajectories and then calculate the dissimilarity between trajectories based on these representations. Compared with sequential auto-encoders that are the mainstream deep learning architectures for trajectory similarity computation, CL-TSim does not require a decoder and step-by-step reconstruction, thus improving the training efficiency significantly. Moreover, considering the non-uniform sampling rate and noisy points in trajectories, we adopt two type of augmentations, i.e., point dowm-sampling and point distorting, to enhance the robustness of the proposed model. Extensive experiments are conducted on two widely-used real-world datasets, i.e., Porto and ChengDu, which demonstrate the superior effectiveness and efficiency of the proposed model.
引用
收藏
页码:365 / 374
页数:10
相关论文
共 50 条
  • [31] Efficient ATR Using Contrastive Learning
    Purpura-Pontoniere, Attiano
    Imran, Abdullah-Al-Zubaer
    Bhattacharya, Tarun
    AUTOMATIC TARGET RECOGNITION XXXII, 2022, 12096
  • [32] Similarity contrastive estimation for image and video soft contrastive self-supervised learning
    Denize, Julien
    Rabarisoa, Jaonary
    Orcesi, Astrid
    Herault, Romain
    MACHINE VISION AND APPLICATIONS, 2023, 34 (06)
  • [33] An Efficient Computation for Energy Optimization of Robot Trajectory
    Li, Xiaobin
    Lan, Yunkun
    Jiang, Pei
    Cao, Huajun
    Zhou, Jin
    IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2022, 69 (11) : 11436 - 11446
  • [34] An Efficient Computation for Energy Optimization of Robot Trajectory
    Li, Xiaobin
    Lan, Yunkun
    Jiang, Pei
    Cao, Huajun
    Zhou, Jin
    AMERICAN JOURNAL OF CLINICAL NUTRITION, 2021, : 11436 - 11446
  • [35] Efficient Graph Similarity Computation with Alignment Regularization
    Zhuo, Wei
    Tan, Guang
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [36] Similarity contrastive estimation for image and video soft contrastive self-supervised learning
    Julien Denize
    Jaonary Rabarisoa
    Astrid Orcesi
    Romain Hérault
    Machine Vision and Applications, 2023, 34
  • [37] A bidirectional trajectory contrastive learning model for driving intention prediction
    Zhou, Yi
    Wang, Huxiao
    Ning, Nianwen
    Wang, Zhangyun
    Zhang, Yanyu
    Liu, Fuqiang
    COMPLEX & INTELLIGENT SYSTEMS, 2023, 9 (04) : 4301 - 4315
  • [38] Deep Learning Approaches for Similarity Computation: A Survey
    Yang, Peilun
    Wang, Hanchen
    Yang, Jianye
    Qian, Zhengping
    Zhang, Ying
    Lin, Xuemin
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (12) : 7893 - 7912
  • [39] Toward an accurate mobility trajectory recovery using contrastive learning
    Yushan LIU
    Yang CHEN
    Jiayun ZHANG
    Yu XIAO
    Xin WANG
    Frontiers of Information Technology & Electronic Engineering, 2024, 25 (11) : 1479 - 1497
  • [40] A bidirectional trajectory contrastive learning model for driving intention prediction
    Yi Zhou
    Huxiao Wang
    Nianwen Ning
    Zhangyun Wang
    Yanyu Zhang
    Fuqiang Liu
    Complex & Intelligent Systems, 2023, 9 : 4301 - 4315