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.

Zhihui Yin

dblp:365/5158 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Artificial intelligence
2 papers
Vision and language · 47% Representation and self-supervised learning · 41% Transfer learning and domain adaptation · 12%
Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › object storage
cloud object store
0.912025
Mantle: Efficient Hierarchical Metadata Management for Cloud Object Storage Services · SOSP 2025
Storage systems
distributed storage
0.912025
Mantle: Efficient Hierarchical Metadata Management for Cloud Object Storage Services · SOSP 2025
Storage systems
metadata management
0.912025
Mantle: Efficient Hierarchical Metadata Management for Cloud Object Storage Services · SOSP 2025
Computer vision › Vision and language
vision-language model
0.812024
Retrieval Across Any Domains via Large-scale Pre-trained Model · ICML 2024
Information retrieval
cross-modal retrieval
0.812024
Asymmetric Mutual Alignment for Unsupervised Zero-Shot Sketch-Based Image Retrieval · AAAI 2024
Information retrieval
image retrieval
0.812024
Asymmetric Mutual Alignment for Unsupervised Zero-Shot Sketch-Based Image Retrieval · AAAI 2024
Information retrieval › image retrieval
sketch-based image retrieval
0.812024
Asymmetric Mutual Alignment for Unsupervised Zero-Shot Sketch-Based Image Retrieval · AAAI 2024
Information retrieval › image retrieval › sketch-based image retrieval
zero-shot sketch-based image retrieval
0.812024
Asymmetric Mutual Alignment for Unsupervised Zero-Shot Sketch-Based Image Retrieval · AAAI 2024
Multimedia analysis and retrieval › image retrieval
cross-domain image retrieval
0.812024
Retrieval Across Any Domains via Large-scale Pre-trained Model · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning › metric learning
deep metric learning
0.712023
Learning with Diversity: Self-Expanded Equalization for Better Generalized Deep Metric Learning · ICCV 2023
Machine learning › Transfer learning and domain adaptation
domain generalization
0.212023
Learning with Diversity: Self-Expanded Equalization for Better Generalized Deep Metric Learning · ICCV 2023

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

non-euclidean projection · 1.5domain adaptation · 1.5vision-language pretraining · 0.8vision-language pre-training · 0.8self-distillation · 0.8mutual alignment · 0.8contrastive learning · 0.8self-expanded equalization · 0.7proxy-based loss · 0.7min-max strategy · 0.7
YearPublicationVenuePosition
2025 Mantle: Efficient Hierarchical Metadata Management for Cloud Object Storage Services
Biao Cao, Jielong Jian, Cheng Li 0001, Sen Han, Yiduo Wang 0002, Yufei Wu 0011, Kang Chen 0001, Zhihui Yin, Jiwei Xiong, Jie Zhao 0020, Liguo Duan, Miao Yu 0029, Feng Wu 0001, Xianjun Meng
SOSP9
2024 Asymmetric Mutual Alignment for Unsupervised Zero-Shot Sketch-Based Image Retrieval
abstract
In recent years, many methods have been proposed to address the zero-shot sketch-based image retrieval (ZS-SBIR) task, which is a practical problem in many applications. However, in real-world scenarios, on the one hand, we can not obtain training data with the same distribution as the test data, and on the other hand, the labels of training data are not available as usual. To tackle this issue, we focus on a new problem, namely unsupervised zero-shot sketch-based image retrieval (UZS-SBIR), where the available training data does not have labels while the training and testing categories are not overlapping. In this paper, we introduce a new asymmetric mutual alignment method (AMA) including a self-distillation module and a cross-modality mutual alignment module. First, we conduct self-distillation to extract the feature embeddings from unlabeled data. Due to the lack of available information in an unsupervised manner, we employ the cross-modality mutual alignment module to further excavate underlying intra-modality and inter-modality relationships from unlabeled data, and take full advantage of these correlations to align the feature embeddings in image and sketch domains. Meanwhile, the feature representations are enhanced by the intra-modality clustering relations, leading to better generalization ability to unseen classes. Moreover, we conduct an asymmetric strategy to update the teacher and student networks, respectively. Extensive experimental results on several benchmark datasets demonstrate the superiority of our method.
Zhihui Yin, Jiexi Yan, Cheng Deng 0002
AAAI1
2024 Retrieval Across Any Domains via Large-scale Pre-trained Model
abstract
In order to enhance the generalization ability towards unseen domains, universal cross-domain image retrieval methods require a training dataset encompassing diverse domains, which is costly to assemble. Given this constraint, we introduce a novel problem of data-free adaptive cross-domain retrieval, eliminating the need for real images during training. Towards this goal, we propose a novel Text-driven Knowledge Integration (TKI) method, which exclusively utilizes a pre-trained vision-language model to implement an “aggregation after expansion" training strategy. Specifically, we extract diverse implicit domain-specific information through a set of learnable domain word vectors. Subsequently, a domain-agnostic universal projection, equipped with a non-Euclidean multi-layer perceptron, can be optimized using these assorted text descriptions through the text-proxied domain aggregation. Leveraging the cross-modal transferability phenomenon of the shared latent space, we can integrate the trained domain-agnostic universal projection with the pre-trained visual encoder to extract the features of the input image for the following retrieval during testing. Extensive experimental results on several benchmark datasets demonstrate the superiority of our method.
Jiexi Yan, Zhihui Yin, Cheng Deng 0002, Heng Huang 0001
ICML2
2023 Learning with Diversity: Self-Expanded Equalization for Better Generalized Deep Metric Learning
abstract
Exploring good generalization ability is essential in deep metric learning (DML). Most existing DML methods focus on improving the model robustness against category shift to keep the performance on unseen categories. However, in addition to category shift, domain shift also widely exists in real-world scenarios. Therefore, learning better generalization ability for the DML model is still a challenging yet realistic problem. In this paper, we propose a new self-expanded equalization (SEE) method to effectively generalize the DML model to both unseen categories and domains. Specifically, we take a ‘min-max’ strategy combined with a proxy-based loss to adaptively augment diverse out-of-distribution samples that vastly expand the span of original training data. To take full advantage of the implicit cross-domain relations between source and augmented samples, we introduce a domain-aware equalization module to induce the domain-invariant distance metric by regularizing the feature distribution in the metric space. Extensive experiments on two benchmarks and a large-scale multi-domain dataset demonstrate the superiority of our SEE over the existing DML methods.
Jiexi Yan, Zhihui Yin, Erkun Yang, Yanhua Yang, Heng Huang 0001
ICCV2