Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yu-Ke Li

dblp:304/1278 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Autonomous driving · 27% Video understanding and tracking · 24% Graph learning · 24%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Autonomous driving › trajectory prediction
multi-agent trajectory prediction
0.612022
ELMA: Energy-Based Learning for Multi-Agent Activity Forecasting · AAAI 2022
Robotics › Autonomous driving
trajectory prediction
0.612022
ELMA: Energy-Based Learning for Multi-Agent Activity Forecasting · AAAI 2022
Computer vision › Video understanding and tracking
action anticipation
0.512021
Imitative Learning for Multi-Person Action Forecasting · ACM Multimedia 2021
Machine learning › Graph learning › relation modeling
graph-based context modeling
0.512021
Imitative Learning for Multi-Person Action Forecasting · ACM Multimedia 2021
Machine learning › Reinforcement learning › imitation learning
inverse reinforcement learning
0.512021
Imitative Learning for Multi-Person Action Forecasting · ACM Multimedia 2021
Computer vision › Video understanding and tracking › action anticipation
multi-person action forecasting
0.512021
Imitative Learning for Multi-Person Action Forecasting · ACM Multimedia 2021
Machine learning › Graph learning › graph reasoning
spatio-temporal graph reasoning
0.512021
Imitative Learning for Multi-Person Action Forecasting · ACM Multimedia 2021

Methods — techniques the papers use, named apart from their topics

maximum likelihood estimation · 0.6graph-based representation · 0.6energy-based learning · 0.6latent variable extrapolation · 0.5inverse reinforcement learning · 0.5imitative learning · 0.5
YearPublicationVenuePosition
2022 ELMA: Energy-Based Learning for Multi-Agent Activity Forecasting
abstract
This paper describes an energy-based learning method that predicts the activities of multiple agents simultaneously. It aims to forecast both upcoming actions and paths of all agents in a scene based on their past activities, which can be jointly formulated by a probabilistic model over time. Learning this model is challenging because: 1) it has a large number of time-dependent variables that must scale with the forecast horizon and the number of agents; 2) distribution functions have to contain multiple modes in order to capture the spatio-temporal complexities of each agent's activities. To address these challenges, we put forth a novel Energy-based Learning approach for Multi-Agent activity forecasting (ELMA) to estimate this complex model via maximum log-likelihood estimation. Specifically, by sampling from a sequence of factorized marginalized multi-model distributions, ELMA generates most possible future actions efficiently. Moreover, by graph-based representations, ELMA also explicitly resolves the spatio-temporal dependencies of all agents' activities in a single pass. Our experiments on two large-scale datasets prove that ELMA outperforms recent leading studies by an obvious margin.
Yu-Ke Li, Lixiong Chen, Zheng Wang 0007, Ching-Yao Chan
AAAI1
2021 Imitative Learning for Multi-Person Action Forecasting
abstract
Multi-person action forecasting is an emerging task and a pivotal step towards video understanding. The major challenge lies in estimating a distribution characterizing the upcoming actions of all individuals in the scene. The state-of-the-art solutions attempt to solve this problem via a step-by-step prediction procedure. However, they are not adequate to address some particular limitations, such as the compounding errors, the innate uncertainty of the future and the spatio-temporal contexts. To handle the multi-person action forecasting challenges, we put forth a novel imitative learning framework upon the basis of inverse reinforcement learning. Specifically, we aim to learn a policy to model the aforementioned distribution up to a coming horizon through an objective that naturally solves the compounding errors. Such a policy is able to explore multiple plausible futures via extrapolating a series of latent variables and taking them into account to generate predictions. The impacts of these latent variables are further investigated by optimizing the directed information. Moreover, we reason the spatial context along with the temporal cue in a single pass with the usage of graph structural data. The experimental outcomes on two large-scale datasets reveal that our approach yields considerable improvements in terms of both diversity and quality with respect to recent leading studies.
Yu-Ke Li, Mang Ye, Ching-Yao Chan
ACM Multimedia1
2015 Social interaction based handling inter-person occlusion for online multi-pedestrian tracking
abstract
How to deal with occlusion among persons plays important role in robust multi-pedestrian tracking field. This paper proposes to handle inter-person occlusion by introducing social interaction - attraction and grouping from 2D image plane. This social interaction is systematically studied based on spatial-temporal information without utilizing any scene knowledge. Attraction is integrated into hierarchical data-association as a penalizing factor, while grouping is used to aid target's motion dynamic. The comparison experimental results show that our method achieves results on par with, even better than state-of-the-art online tracking methods.
Yu-Ke Li, Weiming Shen 0002
AVSS1