VLDB 2026 Research / reviewers in the wild / expert
Ke Yan 0007
dblp:28/7692-7
· DBLP profile ↗
5ranked-venue papers
2as first author
3since 2021 · last 2021
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021
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
5 papers |
Graph learning · 32% Face, body and person analysis · 22% Image recognition and object detection · 21% | |
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 100% |
Topics — the 10 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Face, body and person analysis › person re-identification
vehicle re-identification |
0.8 | 2 | 2021 | Heterogeneous Relational Complement for Vehicle Re-identification · ICCV 2021 Exploiting Multi-grain Ranking Constraints for Precisely Searching Visually-similar Vehicles · ICCV 2017 |
Computer vision › Image recognition and object detection › image classification
fine-grained image classification |
0.6 | 2 | 2021 | Graph-Based High-Order Relation Discovery for Fine-Grained Recognition · CVPR 2021 Exploiting Multi-grain Ranking Constraints for Precisely Searching Visually-similar Vehicles · ICCV 2017 |
Machine learning › Learning paradigms
multi-label classification |
0.5 | 1 | 2021 | Transformer-based Dual Relation Graph for Multi-label Image Recognition · ICCV 2021 |
Machine learning › Graph learning › graph structure learning
relation graph learning |
0.5 | 1 | 2021 | Transformer-based Dual Relation Graph for Multi-label Image Recognition · ICCV 2021 |
Information retrieval › ranking
learning to rank |
0.3 | 1 | 2017 | Exploiting Multi-grain Ranking Constraints for Precisely Searching Visually-similar Vehicles · ICCV 2017 |
Information retrieval
ranking |
0.3 | 1 | 2017 | Exploiting Multi-grain Ranking Constraints for Precisely Searching Visually-similar Vehicles · ICCV 2017 |
Machine learning › Representation and self-supervised learning › visual representation
image representation |
0.2 | 1 | 2016 | CNN vs. SIFT for Image Retrieval: Alternative or Complementary? · ACM Multimedia 2016 |
Information retrieval
image retrieval |
0.2 | 1 | 2016 | CNN vs. SIFT for Image Retrieval: Alternative or Complementary? · ACM Multimedia 2016 |
Machine learning › Graph learning › relation modeling
graph-based relation modeling |
0.1 | 1 | 2021 | Graph-Based High-Order Relation Discovery for Fine-Grained Recognition · CVPR 2021 |
Computer vision › Vision and language › cross-modal alignment
visual-semantic embedding |
0.1 | 1 | 2021 | Transformer-based Dual Relation Graph for Multi-label Image Recognition · ICCV 2021 |
Methods — techniques the papers use, named apart from their topics
pairwise ranking · 0.6multi-task learning · 0.6list ranking · 0.6transformer · 0.5graph-based relation module · 0.5graph-based grouping · 0.5graph neural network · 0.5feature bank · 0.5convolutional neural network · 0.5attention mechanism · 0.5feature fusion · 0.2SIFT · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Graph-Based High-Order Relation Discovery for Fine-Grained RecognitionabstractFine-grained object recognition aims to learn effective features that can identify the subtle differences between visually similar objects. Most of the existing works tend to amplify discriminative part regions with attention mechanisms. Besides its unstable performance under complex backgrounds, the intrinsic interrelationship between different semantic features is less explored. Toward this end, we propose an effective graph-based relation discovery approach to build a contextual understanding of high-order relationships. In our approach, a high-dimensional feature bank is first formed and jointly regularized with semantic- and positional-aware high-order constraints, endowing rich attributes to feature representations. Second, to overcome the high-dimension curse, we propose a graph-based semantic grouping strategy to embed this high-order tensor bank into a low-dimensional space. Meanwhile, a group-wise learning strategy is proposed to regularize the features focusing on the cluster embedding center. With the collaborative learning of three modules, our module is able to grasp the stronger contextual details of fine-grained objects. Experimental evidence demonstrates our approach achieves new state-of-the-art on 4 widely-used fine-grained object recognition benchmarks. Yifan Zhao 0002, Ke Yan 0007, Feiyue Huang, Jia Li 0003 |
CVPR | 2 |
| 2021 | Transformer-based Dual Relation Graph for Multi-label Image RecognitionabstractThe simultaneous recognition of multiple objects in one image remains a challenging task, spanning multiple events in the recognition field such as various object scales, inconsistent appearances, and confused inter-class relationships. Recent research efforts mainly resort to the statistic label co-occurrences and linguistic word embedding to enhance the unclear semantics. Different from these researches, in this paper, we propose a novel Transformer-based Dual Relation learning framework, constructing complementary relationships by exploring two aspects of correlation, i.e., structural relation graph and semantic relation graph. The structural relation graph aims to capture long-range correlations from object context, by developing a cross-scale transformer-based architecture. The semantic graph dynamically models the semantic meanings of image objects with explicit semantic-aware constraints. In addition, we also incorporate the learnt structural relationship into the semantic graph, constructing a joint relation graph for robust representations. With the collaborative learning of these two effective relation graphs, our approach achieves new state-of-the-art on two popular multi-label recognition benchmarks, i.e. MS-COCO and VOC 2007 dataset. Ke Yan 0007, Yifan Zhao 0002, Feiyue Huang, Jia Li 0003 |
ICCV | 2 |
| 2021 | Heterogeneous Relational Complement for Vehicle Re-identificationabstractThe crucial problem in vehicle re-identification is to find the same vehicle identity when reviewing this object from cross-view cameras, which sets a higher demand for learning viewpoint-invariant representations. In this paper, we propose to solve this problem from two aspects: constructing robust feature representations and proposing camera-sensitive evaluations. We first propose a novel Heterogeneous Relational Complement Network (HRCN) by incorporating region-specific features and cross-level features as complements for the original high-level output. Considering the distributional differences and semantic misalignment, we propose graph-based relation modules to embed these heterogeneous features into one unified high-dimensional space. On the other hand, considering the deficiencies of cross-camera evaluations in existing measures (i.e., CMC and AP), we then propose a Cross-camera Generalization Measure (CGM) to improve the evaluations by introducing position-sensitivity and cross-camera generalization penalties. We further construct a new benchmark of existing models with our proposed CGM and experimental results reveal that our proposed HRCN model achieves new state-of-the-art in VeRi-776, VehicleID, and VERI-Wild. Jiajian Zhao, Yifan Zhao 0002, Jia Li 0003, Ke Yan 0007, Yonghong Tian 0001 |
ICCV | 4 |
| 2017 | Exploiting Multi-grain Ranking Constraints for Precisely Searching Visually-similar VehiclesabstractPrecise search of visually-similar vehicles poses a great challenge in computer vision, which needs to find exactly the same vehicle among a massive vehicles with visually similar appearances for a given query image. In this paper, we model the relationship of vehicle images as multiple grains. Following this, we propose two approaches to alleviate the precise vehicle search problem by exploiting multi-grain ranking constraints. One is Generalized Pairwise Ranking, which generalizes the conventional pairwise from considering only binary similar/dissimilar relations to multiple relations. The other is Multi-Grain based List Ranking, which introduces permutation probability to score a permutation of a multi-grain list, and further optimizes the ranking by the likelihood loss function. We implement the two approaches with multi-attribute classification in a multi-task deep learning framework. To further facilitate the research on precise vehicle search, we also contribute two high-quality and well-annotated vehicle datasets, named VD1 and VD2, which are collected from two different cities with diverse annotated attributes. As two of the largest publicly available precise vehicle search datasets, they contain 1,097,649 and 807,260 vehicle images respectively. Experimental results show that our approaches achieve the state-of-the-art performance on both datasets. Ke Yan 0007, Yonghong Tian 0001, Yaowei Wang 0001, Wei Zeng 0006, Tiejun Huang 0001 |
ICCV | 1 |
| 2016 | CNN vs. SIFT for Image Retrieval: Alternative or Complementary?abstractIn the past decade, SIFT is widely used in most vision tasks such as image retrieval. While in recent several years, deep convolutional neural networks (CNN) features achieve the state-of-the-art performance in several tasks such as image classification and object detection. Thus a natural question arises: for the image retrieval task, can CNN features substitute for SIFT? In this paper, we experimentally demonstrate that the two kinds of features are highly complementary. Following this fact, we propose an image representation model, complementary CNN and SIFT (CCS), to fuse CNN and SIFT in a multi-level and complementary way. In particular, it can be used to simultaneously describe scene-level, object-level and point-level contents in images. Extensive experiments are conducted on four image retrieval benchmarks, and the experimental results show that our CCS achieves state-of-the-art retrieval results. Ke Yan 0007, Yaowei Wang 0001, Dawei Liang, Tiejun Huang 0001, Yonghong Tian 0001 |
ACM Multimedia | 1 |