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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zimeng Luo

dblp:220/7734 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2023
0009-0006-6356-2782ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 2 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
2 papers
Representation and self-supervised learning · 50% Efficient and distributed learning · 33% Deep learning architectures and training · 17%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
self-supervised visual representation learning
1.322023
Semantics-Consistent Feature Search for Self-Supervised Visual Representation Learning · ICCV 2023
Multi-Mode Online Knowledge Distillation for Self-Supervised Visual Representation Learning · CVPR 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Semantics-Consistent Feature Search for Self-Supervised Visual Representation Learning · ICCV 2023
Machine learning › Deep learning architectures and training › data augmentation
feature-level augmentation
0.712023
Semantics-Consistent Feature Search for Self-Supervised Visual Representation Learning · ICCV 2023
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.712023
Multi-Mode Online Knowledge Distillation for Self-Supervised Visual Representation Learning · CVPR 2023
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
online knowledge distillation
0.712023
Multi-Mode Online Knowledge Distillation for Self-Supervised Visual Representation Learning · CVPR 2023

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

self-distillation · 0.7feature search · 0.7cross-distillation · 0.7cross-attention · 0.7contrastive learning · 0.7
YearPublicationVenuePosition
2023 Multi-Mode Online Knowledge Distillation for Self-Supervised Visual Representation Learning
abstract
Self-supervised learning (SSL) has made remarkable progress in visual representation learning. Some studies combine SSL with knowledge distillation (SSL-KD) to boost the representation learning performance of small models. In this study, we propose a Multi-mode Online Knowledge Distillation method (MOKD) to boost self-supervised visual representation learning. Different from existing SSL-KD methods that transfer knowledge from a static pre-trained teacher to a student, in MOKD, two different models learn collaboratively in a self-supervised manner. Specifically, MOKD consists of two distillation modes: self-distillation and cross-distillation modes. Among them, self-distillation performs self-supervised learning for each model independently, while cross-distillation realizes knowledge interaction between different models. In cross-distillation, a cross-attention feature search strategy is proposed to enhance the semantic feature alignment between different models. As a result, the two models can absorb knowledge from each other to boost their representation learning performance. Extensive experimental results on different backbones and datasets demonstrate that two heterogeneous models can benefit from MOKD and outperform their independently trained baseline. In addition, MOKD also outperforms existing SSL-KD methods for both the student and teacher models.
Kaiyou Song, Zimeng Luo
CVPR4
2023 Semantics-Consistent Feature Search for Self-Supervised Visual Representation Learning
abstract
In contrastive self-supervised learning, the common way to learn discriminative representation is to pull different augmented "views" of the same image closer while pushing all other images further apart, which has been proven to be effective. However, it is unavoidable to construct undesirable views containing different semantic concepts during the augmentation procedure. It would damage the semantic consistency of representation to pull these augmentations closer in the feature space indiscriminately. In this study, we introduce feature-level augmentation and propose a novel semantics-consistent feature search (SCFS) method to mitigate this negative effect. The main idea of SCFS is to adaptively search semantics-consistent features to enhance the contrast between semantics-consistent regions in different augmentations. Thus, the trained model can learn to focus on meaningful object regions, improving the semantic representation ability. Extensive experiments conducted on different datasets and tasks demonstrate that SCFS effectively improves the performance of self-supervised learning and achieves state-of-the-art performance on different downstream tasks.1
Kaiyou Song, Zimeng Luo
ICCV3
2018 Deep Unsupervised Domain Adaptation for Face Recognition
abstract
Face recognition is challenge task which involves determining the identity of facial images. With availability of a massive amount of labeled facial images gathered from Internet, deep convolution neural networks(DCNNs) have achieved great success in face recognition tasks. Those images are gathered from unconstrain environment, which contain people with different ethnicity, age, gender and so on. However, in the actual application scenario, the target face database may be gathered under different conditions compared with source training dataset, e.g. different ethnicity, different age distribution, disparate shooting environment. These factors increase domain discrepancy between source training database and target application database which makes the learnt model degenerate in target database. Meanwhile, for the target database where labeled data are lacking or unavailable, directly using target data to fine-tune pre-learnt model becomes intractable and impractical. In this paper, we adopt unsupervised transfer learning methods to address this issue. To alleviate the discrepancy between source and target face database and ensure the generalization ability of the model, we constrain the maximum mean discrepancy (MMD) between source database and target database and utilize the massive amount of labeled facial images of source database to training the deep neural network at the same time. We evaluate our method on two face recognition benchmarks and significantly enhance the performance without utilizing the target label.
Zimeng Luo, Jiani Hu, Weihong Deng, Haifeng Shen
FG1
2018 Local Subclass Constraint for Facial Expression Recognition in the Wild
abstract
The Automated Facial Expression Recognition (FER) in the wild is still a challenge problem. Currently, most of Deep Convolutional Neural Networks (DCNNs) based FER methods adopt softmax cross-entropy loss to encourage the separability of inter-class features. Many deep embedding approaches (e.g. contrastive loss, triplet loss, center loss) have been extended to the field of FER to enhance the discriminative ability of deep expression features and obtain the predictive effect. In this work, we present a novel deep embedding approach explicitly designed to respect the huge intra-class variation of expression features while learning discriminative expression features. We aim at forming a locally compact representation space structure through minimizing the distance between samples and their nearest subclass center. We demonstrate the effectiveness of this idea on RAF (Real-world Affective Faces) database. The experiment results show that our approaches can not only improve the classification performance but also adaptively learn a locally compact and expression intensity-aware feature space structure. We further extend our models to Static Facial Expressions in the Wild (SFEW) dataset and the results show the generalized ability of our approaches.
Zimeng Luo, Jiani Hu, Weihong Deng
ICPR1