Pedestrian trajectory prediction with convolutional neural networksVisa övriga samt affilieringar
2022 (Engelska)Ingår i: Pattern Recognition, ISSN 0031-3203, E-ISSN 1873-5142, Vol. 121, artikel-id 108252Artikel i tidskrift (Refereegranskat) Published
Abstract [en]
Predicting the future trajectories of pedestrians is a challenging problem that has a range of application, from crowd surveillance to autonomous driving. In literature, methods to approach pedestrian trajectory prediction have evolved, transitioning from physics-based models to data-driven models based on recurrent neural networks. In this work, we propose a new approach to pedestrian trajectory prediction, with the introduction of a novel 2D convolutional model. This new model outperforms recurrent models, and it achieves state-of-the-art results on the ETH and TrajNet datasets. We also present an effective system to represent pedestrian positions and powerful data augmentation techniques, such as the addition of Gaussian noise and the use of random rotations, which can be applied to any model. As an additional exploratory analysis, we present experimental results on the inclusion of occupancy methods to model social information, which empirically show that these methods are ineffective in capturing social interaction.
Ort, förlag, år, upplaga, sidor
Elsevier BV , 2022. Vol. 121, artikel-id 108252
Nyckelord [en]
Convolutional neural networks, Pedestrian prediction, Trajectory prediction, Convolution, Gaussian noise (electronic), Recurrent neural networks, Trajectories, Autonomous driving, Convolutional neural network, Crowd surveillance, Data driven modelling, Model-based OPC, Neural-networks, Pedestrian trajectories, Physics-based modeling, Forecasting
Nationell ämneskategori
Datorgrafik och datorseende
Identifikatorer
URN: urn:nbn:se:kth:diva-311167DOI: 10.1016/j.patcog.2021.108252ISI: 000697551500006Scopus ID: 2-s2.0-85113188585OAI: oai:DiVA.org:kth-311167DiVA, id: diva2:1658673
Anmärkning
QC 20220517
2022-05-172022-05-172025-02-07Bibliografiskt granskad