Pith. sign in

REVIEW 2 major objections 5 minor 49 references

Relieving Universal Label Noise for Unsupervised Visible-Infrared Person Re-Identification by Inferring from Neighbors

T0 review · 2 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that in unsupervised visible-infrared person re-identification, replacing hard cluster pseudo-labels with soft labels inferred from each sample's k nearest neighbours—both within a modality and across modalities—and…

desk verdict Neighbor-based soft labeling for USL-VI-ReID shows a clean ablation win, but the headline SOTA claim rests on a mismatched baseline and test-set-tuned hyperparameters. read the letter →

arxiv 2412.12220 v1 pith:PUGRPROE submitted 2024-12-16 cs.CV cs.AI

Xiao Teng , Long Lan , Dingyao Chen , Kele Xu , Nan Yin This is my paper · ORCID
classification cs.CVcs.AI
keywords unsupervisedvisible-infraredpersonre-identificationpseudo-labelnoiseneighbor-guidedlabelcalibrationsoftpseudolabelssampleweightingprogressivegraphmatchingcross-modalitylearningReID
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Unsupervised visible-infrared person re-identification must match people across daylight and thermal cameras without identity annotations, so methods cluster features and treat each cluster as a pseudo-identity. Those pseudo-labels are noisy: the same person's images frequently land in different clusters within one modality, and cluster correspondences across modalities are noisier still. The paper argues that this universal label noise can be relieved by asking each sample's $k$ nearest neighbours: the overlap between a sample's neighbour set and each cluster yields a soft label, and the consistency of neighbours' cluster memberships tells the algorithm how much to trust the sample. Added to the Progressive Graph Matching baseline, the proposed N-ULC and N-DW modules raise RegDB visible-to-infrared rank-1 to 88.75% and mAP to 82.14%, and SYSU-MM01 all-search rank-1 to 61.81% and mAP to 58.92%, outperforming existing unsupervised visible-infrared re-identification methods.

What carries the argument

The two load-bearing objects are the neighbour-guided calibrated soft label and the neighbour-consistency weight. For a query $q$ with feature set $U$, the paper takes its $k$ nearest neighbours $N(q, U, k)$ and measures the correlation of $q$ with each cluster $C_l$ by the normalized overlap $|N(q, U, k) \cap C_l| \,/\, |N(q, U, k) \cup C_l|$. After $\ell^1$-normalizing this correlation vector into $P_q$, the hard one-hot pseudo-label $I_q$ is blended into the soft label $\tilde{I}_q = \mu I_q + (1-\mu)P_q$, which replaces the hard label in both the homogeneous and heterogeneous contrastive losses. The companion weight $\omega_q = \exp(-w(1-[P_q]_{\text{label}})^2)$ down-weights each sample's contribution when its neighbours disagree with the cluster it was assigned to. The whole mechanism runs on the Progressive Graph Matching baseline, which supplies the clusters, prototypes, and cross-modality cluster correspondences that define the losses being calibrated.

What would settle it

On a training set whose ground-truth identities are known, measure the 'neighbour purity' of each sample—the fraction of its $k$ nearest neighbours that share its true identity—throughout training in both modalities. If, for a substantial fraction of samples, the majority identity of the neighbour set disagrees with the cluster pseudo-label (or with the true identity) at the point where N-ULC and N-DW are active, then the soft labels and weights would be amplifying the very noise they are designed to remove. A sharper test: replace the feature-space neighbour sets with random neighbour sets and check that the reported gains vanish, or replace them with oracle neighbour sets defined by true identities and check that the gains sharply increase.

Watch

Extended reading notes

Core claim

The central discovery is that universal label noise—noise in pseudo-labels both within a modality (homogeneous) and across modalities (heterogeneous)—can be substantially reduced without extra supervision by deriving identity evidence from neighbours instead of relying on cluster assignments alone. The paper shows that a soft label formed by the normalized overlap between a query's $k$-nearest-neighbour set and every cluster, blended with the original one-hot cluster label as $\tilde{I} = \mu I + (1-\mu)P$, represents the query's true identity more faithfully than the hard label. The same construction transfers to the other modality by collecting neighbours across the visible and infrared feature sets. The paper further shows that the overlap at the query's own cluster provides a per-sample reliability weight $\omega = \exp(-w(1-[P]_{\text{label}})^2)$, and that weighting the soft-label losses by this reliability stabilises training. In the reported experiments, the combination lifts the PGM baseline on RegDB and SYSU-MM01 and surpasses earlier USL-VI-ReID methods.

Load-bearing premise

The load-bearing premise is that the $k$ nearest neighbours of a sample, computed in the current feature space, mostly share that sample's true identity, so the overlap between the neighbour set and the clusters is an accurate proxy for identity confidence; if early features are poor or the clusters are badly mixed, the neighbour sets carry the same noise the method aims to remove.

Editorial extensions

If this is right

  • Ablations show that each module contributes: adding only N-ULC to PGM improves SYSU-MM01 all-search rank-1 from 54.14 to 58.54, adding only N-DW improves it to 55.87, and the combination reaches 61.81.
  • Because the soft label is a blend rather than a replacement, the model can still exploit the cluster structure while tolerating individual assignment mistakes, so training is less sensitive to the DBSCAN distance thresholds.
  • The neighbour-consistency weight acts as a curriculum: early in training, samples whose neighbours agree with their cluster dominate the loss, and as features improve, harder samples are gradually trusted.
  • The same default hyper-parameters ($\mu=0.7$, $\lambda=3$, $w=10$, and modest $k$) work across both RegDB and SYSU-MM01, indicating the gains do not come from per-dataset tuning.
  • Performance on RegDB visible-to-infrared reaches 88.75% rank-1 and 82.14% mAP, numbers above all previously reported USL-VI-ReID results listed in the paper, including several that use extra labelled visible data.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The neighbour-overlap recipe is not tied to the PGM baseline: any clustering-based USL-VI-ReID pipeline that maintains per-modality features and cluster assignments could replace its hard pseudo-labels with N-ULC-style soft labels and add N-DW-style weights, so the modules are likely to transfer to other frameworks.
  • Weighting neighbours by feature distance, or restricting the neighbour set to reciprocal neighbours (neighbours that also list the query), could produce sharper soft labels than the unweighted Jaccard ratio used here; that variant is untested in the paper.
  • The method's weakest point is early-training neighbour purity; a diagnostic that tracks the agreement between neighbour-set majorities and cluster pseudo-labels on a small labelled subset could predict when the modules help and might be used to schedule the weighting strength $w$ adaptively.
  • Because the soft labels are built entirely from the current feature space, the method should benefit from any improvement in the backbone; combining N-ULC and N-DW with stronger pretrained encoders is a natural and untested extension.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper proposes a method for unsupervised visible-infrared person re-identification (USL-VI-ReID) that mitigates pseudo-label noise using neighbor information. Two modules are introduced: Neighbor-guided Universal Label Calibration (N-ULC), which replaces hard pseudo labels with soft labels derived from the Jaccard overlap between k-nearest neighbors and clusters in both intra- and inter-modality spaces, and Neighbor-guided Dynamic Weighting (N-DW), which down-weights unreliable samples based on neighbor consistency. The method is built on the PGM baseline with an alternating learning scheme. Experiments on RegDB and SYSU-MM01 report state-of-the-art results, e.g., 88.75 r1 on RegDB V-to-I and 61.81 r1 on SYSU-MM01 all-search. The paper also provides a Rademacher generalization bound for soft-label learning, citing Wei et al. 2022.

Significance. The proposal is simple and the ablation in Table 2 indicates each module contributes to improved performance over the authors' PGM reimplementation. The code is released, which is a strength. If the improvements are reliable, the work provides a practical way to reduce label noise in unsupervised cross-modality re-ID. However, the empirical evidence faces two protocol issues that affect the validity of the claimed SOTA: the comparison table uses a PGM baseline different from the ablation baseline, and hyperparameters are tuned on test sets. These issues need to be addressed.

major comments (2)
  1. [Table 1 and Table 2] The PGM baseline in the comparison table is inconsistent with the PGM baseline used in the ablation study. In Table 1, PGM (CVPR-23) reports 69.85 r1 (IR-to-V) and 69.48 r1 (V-to-I) on RegDB, while Table 2's first row (PGM reimplementation) reports 77.44 r1 and 77.92 r1 for the same settings. The reported improvement of Ours over PGM in Table 1 is therefore substantially larger than the actual gain over the authors' own reimplementation (88.75 vs 77.92 on V-to-I). The authors should reconcile this discrepancy, e.g., by reporting their reimplemented PGM in Table 1 (and possibly other baselines) or by explaining the setting differences, to make the SOTA claim apples-to-apples.
  2. [Figures 3, 5 and Table 3] The hyperparameters k, mu, lambda, and w are selected based on performance on the test sets (e.g., k is chosen on SYSU-MM01 all-search and RegDB V-to-I; mu, lambda, and w on SYSU-MM01 all-search). This constitutes test-set overfitting and the reported results are the best over the searched values, not unbiased estimates. The authors should use a held-out validation split for hyperparameter selection, or report the variance across values and justify the choice without reference to test performance.
minor comments (5)
  1. [Eqs. (5), (8)] The notation P_intra and P_inter is used for both the raw Jaccard values and the ℓ1-normalized distribution; please clarify the normalization step explicitly.
  2. [Table 1 caption] The footnote 'GUR† deontes results without camera information' contains a typo: 'denotes' is misspelled as 'deontes'.
  3. [Table 2 caption] The module name 'Neighbor-Guided Label Universal Calibration' in the caption is inconsistent with the section title 'Neighbor-Guided Universal Label Calibration'; use a consistent name throughout.
  4. [Section 'Neighbor-Guided Dynamic Weighting'] The Discussion paragraph claims a curriculum-learning effect ('we assign higher weights to easily labeled samples... more challenging samples are assigned greater weights if they demonstrate increased consistency'), but Eq. (11) computes weights as a static function of current neighbor statistics; the claimed curriculum mechanism is not explicitly implemented or tested.
  5. [References] Two Yin et al. 2024 entries (2024a and 2024b) are from different research groups; this is confusing in the citation list and should be disambiguated by author names or titles.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the neighbor-derived soft labels are iterative self-training inputs, not predictions equivalent to the method's own claims.

full rationale

The paper is a standard unsupervised self-training pipeline: DBSCAN clusters and k-nearest-neighbor overlap statistics are computed from the current feature space (Eqs. 5 and 8), then transformed into soft labels (Eqs. 6 and 9) and sample weights (Eqs. 11 and 12) that train the same encoder. This is self-referential in the ordinary pseudo-labeling sense, but it is not a logical circularity: the paper never presents the soft labels as independent evidence, and the core empirical claim, namely state-of-the-art retrieval accuracy on RegDB and SYSU-MM01 test sets, is an external outcome not encoded in the loss definition. No fitted parameter is renamed as a prediction, and no quantity is defined in terms of the target metric. The cited label-noise works by co-author Yin are background references, not load-bearing justifications; the only theorem used is explicitly attributed to Wei et al. 2022 and is borrowed from external work rather than imported as an author-specific uniqueness or ansatz result. The protocol weaknesses noted by the skeptic, such as test-set hyperparameter selection and the mismatched PGM baseline in Table 1, are validity concerns that threaten the reliability of the empirical comparison, but they are not circularity in the derivation. Therefore the derivation chain does not reduce to its own inputs by construction.

Assumptions & free parameters 5 free parameters · 3 assumptions · 0 invented entities

The central contribution rests on the cluster assumption that neighbors share identity and on the correctness of the underlying clustering and graph matching. The method's new hyperparameters (k, mu, w, lambda, DBSCAN eps) are all fitted on the benchmark test sets. No new entities are introduced.

free parameters (5)
  • k (neighbor count) = 20 (RegDB), 30 (SYSU-MM01)
    Controls how many neighbors are pooled to build soft labels in Eqs. (5) and (8); selected by scanning values per dataset in Fig. 3.
  • mu (label interpolation weight) = 0.7
    Balances original one-hot label against neighbor-derived soft distribution in Eqs. (6) and (9); chosen by test-set search in Fig. 5(b).
  • w (unreliable-sample penalty) = 10
    Scales the exponential penalty in Eqs. (11) and (12); tuned on SYSU-MM01 in Table 3 and applied to both datasets.
  • lambda (inter-modality loss weight) = 3.0
    Balances homogeneous and heterogeneous losses in Eqs. (4) and (13); tuned on SYSU-MM01 in Fig. 5(a).
  • DBSCAN eps (clustering threshold) = 0.6 (SYSU-MM01), 0.2 (RegDB)
    Determines pseudo-label clusters; chosen per dataset, following prior work, and critically shapes all neighbor and soft-label computations.
assumptions (3)
  • domain assumption Neighboring feature-space points tend to belong to the same identity.
    This underpins both modules: N-ULC builds soft labels from the cluster distribution among k nearest neighbors, and N-DW measures reliability via neighbor consistency. Invoked throughout the Method section, especially Eqs. (5) and (11).
  • domain assumption The DBSCAN clustering and progressive graph matching produce sufficiently correct pseudo-labels and cross-modality correspondences for the neighbor statistics to be informative.
    All soft labels and weights are derived from cluster assignments and the label transformers T^{V->I}; if these are badly wrong, the neighbor signals inherit the same noise the method tries to remove. Stated in the PGM baseline description and Eq. (1).
  • standard math Theorem 1 of Wei et al. (2022) is accepted as given.
    The Theoretical Analysis section quotes this Rademacher bound for soft-label losses but does not prove or adapt it to the paper's specific neighbor-derived soft labels and dynamic weighting.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Relieving Universal Label Noise for Unsupervised Visible-Infrared Person Re-Identification by Inferring from Neighbors." pith.science (2026). https://pith.science/paper/PUGRPROE

@misc{pith2026241212220,
  author       = {Pith},
  title        = {Pith review of: Relieving Universal Label Noise for Unsupervised Visible-Infrared Person Re-Identification by Inferring from Neighbors},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PUGRPROE}},
  note         = {Machine review of arXiv:2412.12220}
}
read the original abstract

Unsupervised visible-infrared person re-identification (USL-VI-ReID) is of great research and practical significance yet remains challenging due to the absence of annotations. Existing approaches aim to learn modality-invariant representations in an unsupervised setting. However, these methods often encounter label noise within and across modalities due to suboptimal clustering results and considerable modality discrepancies, which impedes effective training. To address these challenges, we propose a straightforward yet effective solution for USL-VI-ReID by mitigating universal label noise using neighbor information. Specifically, we introduce the Neighbor-guided Universal Label Calibration (N-ULC) module, which replaces explicit hard pseudo labels in both homogeneous and heterogeneous spaces with soft labels derived from neighboring samples to reduce label noise. Additionally, we present the Neighbor-guided Dynamic Weighting (N-DW) module to enhance training stability by minimizing the influence of unreliable samples. Extensive experiments on the RegDB and SYSU-MM01 datasets demonstrate that our method outperforms existing USL-VI-ReID approaches, despite its simplicity. The source code is available at: https://github.com/tengxiao14/Neighbor-guided-USL-VI-ReID.

Figures

Figures reproduced from arXiv: 2412.12220 by the authors.

Figure 1
Figure 1. Illustration of the motivation of our method. Due to [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Framework of the proposed method. Based on the Progressive Graph Matching (PGM) framework, we propose the neighbor-guided universal label calibration module (Sec. ) and neighbor-guided dynamic weighting module (Sec. ), these module are applied on both the (b) homogeneous learning and (c) heterogeneous learning processes. where P˜intra qv represents the correlation between qv and the visible clusters, and [P˜intra qv… view at source ↗
Figure 4
Figure 4. T-SNE visualization of features learned by PGM [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figures from the paper (2 more)
Figure 3
Figure 3. Figure 3: Impact of hyper-parameter k on different datasets. Hyper-parameter Analysis Our method relies on information from nearest neighbors, making the nearest neighbor number k in Eq. (5) a crucial factor in its performance [PITH_FULL_IMAGE:figures/full_fig_p007_3.png]
Figure 5
Figure 5. Figure 5: Impact of hyper-parameters λ and µ on SYSU￾MM01 dataset. More Experimental Results Influence of the hyper-parameter λ Our method involves both homogeneous learning and het￾erogeneous learning processes. In Eq. (13), the hyper￾parameter λ is a crucial factor which balan…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

49 extracted references · 41 canonical work pages

  1. [1]

    , " * write output.state after.block = add.period write newline

    ENTRY address archivePrefix author booktitle chapter edition editor eid eprint howpublished institution isbn journal key month note number organization pages publisher school series title type volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.a...

  2. [2]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

  3. [3]

    Chen, H.; Lagadec, B.; and Bremond, F. 2021. Ice: Inter-instance contrastive encoding for unsupervised person re-identification. In Proceedings of the IEEE/CVF International Conference on Computer Vision, 14960--14969

    work page 2021

  4. [4]

    Chen, Z.; Zhang, Z.; Tan, X.; Qu, Y.; and Xie, Y. 2023. Unveiling the power of clip in unsupervised visible-infrared person re-identification. In Proceedings of the 31st ACM International Conference on Multimedia, 3667--3675

    work page 2023

  5. [5]

    Cheng, D.; He, L.; Wang, N.; Zhang, S.; Wang, Z.; and Gao, X. 2023 a . Efficient Bilateral Cross-Modality Cluster Matching for Unsupervised Visible-Infrared Person ReID. In Proceedings of the 31st ACM International Conference on Multimedia, 1325--1333

    work page 2023

  6. [6]

    Cheng, D.; Huang, X.; Wang, N.; He, L.; Li, Z.; and Gao, X. 2023 b . Unsupervised visible-infrared person reid by collaborative learning with neighbor-guided label refinement. In Proceedings of the 31st ACM International Conference on Multimedia, 7085--7093

    work page 2023

  7. [7]

    J.; Hong, S.; and Yoon, S.-E

    Cho, Y.; Kim, W. J.; Hong, S.; and Yoon, S.-E. 2022. Part-based pseudo label refinement for unsupervised person re-identification. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 7308--7318

    work page 2022

  8. [8]

    Dai, Z.; Wang, G.; Yuan, W.; Zhu, S.; and Tan, P. 2022. Cluster contrast for unsupervised person re-identification. In Proceedings of the Asian Conference on Computer Vision, 1142--1160

    work page 2022

Show all 49 references
  1. [9]

    Ester, M.; Kriegel, H.-P.; Sander, J.; Xu, X.; et al. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In kdd, volume 96, 226--231

    1996

  2. [10]

    Fang, X.; Yang, Y.; and Fu, Y. 2023. Visible-infrared person re-identification via semantic alignment and affinity inference. In Proceedings of the IEEE/CVF International Conference on Computer Vision, 11270--11279

    2023

  3. [11]

    Ge, Y.; Chen, D.; and Li, H. 2020. Mutual mean-teaching: Pseudo label refinery for unsupervised domain adaptation on person re-identification. arXiv preprint arXiv:2001.01526

    2020 arXiv

  4. [12]

    Ge, Y.; Zhu, F.; Chen, D.; Zhao, R.; et al. 2020. Self-paced contrastive learning with hybrid memory for domain adaptive object re-id. Advances in Neural Information Processing Systems, 33: 11309--11321

    2020

  5. [13]

    Hao, X.; Zhao, S.; Ye, M.; and Shen, J. 2021. Cross-modality person re-identification via modality confusion and center aggregation. In Proceedings of the IEEE/CVF International conference on computer vision, 16403--16412

    2021

  6. [14]

    He, K.; Zhang, X.; Ren, S.; and Sun, J. 2016. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, 770--778

    2016

  7. [15]

    He, L.; Cheng, D.; Wang, N.; and Gao, X. 2024. Exploring Homogeneous and Heterogeneous Consistent Label Associations for Unsupervised Visible-Infrared Person ReID. arXiv preprint arXiv:2402.00672

    2024 arXiv

  8. [16]

    Ju, W.; Yi, S.; Wang, Y.; Xiao, Z.; Mao, Z.; Li, H.; Gu, Y.; Qin, Y.; Yin, N.; Wang, S.; et al. 2024. A survey of graph neural networks in real world: Imbalance, noise, privacy and ood challenges. arXiv preprint arXiv:2403.04468

    2024

  9. [17]

    Kim, M.; Kim, S.; Park, J.; Park, S.; and Sohn, K. 2023. PartMix: Regularization Strategy To Learn Part Discovery for Visible-Infrared Person Re-Identification. In Proceedings of the IEEE/CVF International Conference on Computer Vision, 18621--18632

    2023

  10. [18]

    Lan, L.; Teng, X.; Zhang, J.; Zhang, X.; and Tao, D. 2023. Learning to Purification for Unsupervised Person Re-identification. IEEE Transactions on Image Processing

    2023

  11. [19]

    Li, C.; Teng, X.; Ding, Y.; and Lan, L. 2024 a . Instance-Level Scaling and Dynamic Margin-Alignment Knowledge Distillation for Remote Sensing Image Scene Classification. Remote Sensing, 16(20): 3853

    2024

  12. [20]

    Li, X.; Lu, Y.; Liu, B.; Liu, Y.; Yin, G.; Chu, Q.; Huang, J.; Zhu, F.; Zhao, R.; and Yu, N. 2022. Counterfactual Intervention Feature Transfer for Visible-Infrared Person Re-identification. In European Conference on Computer Vision, 381--398. Springer

    2022

  13. [21]

    Li, Z.; Liu, H.; Peng, X.; and Jiang, W. 2024 b . Inter-Intra Modality Knowledge Learning and Clustering Noise Alleviation for Unsupervised Visible-Infrared Person Re-Identification. IEEE Transactions on Knowledge and Data Engineering

    2024

  14. [22]

    Liang, W.; Wang, G.; Lai, J.; and Xie, X. 2021. Homogeneous-to-heterogeneous: Unsupervised learning for rgb-infrared person re-identification. IEEE Transactions on Image Processing, 30: 6392--6407

    2021

  15. [23]

    Liu, J.; Sun, Y.; Zhu, F.; Pei, H.; Yang, Y.; and Li, W. 2022. Learning memory-augmented unidirectional metrics for cross-modality person re-identification. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 19366--19375

    2022

  16. [24]

    T.; Hong, H

    Nguyen, D. T.; Hong, H. G.; Kim, K. W.; and Park, K. R. 2017. Person recognition system based on a combination of body images from visible light and thermal cameras. Sensors, 17(3): 605

    2017

  17. [25]

    Pang, Z.; Wang, C.; Pan, H.; Zhao, L.; Wang, J.; and Guo, M. 2024. MIMR: Modality-Invariance Modeling and Refinement for unsupervised visible-infrared person re-identification. Knowledge-Based Systems, 285: 111350

    2024

  18. [26]

    Pang, Z.; Wang, C.; Zhao, L.; Liu, Y.; and Sharma, G. 2023. Cross-modality hierarchical clustering and refinement for unsupervised visible-infrared person re-identification. IEEE Transactions on Circuits and Systems for Video Technology

    2023

  19. [27]

    Teng, X.; Lan, L.; Zhao, J.; Li, X.; and Tang, Y. 2023. Highly Efficient Active Learning With Tracklet-Aware Co-Cooperative Annotators for Person Re-Identification. IEEE Transactions on Neural Networks and Learning Systems

    2023

  20. [28]

    Van der Maaten, L.; and Hinton, G. 2008. Visualizing data using t-SNE. Journal of machine learning research, 9(11)

    2008

  21. [29]

    Wang, H.; Shen, J.; Liu, Y.; Gao, Y.; and Gavves, E. 2022 a . Nformer: Robust person re-identification with neighbor transformer. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 7297--7307

    2022

  22. [30]

    Wang, J.; Zhang, Z.; Chen, M.; Zhang, Y.; Wang, C.; Sheng, B.; Qu, Y.; and Xie, Y. 2022 b . Optimal transport for label-efficient visible-infrared person re-identification. In European Conference on Computer Vision, 93--109. Springer

    2022

  23. [31]

    Wei, J.; Liu, H.; Liu, T.; Niu, G.; Sugiyama, M.; and Liu, Y. 2022. To Smooth or Not? When Label Smoothing Meets Noisy Labels. In International Conference on Machine Learning, 23589--23614. PMLR

    2022

  24. [32]

    Wu, A.; Zheng, W.-S.; Yu, H.-X.; Gong, S.; and Lai, J. 2017. RGB-infrared cross-modality person re-identification. In Proceedings of the IEEE international conference on computer vision, 5380--5389

    2017

  25. [33]

    Wu, Z.; and Ye, M. 2023. Unsupervised Visible-Infrared Person Re-Identification via Progressive Graph Matching and Alternate Learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 9548--9558

    2023

  26. [34]

    Yang, B.; Chen, J.; Chen, C.; and Ye, M. 2023 a . Dual Consistency-Constrained Learning for Unsupervised Visible-Infrared Person Re-Identification. IEEE Transactions on Information Forensics and Security

    2023

  27. [35]

    Yang, B.; Chen, J.; Ma, X.; and Ye, M. 2023 b . Translation, association and augmentation: Learning cross-modality re-identification from single-modality annotation. IEEE Transactions on Image Processing

    2023

  28. [36]

    Yang, B.; Chen, J.; and Ye, M. 2023. Towards grand unified representation learning for unsupervised visible-infrared person re-identification. In Proceedings of the IEEE/CVF International Conference on Computer Vision, 11069--11079

    2023

  29. [37]

    Yang, B.; Chen, J.; and Ye, M. 2024. Shallow-Deep Collaborative Learning for Unsupervised Visible-Infrared Person Re-Identification. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 16870--16879

    2024

  30. [38]

    Yang, B.; Ye, M.; Chen, J.; and Wu, Z. 2022. Augmented dual-contrastive aggregation learning for unsupervised visible-infrared person re-identification. In Proceedings of the 30th ACM International Conference on Multimedia, 2843--2851

    2022

  31. [39]

    Ye, M.; Ruan, W.; Du, B.; and Shou, M. Z. 2021 a . Channel augmented joint learning for visible-infrared recognition. In Proceedings of the IEEE/CVF International Conference on Computer Vision, 13567--13576

    2021

  32. [40]

    Ye, M.; Shen, J.; Lin, G.; Xiang, T.; Shao, L.; and Hoi, S. C. 2021 b . Deep learning for person re-identification: A survey and outlook. IEEE transactions on pattern analysis and machine intelligence, 44(6): 2872--2893

    2021

  33. [41]

    Yin, N.; Shen, L.; Chen, C.; Hua, X.-S.; and Luo, X. 2024 a . Sport: A subgraph perspective on graph classification with label noise. ACM Transactions on Knowledge Discovery from Data, 18(9): 1--20

    2024

  34. [42]

    Yin, N.; Shen, L.; Wang, M.; Luo, X.; Luo, Z.; and Tao, D. 2023. Omg: Towards effective graph classification against label noise. IEEE Transactions on Knowledge and Data Engineering, 35(12): 12873--12886

    2023

  35. [43]

    Yin, X.; Shi, J.; Zhang, Y.; Lu, Y.; Zhang, Z.; Xie, Y.; and Qu, Y. 2024 b . Robust Pseudo-label Learning with Neighbor Relation for Unsupervised Visible-Infrared Person Re-Identification. arXiv preprint arXiv:2405.05613

    2024 arXiv

  36. [44]

    Yu, H.; Cheng, X.; Peng, W.; Liu, W.; and Zhao, G. 2023. Modality unifying network for visible-infrared person re-identification. In Proceedings of the IEEE/CVF International Conference on Computer Vision, 11185--11195

    2023

  37. [45]

    Yu, S.; Chen, D.; Zhao, R.; Chen, H.; and Qiao, Y. 2021. Neighbourhood-guided feature reconstruction for occluded person re-identification. arXiv preprint arXiv:2105.07345

    2021 arXiv

  38. [46]

    Q.; Zhang, Z.; and Wang, J

    Zhang, X.; Li, D.; Wang, Z.; Wang, J.; Ding, E.; Shi, J. Q.; Zhang, Z.; and Wang, J. 2022. Implicit sample extension for unsupervised person re-identification. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 7369--7378

    2022

  39. [47]

    Zhao, J.; Lan, L.; Huang, D.; Ren, J.; and Yang, W. 2022 a . Heterogeneous pseudo-supervised learning for few-shot person re-identification. Neural Networks, 154: 521--537

    2022

  40. [48]

    Zhao, J.; Wang, H.; Zhou, Y.; Yao, R.; Chen, S.; and El Saddik, A. 2022 b . Spatial-channel enhanced transformer for visible-infrared person re-identification. IEEE Transactions on Multimedia

    2022

  41. [49]

    Zhong, Z.; Zheng, L.; Cao, D.; and Li, S. 2017. Re-ranking person re-identification with k-reciprocal encoding. In Proceedings of the IEEE conference on computer vision and pattern recognition, 1318--1327

    2017

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.