Person Re-Identification via Generalized Class Prototypes
Md Ahmed Al Muzaddid, William J. Beksi
TL;DR
This paper tackles person Re-ID by moving beyond single-centroid or instance-based representations to a Generalized Class Prototype (GCP) framework that generates multiple prototypes per class via an autoregressive transformer decoder conditioned on a memory of gallery features. The approach explicitly models intra-class diversity and inter-class separation, using a loss that combines triplet supervision with a diversity regularizer to prevent prototype collapse. Experiments on CUHK03-NP, Market-1501, and MSMT17 show that GCP improves retrieval metrics over centroid- and instance-based baselines, with performance enhanced by stronger backbones such as TransReID and PHA. A key contribution is the ability to fix the number of prototypes per class ($N$) to tailor accuracy and mean average precision ($mAP$) to application needs, enabling practical, scalable Re-ID deployments.
Abstract
Advanced feature extraction methods have significantly contributed to enhancing the task of person re-identification. In addition, modifications to objective functions have been developed to further improve performance. Nonetheless, selecting better class representatives is an underexplored area of research that can also lead to advancements in re-identification performance. Although past works have experimented with using the centroid of a gallery image class during training, only a few have investigated alternative representations during the retrieval stage. In this paper, we demonstrate that these prior techniques yield suboptimal results in terms of re-identification metrics. To address the re-identification problem, we propose a generalized selection method that involves choosing representations that are not limited to class centroids. Our approach strikes a balance between accuracy and mean average precision, leading to improvements beyond the state of the art. For example, the actual number of representations per class can be adjusted to meet specific application requirements. We apply our methodology on top of multiple re-identification embeddings, and in all cases it substantially improves upon contemporary results
