Unsupervised Graph Association for Person Re-Identification

Jinlin Wu, Hao Liu, Yang Yang, Zhen Lei, Shengcai Liao, Stan Z. Li

Abstract

Unsupervised Graph Association (UGA) is a novel framework for person re-identification (Re-ID) that eliminates the need for manual labeling. By employing a two-stage training process—intra-camera learning to distinguish individuals within single views and inter-camera learning via a noise-resistant Cross-View Graph (CVG)—UGA achieves state-of-the-art performance. The method is computationally efficient, requiring only a single consumer-grade GPU, making it highly scalable for real-world applications.

Introduction

Person Re-identification (Re-ID) involves matching a specific pedestrian across a network of non-overlapping cameras. While supervised learning has driven significant progress, it requires massive, expensive datasets of manually labeled image pairs. Labeling is not only costly but often fails to generalize to new environments with different lighting or camera angles.

Figure 1: Conceptual overview of person re-identification across multiple camera views (Cam 1, Cam 2, Cam 3).

Existing unsupervised approaches typically rely on domain adaptation or clustering, which can be easily "poisoned" by noisy associations. The authors propose UGA to address these challenges by breaking the problem into two distinct, manageable stages that prioritize noise reduction and feature discriminability.

Methodology

The UGA framework operates in two primary stages: Intra-camera Learning and Inter-camera Learning.

1. Intra-camera Learning Stage

The model first learns to distinguish between different people within the same camera view, treating each camera as a separate multi-class classification task. A critical component of this stage is the embedding block featuring Batch Normalization (BN). The authors discovered that BN significantly reduces similarity scores for "negative pairs" (different people), making the extracted features far more discriminative.

2. Inter-camera Learning Stage

To match individuals across different cameras, UGA constructs a Cross-View Graph (CVG).

  • Nodes and Edges: Nodes represent the average feature of a tracklet, while edges represent the similarity between tracklets in different cameras.
  • Noise Reduction: To filter out incorrect matches, the model applies a threshold constraint and a symmetric nearest neighbor constraint (Tracklet A must be the nearest neighbor of Tracklet B, and vice versa).
  • Graph-Weighted Loss: The model utilizes edge weights from the graph to scale the loss function, allowing it to learn more from confident matches while ignoring potential noise.
Figure 2: The UGA framework architecture, illustrating the two-stage learning process and the Cross-View Graph (CVG) mechanism.

Experiments and Results

UGA was evaluated on a comprehensive suite of benchmarks, including image-based (Market-1501, DukeMTMC-ReID, MSMT17) and video-based (MARS, iLIDS-Video) datasets.

Key results include:

  • Market-1501: Achieved 70.3% mAP, a significant improvement over the previous tracklet-based state-of-the-art (UTAL at 46.2%).
  • MSMT17: On this complex dataset, UGA reached 21.7% mAP, nearly doubling the performance of previous unsupervised methods.
  • Efficiency: Unlike previous methods requiring multiple high-end GPUs, UGA's iterative graph updates allow training on a single 1080-Ti GPU.

Key Insights and Discussion

  • The Power of Symmetry: The symmetric nearest neighbor constraint proved highly effective at filtering noisy associations, ensuring the model only learns from mutually agreed-upon matches.
  • Discriminative Embeddings: The addition of a Batch Normalization layer in the embedding block was a "silver bullet," making the average similarity of negative samples 17 times smaller than positive samples.
  • Limitations: UGA currently assumes a person appears at most once per camera view during a sampling window. Future work may involve refining the graph mechanism to handle crowded environments where individuals might appear in multiple disconnected tracklets within a single camera view.

Summary updated

Abstract

In this paper, we propose an unsupervised graph association (UGA) framework to learn the underlying view-invariant representations from the video pedestrian tracklets. The core points of UGA are mining the underlying cross-view associations and reducing the damage of noise associations. To this end, UGA is adopts a two-stage training strategy: (1) intra-camera learning stage and (2) intercamera learning stage. The former learns the intra-camera representation for each camera. While the latter builds a cross-view graph (CVG) to associate different cameras. By doing this, we can learn view-invariant representation for all person. Extensive experiments and ablation studies on seven re-id datasets demonstrate the superiority of the proposed UGA over most state-of-the-art unsupervised and domain adaptation re-id methods.
BibTeX
@inproceedings{wu2019unsupervised,
  author = {Jinlin Wu and Hao Liu and Yang Yang and Zhen Lei and Shengcai Liao and Stan Z. Li},
  title = {{Unsupervised Graph Association for Person Re-Identification}},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year = {2019},
  doi = {10.1109/iccv.2019.00841},
}
Figure