60,704 research outputs found
Holistic Graph-based Motion Prediction
Motion prediction for automated vehicles in complex environments is a
difficult task that is to be mastered when automated vehicles are to be used in
arbitrary situations. Many factors influence the future motion of traffic
participants starting with traffic rules and reaching from the interaction
between each other to personal habits of human drivers. Therefore we present a
novel approach for a graph-based prediction based on a heterogeneous holistic
graph representation that combines temporal information, properties and
relations between traffic participants as well as relations with static
elements like the road network. The information are encoded through different
types of nodes and edges that both are enriched with arbitrary features. We
evaluated the approach on the INTERACTION and the Argoverse dataset and
conducted an informative ablation study to demonstrate the benefit of different
types of information for the motion prediction quality.Comment: Accepted on ICRA 202
Automated Dilated Spatio-Temporal Synchronous Graph Modeling for Traffic Prediction
Accurate traffic prediction is a challenging task in intelligent
transportation systems because of the complex spatio-temporal dependencies in
transportation networks. Many existing works utilize sophisticated temporal
modeling approaches to incorporate with graph convolution networks (GCNs) for
capturing short-term and long-term spatio-temporal dependencies. However, these
separated modules with complicated designs could restrict effectiveness and
efficiency of spatio-temporal representation learning. Furthermore, most
previous works adopt the fixed graph construction methods to characterize the
global spatio-temporal relations, which limits the learning capability of the
model for different time periods and even different data scenarios. To overcome
these limitations, we propose an automated dilated spatio-temporal synchronous
graph network, named Auto-DSTSGN for traffic prediction. Specifically, we
design an automated dilated spatio-temporal synchronous graph (Auto-DSTSG)
module to capture the short-term and long-term spatio-temporal correlations by
stacking deeper layers with dilation factors in an increasing order. Further,
we propose a graph structure search approach to automatically construct the
spatio-temporal synchronous graph that can adapt to different data scenarios.
Extensive experiments on four real-world datasets demonstrate that our model
can achieve about 10% improvements compared with the state-of-art methods.
Source codes are available at https://github.com/jinguangyin/Auto-DSTSGN
Robust Modeling of Epistemic Mental States
This work identifies and advances some research challenges in the analysis of
facial features and their temporal dynamics with epistemic mental states in
dyadic conversations. Epistemic states are: Agreement, Concentration,
Thoughtful, Certain, and Interest. In this paper, we perform a number of
statistical analyses and simulations to identify the relationship between
facial features and epistemic states. Non-linear relations are found to be more
prevalent, while temporal features derived from original facial features have
demonstrated a strong correlation with intensity changes. Then, we propose a
novel prediction framework that takes facial features and their nonlinear
relation scores as input and predict different epistemic states in videos. The
prediction of epistemic states is boosted when the classification of emotion
changing regions such as rising, falling, or steady-state are incorporated with
the temporal features. The proposed predictive models can predict the epistemic
states with significantly improved accuracy: correlation coefficient (CoERR)
for Agreement is 0.827, for Concentration 0.901, for Thoughtful 0.794, for
Certain 0.854, and for Interest 0.913.Comment: Accepted for Publication in Multimedia Tools and Application, Special
Issue: Socio-Affective Technologie
Same but Different: Distant Supervision for Predicting and Understanding Entity Linking Difficulty
Entity Linking (EL) is the task of automatically identifying entity mentions
in a piece of text and resolving them to a corresponding entity in a reference
knowledge base like Wikipedia. There is a large number of EL tools available
for different types of documents and domains, yet EL remains a challenging task
where the lack of precision on particularly ambiguous mentions often spoils the
usefulness of automated disambiguation results in real applications. A priori
approximations of the difficulty to link a particular entity mention can
facilitate flagging of critical cases as part of semi-automated EL systems,
while detecting latent factors that affect the EL performance, like
corpus-specific features, can provide insights on how to improve a system based
on the special characteristics of the underlying corpus. In this paper, we
first introduce a consensus-based method to generate difficulty labels for
entity mentions on arbitrary corpora. The difficulty labels are then exploited
as training data for a supervised classification task able to predict the EL
difficulty of entity mentions using a variety of features. Experiments over a
corpus of news articles show that EL difficulty can be estimated with high
accuracy, revealing also latent features that affect EL performance. Finally,
evaluation results demonstrate the effectiveness of the proposed method to
inform semi-automated EL pipelines.Comment: Preprint of paper accepted for publication in the 34th ACM/SIGAPP
Symposium On Applied Computing (SAC 2019
- …