← Search

Yufeng Huang

5 accepted papers

2024

Structure-CLIP: Towards Scene Graph Knowledge to Enhance Multi-Modal Structured Representations

AAAI 2024technical

Large-scale vision-language pre-training has achieved significant performance in multi-modal understanding and generation tasks. However, existing methods often perform poorly on image-text matching tasks that require structured representations, i.e., representations of objects, attributes, and rela…

2023

Analogical Inference Enhanced Knowledge Graph Embedding

AAAI 2023technical

Knowledge graph embedding (KGE), which maps entities and relations in a knowledge graph into continuous vector spaces, has achieved great success in predicting missing links in knowledge graphs. However, knowledge graphs often contain incomplete triples that are difficult to inductively infer by KGE…

2023

DUET: Cross-Modal Semantic Grounding for Contrastive Zero-Shot Learning

AAAI 2023technical

Zero-shot learning (ZSL) aims to predict unseen classes whose samples have never appeared during training. One of the most effective and widely used semantic information for zero-shot image classification are attributes which are annotations for class-level visual characteristics. However, the curre…

2022

Unpaired Deep Image Dehazing Using Contrastive Disentanglement Learning

ECCV 2022poster

"We offer a practical unpaired learning based image dehazing network from an unpaired set of clear and hazy images. This paper provides a new perspective to treat image dehazing as a two-class separated factor disentanglement task, i.e, the task-relevant factor of clear image reconstruction and the…

Cited by 45SourcePDFScholar
2022

Unpaired Deep Image Deraining Using Dual Contrastive Learning

CVPR 2022poster

Learning single image deraining (SID) networks from an unpaired set of clean and rainy images is practical and valuable as acquiring paired real-world data is almost infeasible. However, without the paired data as the supervision, learning a SID network is challenging. Moreover, simply using existin…

Cited by 196PDFScholar