arXiv:2509.04050cs.CV2025-09被引 5

通过近邻加权融合生成多视角特征,提升行人重识别重排序精度。

A Re-ranking Method using K-nearest Weighted Fusion for Person Re-identification

  • 基于K近邻加权融合,无监督聚合相似特征生成多视角表示。
  • 在MSMT17和Occluded-DukeMTMC上分别提升Rank@1 9.8%和22.0%。
  • 无需微调或额外标注,适用于大规模数据集,计算高效。

在行人重识别中,重排序是通过优化初始检索结果排名来提升整体准确率的关键步骤。以往研究主要依赖单视角图像特征,易受视角偏差及姿态变化、视点差异、遮挡等问题影响。利用多视角特征可缓解此类偏差。本文提出一种高效的重排序方法,通过K近邻加权融合(KWF)无监督地聚合邻居特征以生成多视角特征。我们假设同一身份的特征在重识别模型中具有高度相似性,因此在无监督条件下选取K个最近邻特征进行融合。同时探索了特征聚合中的权重选择策略,发现有效方案。该方法无需模型微调或额外标注,适用于大规模数据集。在Market1501、MSMT17和Occluded-DukeMTMC数据集上评估,结果显示该方法在重排序初始排名前M个候选结果时显著提升Rank@1和mAP。相比初始结果,其在挑战性数据集MSMT17和Occluded-DukeMTMC上分别实现9.8%和22.0%的Rank@1提升。此外,相比其他重排序方法,本方法在计算效率上也有明显优势。代码已开源:https://github.com/chequanghuy/Enhancing-Person-Re-Identification-via-UFFM-and-AMC。

原文摘要 · Abstract (English)

In person re-identification, re-ranking is a crucial step to enhance the overall accuracy by refining the initial ranking of retrieved results. Previous studies have mainly focused on features from single-view images, which can cause view bias and issues like pose variation, viewpoint changes, and occlusions. Using multi-view features to present a person can help reduce view bias. In this work, we present an efficient re-ranking method that generates multi-view features by aggregating neighbors' features using K-nearest Weighted Fusion (KWF) method. Specifically, we hypothesize that features extracted from re-identification models are highly similar when representing the same identity. Thus, we select K neighboring features in an unsupervised manner to generate multi-view features. Additionally, this study explores the weight selection strategies during feature aggregation, allowing us to identify an effective strategy. Our re-ranking approach does not require model fine-tuning or extra annotations, making it applicable to large-scale datasets. We evaluate our method on the person re-identification datasets Market1501, MSMT17, and Occluded-DukeMTMC. The results show that our method significantly improves Rank@1 and mAP when re-ranking the top M candidates from the initial ranking results. Specifically, compared to the initial results, our re-ranking method achieves improvements of 9.8%/22.0% in Rank@1 on the challenging datasets: MSMT17 and Occluded-DukeMTMC, respectively. Furthermore, our approach demonstrates substantial enhancements in computational efficiency compared to other re-ranking methods. Code is available at https://github.com/chequanghuy/Enhancing-Person-Re-Identification-via-UFFM-and-AMC.

行人重识别重排序多视角特征K近邻

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。