PaperlayerView exact revision on arXiv

Source-linked AI summary

Dynamic Label Graph Matching for Unsupervised Video Re-Identification

Mang Ye, Andy J Ma, Liang Zheng, Jiawei Li, P C Yuen

arXiv:1709.09297v1cs.CV

TL;DR

Unsupervised video re-ID needs reliable cross-camera labels, but appearance changes make direct graph-matching estimates noisy. DGM iteratively updates graphs, labels, and a learned metric while re-weighting uncertain labels; it achieves competitive benchmark performance and approaches supervised baselines.

  • Problem

    Cross-camera appearance changes make existing graph-matching labels noisy, while annotation difficulty limits supervised re-ID scalability.

    Source: §1 · p. 1

  • Method

    DGM iteratively estimates labels, learns a discriminative metric, updates the graph, and re-weights intermediate labels as soft labels.

    Source: §1 · p. 2, §4.1 · p. 4

  • Results

    DGM is only slightly inferior to supervised baselines and competitive with existing unsupervised methods on three video benchmarks.

    Source: §1 · p. 2

  • Takeaways & Limitations

    The estimated labels can support further discriminative re-ID model learning and are reported as robust to distractors and noisy initial training data.

    Source: §1 · p. 2

    The method’s convergence procedure depends on suitable step-size and update constraints for optimizing its two objective functions.

    Source: §4.3 · p. 5

Abstract

from arXiv · show

Label estimation is an important component in an unsupervised person re-identification (re-ID) system. This paper focuses on cross-camera label estimation, which can be subsequently used in feature learning to learn robust re-ID models. Specifically, we propose to construct a graph for samples in each camera, and then graph matching scheme is introduced for cross-camera labeling association. While labels directly output from existing graph matching methods may be noisy and inaccurate due to significant cross-camera variations, this paper proposes a dynamic graph matching (DGM) method. DGM iteratively updates the image graph and the label estimation process by learning a better feature space with intermediate estimated labels. DGM is advantageous in two aspects: 1) the accuracy of estimated labels is improved significantly with the iterations; 2) DGM is robust to noisy initial training data. Extensive experiments conducted on three benchmarks including the large-scale MARS dataset show that DGM yields competitive performance to fully supervised baselines, and outperforms competing unsupervised learning methods.

1. Introduction

The paper targets unsupervised video re-ID by estimating cross-camera labels, addressing noisy graph-matching outputs with an iterative dynamic graph matching framework.

  • Annotation difficulty limits supervised re-ID scalability in large camera networks, motivating unsupervised video re-ID.Source: §1 · p. 1
  • Existing unsupervised approaches can suffer from cross-camera variation, making cross-camera label estimation a customized alternative.Source: §1 · pp. 1–2
  • Graph matching constructs camera-specific sample graphs to estimate correspondences, but fixed graphs and costs can yield noisy labels.Source: §1 · pp. 1–2
  • DGM iteratively estimates labels, learns a discriminative metric, and updates the graph, while label re-weighting softens noisy intermediate outputs.Source: Figure 1 · p. 1, §1 · p. 2
  • DGM is reported as robust to distractors and noisy initial training data, with labels usable for subsequent discriminative re-ID learning.Source: §1 · p. 2
  • DGM is only slightly inferior to supervised baselines and competitive with existing unsupervised methods on three video benchmarks.Source: §1 · p. 2

2. Related Work

Prior unsupervised re-ID methods reduce reliance on labeled data through transfer learning, invariant representations, retrieval, or clustering; DGM instead estimates labels with graph matching and supports later supervised learning.

  • Unsupervised re-ID methods aim to alleviate reliance on large-scale supervised data using transfer learning and other strategies.Source: §2 · p. 2
  • Some prior methods seek shared cross-camera information through saliency or dictionaries rather than directly estimating labels.Source: §2 · p. 2
  • DGM estimates labels with graph matching to address cross-camera variation instead of directly learning an invariant representation.Source: §2 · p. 2
  • DGM’s estimated labels can be expanded with advanced supervised learning methods, providing flexibility for large-scale camera networks.Source: §2 · p. 2
  • Other label-estimation methods use retrieval or k-means clustering for unsupervised re-ID.Source: §2 · p. 2

3. Graph Matching for Video Re-ID

The video re-ID graph-matching formulation represents people and sequences across cameras, combining sequence and neighborhood costs to capture appearance and within-camera structure.

  • Each camera is represented by a graph of person nodes, with a dummy node allowing unmatched persons across cameras.Source: §3 · pp. 2–3
  • Cross-camera label association is formulated as binary linear programming with assignment indicators and an assignment-cost matrix.Source: §3 · p. 3
  • Video nodes contain frame sets, so sequence and neighborhood costs define assignment costs under a learned metric.Source: §3 · p. 3
  • The combined assignment cost uses a weighting parameter λ to integrate sequence and neighborhood costs.Source: §3 · p. 3

Sequence Cost

  • Sequence cost penalizes mean set-to-set differences between matched video sequences.Source: §3 · p. 3

Neighborhood Cost

  • Neighborhood cost penalizes differences between matched sequences’ within-camera neighborhoods.Source: §3 · p. 3
  • Neighborhood similarity is stronger for same-person pairs than different-person pairs, especially in video-based rather than image-based re-ID.Source: §3 · p. 3, Figure 2 · p. 3

4. Dynamic Graph Matching

Dynamic graph matching addresses noisy graph-matching labels by jointly re-weighting estimated pairs and iteratively learning a discriminative metric that updates matching costs. The resulting process progressively improves matching reliability while filtering uncertain pairs from metric learning.

  • Existing graph matching is limited by fixed feature spaces and assignment costs under large cross-camera variations, while noisy labels and class imbalance can contaminate training.Source: §4 · p. 4
  • DGM alternates label re-weighting, metric learning, graph-cost updating, and graph matching to improve the feature space and estimated labels over iterations.Intermediate estimated labels update the graph construction and matching process.Source: §4 · p. 4, §4.3 · p. 5

Label Re-weighting

  • The positive re-weighting scheme converts estimated positive pairs into soft labels, assigning larger weights to smaller-cost pairs and filtering likely false positives.The threshold λ+ determines which positive pairs receive nonzero weights.Source: §4.1 · p. 4
  • Negative re-weighting selects hard negative pairs while filtering easy negatives, addressing the abundance of negative video pairs in video re-ID.Source: §4.1 · p. 4

Metric Learning with Re-weighted Labels

  • The learned metric uses weighted loglogistic metric learning, with weights ωij accounting for imbalanced positive and negative pairs and uncertain pairs excluded from learning.Source: §4.2 · p. 5

Iterative Updating

  • DGM repeatedly updates assignment costs and metric parameters until a stable matching result is achieved, and the matched results can support subsequent supervised re-ID learning.The method constrains updates so the combined objectives do not increase and reports steady convergence.Source: §4.3 · p. 5, §4.1 · p. 5

5. Experimental Results

Experiments on PRID-2011, iLIDS-VID, and MARS evaluate DGM under standard protocols, iterative updating, label re-weighting, label estimation, and downstream supervised learning. DGM improves with iterations, benefits from re-weighted labels, and performs competitively across unsupervised and supervised-learning evaluations.

Experimental Settings

  • Evaluation uses PRID-2011, iLIDS-VID, and MARS under established protocols, with repeated trials and CMC evaluation.PRID-2011 and iLIDS-VID use half training and half testing splits; experiments are repeated for 10 trials.Source: §5.1 · pp. 5–6

Iterative Updating

  • 81.57% Rank-1 accuracy is achieved on PRID-2011, 49.33% on iLIDS-VID, and 59.64% on MARS after iterative updating.Testing performance improves significantly over iteration 1 and fluctuates mildly after about five iterations.Source: §5.2 · p. 6

Label Re-weighting

  • Label re-weighting consistently improves Rank-1 matching rates on all three datasets.The comparison uses intermediate graph-matching labels either with the proposed re-weighting or as hard labels of 1 and −1.Source: §5.2 · p. 6, Table 1 · p. 6

Label Estimation

  • Graph-matching labels are evaluated with precision, recall, and F-score, with precision close to recall on PRID-2011 and iLIDS-VID.Precision is slightly higher than recall because of the proposed positive re-weighting strategy.Source: §5.2 · p. 6, Table 2 · p. 7

Estimated Labels for Supervised Learning

  • With MLAPG and XQDA, DGM outperforms the l2-norm baseline on all three datasets and approaches supervised upper bounds on PRID-2011 and MARS.Performance on iLIDS-VID is less competitive, which the authors attribute to background clutter that global LOMO descriptors cannot effectively solve.Source: §5.3 · p. 7

Comparison with Unsupervised re-ID

  • DGM outperforms other unsupervised re-ID methods on PRID-2011 and MARS, while achieving comparable performance on iLIDS-VID.The authors report that stronger baseline descriptors or advanced supervised learners may further improve results.Source: §5.4 · p. 8

6. Conclusion

The paper proposes dynamic graph matching for unsupervised video re-ID, iteratively improving label graphs and discriminative metrics. Experiments report accurate label matching and strong performance relative to advanced supervised methods.

  • Dynamic graph matching estimates labels for unsupervised video re-ID.Source: §6 · p. 8
  • The method iteratively updates the graph, discriminative metric, and label estimation process.A two-layer graph-matching cost supports these iterative updates.Source: §6 · p. 8
  • Estimated labels match well with advanced supervised learning methods, with superior performance in extensive experiments.Source: §6 · p. 8

Related papers

Loading 1709.09297v1…