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

Langwen Hui

dblp:259/5410 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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
1 paper
Video understanding and tracking · 70% Deep learning architectures and training · 30%

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

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
action recognition
0.412019
Approximated Bilinear Modules for Temporal Modeling · ICCV 2019
Machine learning › Deep learning architectures and training
neural network module design
0.412019
Approximated Bilinear Modules for Temporal Modeling · ICCV 2019
Computer vision › Video understanding and tracking
temporal modeling
0.412019
Approximated Bilinear Modules for Temporal Modeling · ICCV 2019
Computer vision › Video understanding and tracking
video classification
0.112019
Approximated Bilinear Modules for Temporal Modeling · ICCV 2019

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

snippet sampling · 0.4bilinear pooling · 0.4
YearPublicationVenuePosition
2019 Approximated Bilinear Modules for Temporal Modeling
abstract
We consider two less-emphasized temporal properties of video: 1. Temporal cues are fine-grained; 2. Temporal modeling needs reasoning. To tackle both problems at once, we exploit approximated bilinear modules (ABMs) for temporal modeling. There are two main points making the modules effective: two-layer MLPs can be seen as a constraint approximation of bilinear operations, thus can be used to construct deep ABMs in existing CNNs while reusing pretrained parameters; frame features can be divided into static and dynamic parts because of visual repetition in adjacent frames, which enables temporal modeling to be more efficient. Multiple ABM variants and implementations are investigated, from high performance to high efficiency. Specifically, we show how two-layer subnets in CNNs can be converted to temporal bilinear modules by adding an auxiliary-branch. Besides, we introduce snippet sampling and shifting inference to boost sparse-frame video classification performance. Extensive ablation studies are conducted to show the effectiveness of proposed techniques. Our models can outperform most state-of-the-art methods on Something-Something v1 and v2 datasets without Kinetics pretraining, and are also competitive on other YouTube-like action recognition datasets. Our code is available on https://github.com/zhuxinqimac/abm-pytorch.
Xinqi Zhu, Chang Xu 0002, Langwen Hui, Cewu Lu, Dacheng Tao
ICCV3