Demo Data from SIGIR 2026 / reviewers in the wild / expert
Kunal B. Ranga
dblp:165/5164
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, 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.
| Computer graphics and multimedia
1 paper |
Multimedia analysis and retrieval · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Multimedia analysis and retrieval › video summarization
multi-view video summarization |
0.2 | 1 | 2015 | Multi-View Video Summarization Using Bipartite Matching Constrained Optimum-Path Forest Clustering · IEEE Trans. Multim. 2015 |
Multimedia analysis and retrieval
video summarization |
0.2 | 1 | 2015 | Multi-View Video Summarization Using Bipartite Matching Constrained Optimum-Path Forest Clustering · IEEE Trans. Multim. 2015 |
Multimedia analysis and retrieval › video content analysis
shot clustering |
0.1 | 1 | 2015 | Multi-View Video Summarization Using Bipartite Matching Constrained Optimum-Path Forest Clustering · IEEE Trans. Multim. 2015 |
Methods — techniques the papers use, named apart from their topics
optimum-path forest clustering · 0.2bipartite graph matching · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Multi-View Video Summarization Using Bipartite Matching Constrained Optimum-Path Forest ClusteringabstractThe task of multi-view video summarization is to efficiently represent the most significant information from a set of videos captured for a certain period of time by multiple cameras. The problem is highly challenging because of the huge size of the data, presence of many unimportant frames with low activity, inter-view dependencies, and significant variations in illumination. In this paper, we propose a graph-theoretic solution to the above problems. Semantic feature in form of visual bag of words and visual features like color, texture, and shape are used to model shot representative frames after temporal segmentation . Gaussian entropy is then applied to filter out frames with low activity. Inter-view dependencies are captured via bipartite graph matching. Finally, the optimum-path forest algorithm is applied for the clustering purpose. Subjective as well as objective evaluations clearly indicate the effectiveness of the proposed approach. Sanjay K. Kuanar, Kunal B. Ranga, Ananda S. Chowdhury |
IEEE Trans. Multim. | 2 |