EDBT 2026 Demo / reviewers in the wild / expert
Chundi Liu
dblp:209/9699
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, 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.
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 100% | |
| Artificial intelligence
1 paper |
Graph learning · 77% Representation and self-supervised learning · 23% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 50% Computational geometry · 50% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
image retrieval |
0.8 | 2 | 2019 | Guided Similarity Separation for Image Retrieval · NeurIPS 2019 Explore-Exploit Graph Traversal for Image Retrieval · CVPR 2019 |
Machine learning › Graph learning › graph neural network
graph convolutional network |
0.4 | 1 | 2019 | Guided Similarity Separation for Image Retrieval · NeurIPS 2019 |
Information retrieval › image retrieval › content-based image retrieval
graph-based image retrieval |
0.4 | 1 | 2019 | Explore-Exploit Graph Traversal for Image Retrieval · CVPR 2019 |
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning |
0.1 | 1 | 2019 | Guided Similarity Separation for Image Retrieval · NeurIPS 2019 |
Graph algorithms and graph theory
graph algorithms |
0.1 | 1 | 2019 | Explore-Exploit Graph Traversal for Image Retrieval · CVPR 2019 |
Computational geometry › proximity problems
nearest neighbor graph |
0.1 | 1 | 2019 | Explore-Exploit Graph Traversal for Image Retrieval · CVPR 2019 |
Methods — techniques the papers use, named apart from their topics
nearest neighbor graph · 0.8graph traversal · 0.8contrastive loss · 0.8clustering · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Explore-Exploit Graph Traversal for Image RetrievalabstractWe propose a novel graph-based approach for image retrieval. Given a nearest neighbor graph produced by the global descriptor model, we traverse it by alternating between exploit and explore steps. The exploit step maximally utilizes the immediate neighborhood of each vertex, while the explore step traverses vertices that are farther away in the descriptor space. By combining these two steps we can better capture the underlying image manifold, and successfully retrieve relevant images that are visually dissimilar to the query. Our traversal algorithm is conceptually simple, has few tunable parameters and can be implemented with basic data structures. This enables fast real-time inference for previously unseen queries with minimal memory overhead. Despite relative simplicity, we show highly competitive results on multiple public benchmarks, including the largest image retrieval dataset that is currently publicly available. Full code for this work is available here: https://github.com/layer6ai-labs/egt. Guangwei Yu, Chundi Liu, Maksims Volkovs |
CVPR | 3 |
| 2019 | Guided Similarity Separation for Image RetrievalabstractDespite recent progress in computer vision, image retrieval remains a challenging open problem. Numerous variations such as view angle, lighting and occlusion make it difficult to design models that are both robust and efficient. Many leading methods traverse the nearest neighbor graph to exploit higher order neighbor information and uncover the highly complex underlying manifold. In this work we propose a different approach where we leverage graph convolutional networks to directly encode neighbor information into image descriptors. We further leverage ideas from clustering and manifold learning, and introduce an unsupervised loss based on pairwise separation of image similarities. Empirically, we demonstrate that our model is able to successfully learn a new descriptor space that significantly improves retrieval accuracy, while still allowing efficient inner product inference. Experiments on five public benchmarks show highly competitive performance with up to 24\% relative improvement in mAP over leading baselines. Full code for this work is available here: https://github.com/layer6ai-labs/GSS. Chundi Liu, Guangwei Yu, Maksims Volkovs, Himanshu Rai, Junwei Ma, Satya Krishna Gorti |
NeurIPS | 1 |