Demo Data from EDBT 2026 / reviewers in the wild / expert
Yingying Hua
dblp:226/6564
· DBLP profile ↗
10ranked-venue papers
3as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 8 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 3 · 1 since 2021Computer networks · 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.
| Artificial intelligence
6 papers |
Trustworthy machine learning · 47% Efficient and distributed learning · 21% Representation and self-supervised learning · 9% | |
| Network and information security
1 paper |
Digital forensics and information hiding · 100% | |
| Computer graphics and multimedia
1 paper |
Multimedia analysis and retrieval · 100% |
Topics — the 17 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
1.0 | 2 | 2023 | Learning Patch-Channel Correspondence for Interpretable Face Forgery Detection · IEEE Trans. Image Process. 2023 Defending Against Adversarial Examples via Soft Decision Trees Embedding · ACM Multimedia 2019 |
Machine learning › Trustworthy machine learning › interpretability › explainable AI
interpretable deep learning |
0.7 | 1 | 2023 | Learning Patch-Channel Correspondence for Interpretable Face Forgery Detection · IEEE Trans. Image Process. 2023 |
Digital forensics and information hiding
digital forensics |
0.7 | 1 | 2023 | Learning Patch-Channel Correspondence for Interpretable Face Forgery Detection · IEEE Trans. Image Process. 2023 |
Digital forensics and information hiding › forgery detection
face forgery detection |
0.7 | 1 | 2023 | Learning Patch-Channel Correspondence for Interpretable Face Forgery Detection · IEEE Trans. Image Process. 2023 |
Machine learning › Representation and self-supervised learning › representation learning
spatio-temporal representation learning |
0.6 | 1 | 2022 | Deepfake Video Detection with Spatiotemporal Dropout Transformer · ACM Multimedia 2022 |
Multimedia analysis and retrieval
deepfake detection |
0.6 | 1 | 2022 | Deepfake Video Detection with Spatiotemporal Dropout Transformer · ACM Multimedia 2022 |
Multimedia analysis and retrieval › deepfake detection
deepfake video detection |
0.6 | 1 | 2022 | Deepfake Video Detection with Spatiotemporal Dropout Transformer · ACM Multimedia 2022 |
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
0.4 | 1 | 2020 | Look One and More: Distilling Hybrid Order Relational Knowledge for Cross-Resolution Image Recognition · AAAI 2020 |
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels |
0.4 | 1 | 2020 | Coupled-View Deep Classifier Learning from Multiple Noisy Annotators · AAAI 2020 |
Computer vision › Image recognition and object detection › visual recognition
low-resolution image recognition |
0.4 | 1 | 2020 | Look One and More: Distilling Hybrid Order Relational Knowledge for Cross-Resolution Image Recognition · AAAI 2020 |
Machine learning › Efficient and distributed learning
model compression |
0.4 | 1 | 2020 | Distilling Channels for Efficient Deep Tracking · IEEE Trans. Image Process. 2020 |
Computer vision › Video understanding and tracking
object tracking |
0.4 | 1 | 2020 | Distilling Channels for Efficient Deep Tracking · IEEE Trans. Image Process. 2020 |
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
relational knowledge distillation |
0.4 | 1 | 2020 | Look One and More: Distilling Hybrid Order Relational Knowledge for Cross-Resolution Image Recognition · AAAI 2020 |
Machine learning › Trustworthy machine learning › adversarial machine learning
adversarial defense |
0.4 | 1 | 2019 | Defending Against Adversarial Examples via Soft Decision Trees Embedding · ACM Multimedia 2019 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.4 | 1 | 2019 | Defending Against Adversarial Examples via Soft Decision Trees Embedding · ACM Multimedia 2019 |
Machine learning › Kernel, tree and ensemble methods › decision tree
soft decision tree |
0.4 | 1 | 2019 | Defending Against Adversarial Examples via Soft Decision Trees Embedding · ACM Multimedia 2019 |
Computer vision › Face, body and person analysis
face recognition |
0.1 | 1 | 2020 | Look One and More: Distilling Hybrid Order Relational Knowledge for Cross-Resolution Image Recognition · AAAI 2020 |
Methods — techniques the papers use, named apart from their topics
patch-channel alignment · 1.3feature reorganization · 1.3channel-wise decorrelation · 1.3vision transformer · 1.1spatiotemporal dropout · 1.1data augmentation · 1.1teacher-student learning · 0.4hybrid order relational knowledge distillation · 0.4coupled-view learning · 0.4co-teaching · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | CMCN: Chinese medical concept normalization using continual learning and knowledge-enhanced
Pu Han, Yule Zhong, Liang Gu, Yingying Hua |
Artif. Intell. Medicine | 6 |
| 2023 | Learning Patch-Channel Correspondence for Interpretable Face Forgery DetectionabstractBeyond high accuracy, good interpretability is very critical to deploy a face forgery detection model for visual content analysis. In this paper, we propose learning patch-channel correspondence to facilitate interpretable face forgery detection. Patch-channel correspondence aims to transform the latent features of a facial image into multi-channel interpretable features where each channel mainly encoders a corresponding facial patch. Towards this end, our approach embeds a feature reorganization layer into a deep neural network and simultaneously optimizes classification task and correspondence task via alternate optimization. The correspondence task accepts multiple zero-padding facial patch images and represents them into channel-aware interpretable representations. The task is solved by step-wisely learning channel-wise decorrelation and patch-channel alignment. Channel-wise decorrelation decouples latent features for class-specific discriminative channels to reduce feature complexity and channel correlation, while patch-channel alignment then models the pairwise correspondence between feature channels and facial patches. In this way, the learned model can automatically discover corresponding salient features associated to potential forgery regions during inference, providing discriminative localization of visualized evidences for face forgery detection while maintaining high detection accuracy. Extensive experiments on popular benchmarks clearly demonstrate the effectiveness of the proposed approach in interpreting face forgery detection without sacrificing accuracy. The source code is available at https://github.com/Jae35/IFFD. Yingying Hua, Ruixin Shi, Shiming Ge |
IEEE Trans. Image Process. | 1 |
| 2022 | Deepfake Video Detection with Spatiotemporal Dropout TransformerabstractWhile the abuse of deepfake technology has caused serious concerns recently, how to detect deepfake videos is still a challenge due to the high photo-realistic synthesis of each frame. Existing image-level approaches often focus on single frame and ignore the spatiotemporal cues hidden in deepfake videos, resulting in poor generalization and robustness. The key of a video-level detector is to fully exploit the spatiotemporal inconsistency distributed in local facial regions across different frames in deepfake videos. Inspired by that, this paper proposes a simple yet effective patch-level approach to facilitate deepfake video detection via spatiotemporal dropout transformer. The approach reorganizes each input video into bag of patches that is then fed into a vision transformer to achieve robust representation. Specifically, a spatiotemporal dropout operation is proposed to fully explore patch-level spatiotemporal cues and serve as effective data augmentation to further enhance model's robustness and generalization ability. The operation is flexible and can be easily plugged into existing vision transformers. Extensive experiments demonstrate the effectiveness of our approach against 25 state-of-the-arts with impressive robustness, generalizability, and representation ability. Daichi Zhang, Fanzhao Lin, Yingying Hua, Dan Zeng 0001, Shiming Ge |
ACM Multimedia | 3 |
| 2021 | Interpret The Predictions Of Deep Networks Via Re-Label DistillationabstractInterpreting the predictions of a black-box deep network can facilitate the reliability of its deployment. In this work, we propose a re-label distillation approach to learn a direct map from the input to the prediction in a self-supervision manner. The image is projected into a VAE subspace to generate some synthetic images by randomly perturbing its latent vector. Then, these synthetic images can be annotated into one of two classes by identifying whether their labels shift. After that, using the labels annotated by the deep network as teacher, a linear student model is trained to approximate the annotations by mapping these synthetic images to the classes. In this manner, these re-labeled synthetic images can well describe the local classification mechanism of the deep network, and the learned student can provide a more intuitive explanation towards the predictions. Extensive experiments verify the effectiveness of our approach qualitatively and quantitatively. Yingying Hua, Shiming Ge, Daichi Zhang |
ICME | 1 |
| 2020 | Look One and More: Distilling Hybrid Order Relational Knowledge for Cross-Resolution Image RecognitionabstractIn spite of great success in many image recognition tasks achieved by recent deep models, directly applying them to recognize low-resolution images may suffer from low accuracy due to the missing of informative details during resolution degradation. However, these images are still recognizable for subjects who are familiar with the corresponding high-resolution ones. Inspired by that, we propose a teacher-student learning approach to facilitate low-resolution image recognition via hybrid order relational knowledge distillation. The approach refers to three streams: the teacher stream is pretrained to recognize high-resolution images in high accuracy, the student stream is learned to identify low-resolution images by mimicking the teacher's behaviors, and the extra assistant stream is introduced as bridge to help knowledge transfer across the teacher to the student. To extract sufficient knowledge for reducing the loss in accuracy, the learning of student is supervised with multiple losses, which preserves the similarities in various order relational structures. In this way, the capability of recovering missing details of familiar low-resolution images can be effectively enhanced, leading to a better knowledge transfer. Extensive experiments on metric learning, low-resolution image classification and low-resolution face recognition tasks show the effectiveness of our approach, while taking reduced models. Shiming Ge, Kangkai Zhang, Yingying Hua, Shengwei Zhao, Xin Jin 0015 |
AAAI | 4 |
| 2020 | Coupled-View Deep Classifier Learning from Multiple Noisy AnnotatorsabstractTypically, learning a deep classifier from massive cleanly annotated instances is effective but impractical in many real-world scenarios. An alternative is collecting and aggregating multiple noisy annotations for each instance to train the classifier. Inspired by that, this paper proposes to learn deep classifier from multiple noisy annotators via a coupled-view learning approach, where the learning view from data is represented by deep neural networks for data classification and the learning view from labels is described by a Naive Bayes classifier for label aggregation. Such coupled-view learning is converted to a supervised learning problem under the mutual supervision of the aggregated and predicted labels, and can be solved via alternate optimization to update labels and refine the classifiers. To alleviate the propagation of incorrect labels, small-loss metric is proposed to select reliable instances in both views. A co-teaching strategy with class-weighted loss is further leveraged in the deep classifier learning, which uses two networks with different learning abilities to teach each other, and the diverse errors introduced by noisy labels can be filtered out by peer networks. By these strategies, our approach can finally learn a robust data classifier which less overfits to label noise. Experimental results on synthetic and real data demonstrate the effectiveness and robustness of the proposed approach. Shikun Li, Shiming Ge, Yingying Hua, Chunhui Zhang 0001, Tengfei Liu 0007, Weiqiang Wang 0002 |
AAAI | 3 |
| 2020 | Distilling Channels for Efficient Deep TrackingabstractDeep trackers have proven success in visual tracking. Typically, these trackers employ optimally pre-trained deep networks to represent all diverse objects with multi-channel features from some fixed layers. The deep networks employed are usually trained to extract rich knowledge from massive data used in object classification and so they are capable to represent generic objects very well. However, these networks are too complex to represent a specific moving object, leading to poor generalization as well as high computational and memory costs. This paper presents a novel and general framework termed channel distillation to facilitate deep trackers. To validate the effectiveness of channel distillation, we take discriminative correlation filter (DCF) and ECO for example. We demonstrate that an integrated formulation can turn feature compression, response map generation, and model update into a unified energy minimization problem to adaptively select informative feature channels that improve the efficacy of tracking moving objects on the fly. Channel distillation can accurately extract good channels, alleviating the influence of noisy channels and generally reducing the number of channels, as well as adaptively generalizing to different channels and networks. The resulting deep tracker is accurate, fast, and has low memory requirements. Extensive experimental evaluations on popular benchmarks clearly demonstrate the effectiveness and generalizability of our framework. Shiming Ge, Zhao Luo, Chunhui Zhang 0001, Yingying Hua, Dacheng Tao |
IEEE Trans. Image Process. | 4 |
| 2020 | Multimodal Fusion Method Based on Self-Attention MechanismabstractMultimodal fusion is one of the popular research directions of multimodal research, and it is also an emerging research field of artificial intelligence. Multimodal fusion is aimed at taking advantage of the complementarity of heterogeneous data and providing reliable classification for the model. Multimodal data fusion is to transform data from multiple single-mode representations to a compact multimodal representation. In previous multimodal data fusion studies, most of the research in this field used multimodal representations of tensors. As the input is converted into a tensor, the dimensions and computational complexity increase exponentially. In this paper, we propose a low-rank tensor multimodal fusion method with an attention mechanism, which improves efficiency and reduces computational complexity. We evaluate our model through three multimodal fusion tasks, which are based on a public data set: CMU-MOSI, IEMOCAP, and POM. Our model achieves a good performance while flexibly capturing the global and local connections. Compared with other multimodal fusions represented by tensors, experiments show that our model can achieve better results steadily under a series of attention mechanisms. Hu Zhu, Yingying Hua, Guoxia Xu, Lizhen Deng |
Wirel. Commun. Mob. Comput. | 4 |
| 2019 | Robust Deep Tracking with Two-step Augmentation Discriminative Correlation FiltersabstractRecently, deep trackers have proven success in visual tracking due to their powerful feature representation. Among them, discriminative correlation filter (DCF) paradigm is widely used. However, these trackers are still difficult to learn an adaptive appearance model of the object due to the limited data available. To address that, this paper proposes a two-step augmentation discriminative correlation filters (TADCF) approach to improve robustness. Firstly, we propose an online frame augmentation scheme to obtain rich and robust deep features which can effectively alleviate background distractors, leading to better generalization and adaptation of the learned model. Secondly, an object augmentation mechanism is implemented by exploiting rotation continuity restriction, which simultaneously models target appearance changes from rotation and scale variations. Extensive experiments on four benchmarks illustrate that the proposed approach performs favorably against state-of-the-art trackers. Chunhui Zhang 0001, Shiming Ge, Yingying Hua, Dan Zeng 0001 |
ICME | 3 |
| 2019 | Defending Against Adversarial Examples via Soft Decision Trees EmbeddingabstractConvolutional neural networks (CNNs) have shown vulnerable to adversarial examples which contain imperceptible perturbations. In this paper, we propose an approach to defend against adversarial examples with soft decision trees embedding. Firstly, we extract the semantic features of adversarial examples with a feature extraction network. Then, a specific soft decision tree is trained and embedded to select the key semantic features for each feature map from convolutional layers and the selected features are fed to a light-weight classification network. To this end, we use the probability distributions of each tree node to quantify the semantic features. In this way, some small perturbations can be effectively removed and the selected features are more discriminative in identifying adversarial examples. Moreover, the influence of adversarial perturbations on classification can be reduced by migrating the interpretability of soft decision trees into the black-box neural networks. We conduct experiments to defend the state-of-the-art adversarial attacks. The experimental results demonstrate that our proposed approach can effectively defend against these attacks and improve the robustness of deep neural networks. Yingying Hua, Shiming Ge, Xindi Gao, Xin Jin 0015, Dan Zeng 0001 |
ACM Multimedia | 1 |