Modern multi-camera systems in public safety, retail analytics, and forensic search rely on person re-identification (Re-ID) to match individuals across non-overlapping views. In practice, Re-ID must cope with cross-camera domain shifts (viewpoint, il...
Modern multi-camera systems in public safety, retail analytics, and forensic search rely on person re-identification (Re-ID) to match individuals across non-overlapping views. In practice, Re-ID must cope with cross-camera domain shifts (viewpoint, illumination), foreground variability (pose, occlusion), and constraints such as limited labels and privacy budgets. This thesis studies cross-camera Re-ID under a unified setting and evaluation protocol spanning three regimes-fully unsupervised learning, unsupervised domain adaptation (UDA), and supervised learning-with consistent query–gallery retrieval and cross-camera CMC/mAP reporting.
We analyze when each regime is appropriate in deployment: fully unsupervised learning eliminates manual labeling on the target camera network but must construct reliable pseudo structures under severe camera bias; UDA transfers knowledge from a labeled source domain to an unlabeled target domain, reducing annotation cost while still suffering from domain shift and clustering noise; supervised learning can achieve the highest accuracy when rich labels are available but incurs substantial annotation overhead. Unifying these regimes clarifies the trade-offs among accuracy, labeling cost, robustness to domain shift, and privacy, and guides the design of scalable systems.
Accordingly, this thesis pursues three complementary aims: (Aim 1) enhance fully unsupervised Re-ID by learning robust cross-camera structures without iden tity labels; (Aim 2) improve UDA Re-ID by injecting mid-level semantic cues into clustering-based adaptation; and (Aim 3) strengthen supervised Re-ID by efficiently exploiting textual side information to emphasize identity-relevant visual cues.
Aim 1 is presented in Chapter 3 as the Optimal Proxy Mining Contrastive Network (OPMCN). OPMCN improves pseudo structures by Hardest Camera Proxy Mining to encourage camera-invariant representations, False Negative Proxies Mining to suppress erroneous negatives, and a PKGC block that couples global and local cues. On multiple large-scale datasets, OPMCN boosts unsupervised performance and robustness to camera bias.
Aim 2 is presented in Chapter 4 as an Auxiliary Attribute Clustering (AAC) framework for UDA Re-ID. A parsing-based attribute generator first produces image-level attribute labels, which are refined by an Attribute Label Refining strategy that removes detrimental categories, truncates over-confident scores, and rectifies incon-sistent labels. The refined attribute labels provide semantic similarity complementary to visual similarity, and AAC fuses both cues in a plug-and-play clustering module, yielding more reliable pseudo labels and competitive UDA performance.
Aim 3 is presented in Chapter 5 as the Text-Guided Fusion Transformer (TGFT) for the supervised regime. TGFT leverages a pretrained CLIP text encoder and a lightweight Gated Cross-Attention Fusion module that injects attribute-level se-mantics into the visual encoder, sharpening identity focus with minimal parameter overhead. Experiments on standard Re-ID benchmarks show consistent gains over strong CNN/ViT baselines.
Overall, these studies offer a unified view across unsupervised, UDA, and su-pervised regimes: high-quality proxies and false-negative control are crucial for label-free Re-ID; mid-level semantic attributes significantly enhance clustering-based domain adaptation; and text-guided fusion provides an efficient way to exploit human-understandable semantics in supervised training.