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

Likang Peng

dblp:261/0679 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

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 · 1 · 1 first-author · 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.

Computer graphics and multimedia
2 papers
Multimedia analysis and retrieval · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 50% Data mining · 50%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval › cross-modal retrieval
cross-modal hashing
1.922026
Semantic-Consistent Bidirectional Contrastive Hashing for Noisy Multi-Label Cross-Modal Retrieval · AAAI 2026
Neighbor-aware Contrastive Disambiguation for Cross-Modal Hashing with Redundant Annotations · NeurIPS 2025
Multimedia analysis and retrieval
cross-modal retrieval
1.922026
Semantic-Consistent Bidirectional Contrastive Hashing for Noisy Multi-Label Cross-Modal Retrieval · AAAI 2026
Neighbor-aware Contrastive Disambiguation for Cross-Modal Hashing with Redundant Annotations · NeurIPS 2025
Information retrieval
hashing
1.012026
Semantic-Consistent Bidirectional Contrastive Hashing for Noisy Multi-Label Cross-Modal Retrieval · AAAI 2026
Data mining › predictive modeling › classification
noisy label learning
1.012026
Semantic-Consistent Bidirectional Contrastive Hashing for Noisy Multi-Label Cross-Modal Retrieval · AAAI 2026
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels
0.912025
Neighbor-aware Contrastive Disambiguation for Cross-Modal Hashing with Redundant Annotations · NeurIPS 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
Neighbor-aware Contrastive Disambiguation for Cross-Modal Hashing with Redundant Annotations · NeurIPS 2025

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

contrastive learning · 3.7label noise estimation · 2.0hashing · 2.0quantization · 1.7
YearPublicationVenuePosition
2026 Semantic-Consistent Bidirectional Contrastive Hashing for Noisy Multi-Label Cross-Modal Retrieval
abstract
Cross-modal hashing (CMH) facilitates efficient retrieval across different modalities (e.g., image and text) by encoding data into compact binary representations. While recent methods have achieved remarkable performance, they often rely heavily on fully annotated datasets, which are costly and labor-intensive to obtain. In real-world scenarios, particularly in multi-label datasets, label noise is prevalent and severely degrades retrieval performance. Moreover, existing CMH approaches typically overlook the partial semantic overlaps inherent in multi-label data, limiting their robustness and generalization. To tackle these challenges, we propose a novel framework named Semantic-Consistent Bidirectional Contrastive Hashing (SCBCH). The framework comprises two complementary modules: (1) Cross-modal Semantic-Consistent Classification (CSCC), which leverages cross-modal semantic consistency to estimate sample reliability and reduce the impact of noisy labels; (2) Bidirectional Soft Contrastive Hashing (BSCH), which dynamically generates soft contrastive sample pairs based on multi-label semantic overlap, enabling adaptive contrastive learning between semantically similar and dissimilar samples across modalities. Extensive experiments on four widely-used cross-modal retrieval benchmarks validate the effectiveness and robustness of our method, consistently outperforming state-of-the-art approaches under noisy multi-label conditions.
Likang Peng, Chao Su 0003, Yuan Sun 0016, Dezhong Peng, Xi Peng 0001, Xu Wang 0028
AAAI1
2026 Historical reliability-based dual contrastive hashing for robust cross-modal retrieval with noisy labels
Haixiao Huang, Likang Peng, Chao Su 0003, Zijie Zhong, Da Rao, Dezhong Peng, Xu Wang 0028
Neurocomputing3
2025 Neighbor-aware Contrastive Disambiguation for Cross-Modal Hashing with Redundant Annotations
abstract
Cross-modal hashing aims to efficiently retrieve information across different modalities by mapping data into compact hash codes. However, most existing methods assume access to fully accurate supervision, which rarely holds in real-world scenarios. In fact, annotations are often redundant, i.e., each sample is associated with a set of candidate labels that includes both ground-truth labels and redundant noisy labels. Treating all annotated labels as equally valid introduces two critical issues: (1) the sparse presence of true labels within the label set is not explicitly addressed, leading to overfitting on redundant noisy annotations; (2) redundant noisy labels induce spurious similarities that distort semantic alignment across modalities and degrade the quality of the hash space. To address these challenges, we propose that effective cross-modal hashing requires explicitly identifying and leveraging the true label subset within all candidate annotations. Based on this insight, we present Neighbor-aware Contrastive Disambiguation (NACD), a novel framework designed for robust learning under redundant supervision. NACD consists of two key components. The first, Neighbor-aware Confidence Reconstruction (NACR), refines label confidence by aggregating information from cross-modal neighbors to distinguish true labels from redundant noisy ones. The second, Class-aware Robust Contrastive Hashing (CRCH), constructs reliable positive and negative pairs based on label confidence scores, thereby significantly enhancing robustness against noisy supervision. Moreover, to effectively reduce the quantization error, we incorporate a quantization loss that enforces binary constraints on the learned hash representations. Extensive experiments conducted on three large-scale multimodal benchmarks demonstrate that our method consistently outperforms state-of-the-art approaches, thereby establishing a new standard for cross-modal hashing with redundant annotations. Code is available at https://github.com/Rose-bud/NACD.
Chao Su 0003, Likang Peng, Yuan Sun 0016, Dezhong Peng, Xi Peng 0001, Xu Wang 0028
NeurIPS2