- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper proposes ADKD for unsupervised domain-adaptive person re-identification. It uses domain-specific batch normalization, a learned identity-agent filter, and domain-confusion training to construct identity-related representations. A graph network combines these representations with domain-style nodes to produce alternative domain embeddings. The resulting clusterings are used for pseudo-label assignment and sample selection, based on a combination of clustering quality, changes in pairwise cluster assignments, and cross-domain agreement. Experiments report single-source and multi-source adaptation results, component ablations, and feature visualizations.
Critical strengths
- Exploiting complementary clustering spaces is a relevant research direction. Rather than relying exclusively on clustering in the target model’s native embedding, the method attempts to use alternative domain representations to improve pseudo-label assignment and sample selection. The component ablations report incremental improvements, providing an initial empirical rationale for investigating this design. However, the formulation and reporting problems below prevent these results from establishing the claimed contribution convincingly.
Critical weaknesses
-
The methodological novelty over existing multi-domain adaptation frameworks is insufficiently established. RDSBN+MDIF [1] already combines domain-specific normalization, learnable weighted domain-agent nodes updated through a moving average, and GCN-based cross-domain information fusion. ADKD’s domain-style construction in Eqs. (5)–(6) and its graph-based processing closely resemble these established components. Although identity filtering and adaptive clustering-space selection introduce additional elements, the manuscript does not sufficiently establish their distinctive contribution beyond extending an existing domain-fusion framework. The cumulative ablations demonstrate gains from adding modules, but do not isolate the proposed transformation from alternative fusion mechanisms. A controlled comparison replacing DT-GCN with MDIF while retaining the same filtering and pseudo-label refinement would clarify this incremental contribution.
-
Dataset and protocol inconsistencies undermine the main experimental comparisons. Table 1 lists 38.0/68.1/79.0/81.7 for DKD-MPL under Market→Duke, but this tuple matches its published MSMT17 result. The original paper instead reports 75.9/86.8/92.8/94.0 on DukeMTMC-reID, under a purely unsupervised setting. The comparison therefore requires correction of both dataset attribution and supervision-protocol labeling; the published purely unsupervised results should not be presented as unspecified source-to-target UDA runs. Table 2’s first two columns contain the same source datasets and target dataset, merely reordered, with identical results throughout. Unless an order-dependent protocol is intended and explained, these are duplicate settings rather than independent evaluations. These reporting issues materially weaken the claimed superiority and warrant an audit of the comparison tables。
[1] Zechen Bai, Zhigang Wang, Jian Wang, Di Hu, and Errui Ding. Unsupervised Multi-Source Domain Adaptation for Person Re-Identification. CVPR, 2021.
[2] Wenjie Zhu, Bo Peng, and Wei Qi Yan. Dual Knowledge Distillation on Multiview Pseudo Labels for Unsupervised Person Re-Identification. IEEE Transactions on Multimedia, 2024.
Questions for authors
-
What exact expressions are implemented for Eqs. (7), (9), and (10)? Please resolve the silhouette sign, the inter-cluster averaging denominator, and the handling of negative or zero-sum confidence weights. Do the reported results use the printed equations or a different implementation?
-
Please provide the complete training objective and DT-GCN update equations, including how destination-domain transformation is supervised, which parameters each loss updates, how unclustered outliers are labeled, and which representation is used at inference. These details are necessary to assess the proposed algorithm rather than optional implementation refinements.
-
Please audit Table 1 against the original sources, particularly the DKD-MPL and IDE rows, and distinguish published purely unsupervised results from reproduced UDA results. Also explain whether Table 2’s first two columns are intentionally the same task. Do the main superiority claims remain valid after correcting the dataset and protocol assignments?