CVMay 10, 2025

Dynamic Uncertainty Learning with Noisy Correspondence for Text-Based Person Search

arXiv:2505.06566v217 citationsh-index: 1Poster Volume Ⅰ The 2025 Twenty-First International Conference on Intelligent Computing July 26-29, 2025 Ningbo, China
Originality Incremental advance
AI Analysis

This work addresses noisy correspondence in text-to-image person search, an incremental improvement for retrieval systems using co-occurrence data.

The paper tackles the problem of noisy text-image pairs in text-based person search by proposing the DURA framework, which improves retrieval performance with strong noise resistance across low- and high-noise scenarios.

Text-to-image person search aims to identify an individual based on a text description. To reduce data collection costs, large-scale text-image datasets are created from co-occurrence pairs found online. However, this can introduce noise, particularly mismatched pairs, which degrade retrieval performance. Existing methods often focus on negative samples, which amplify this noise. To address these issues, we propose the Dynamic Uncertainty and Relational Alignment (DURA) framework, which includes the Key Feature Selector (KFS) and a new loss function, Dynamic Softmax Hinge Loss (DSH-Loss). KFS captures and models noise uncertainty, improving retrieval reliability. The bidirectional evidence from cross-modal similarity is modeled as a Dirichlet distribution, enhancing adaptability to noisy data. DSH adjusts the difficulty of negative samples to improve robustness in noisy environments. Our experiments on three datasets show that the method offers strong noise resistance and improves retrieval performance in both low- and high-noise scenarios.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes