Demo Data from EDBT 2026 / reviewers in the wild / expert
Zwe Naing
dblp:259/5212
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 2
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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Video understanding and tracking › activity recognition › procedural activity understanding
procedure learning |
0.4 | 1 | 2019 | Unsupervised Procedure Learning via Joint Dynamic Summarization · ICCV 2019 |
Computer vision › Video understanding and tracking
video summarization |
0.4 | 1 | 2019 | Unsupervised Procedure Learning via Joint Dynamic Summarization · ICCV 2019 |
Methods — techniques the papers use, named apart from their topics
submodular optimization · 0.4greedy algorithm · 0.4dynamic model · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Procedure Completion by Learning from Partial Summaries
Ehsan Elhamifar, Zwe Naing |
BMVC | 2 |
| 2019 | Unsupervised Procedure Learning via Joint Dynamic SummarizationabstractWe address the problem of unsupervised procedure learning from unconstrained instructional videos. Our goal is to produce a summary of the procedure key-steps and their ordering needed to perform a given task, as well as localization of the key-steps in videos. We develop a collaborative sequential subset selection framework, where we build a dynamic model on videos by learning states and transitions between them, where states correspond to different subactivities, including background and procedure steps. To extract procedure key-steps, we develop an optimization framework that finds a sequence of a small number of states that well represents all videos and is compatible with the state transition model. Given that our proposed optimization is non-convex and NP-hard, we develop a fast greedy algorithm whose complexity is linear in the length of the videos and the number of states of the dynamic model, hence, scales to large datasets. Under appropriate conditions on the transition model, our proposed formulation is approximately submodular, hence, comes with performance guarantees. We also present ProceL, a new multimodal dataset of 47.3 hours of videos and their transcripts from diverse tasks, for procedure learning evaluation. By extensive experiments, we show that our framework significantly improves the state of the art performance. Ehsan Elhamifar, Zwe Naing |
ICCV | 2 |