Lightweight Learning for Partial and Occluded Person Re-identification

IEEE Transactions on Artificial Intelligence(2023)

Cited 0|Views4
No score
Abstract
Occluded and partial person re-identification (re-ID) problems have emerged as challenging research topics in the area of computer vision. Existing part-based models, with complex designs, fail to properly tackle these problems. The reasons for their failures are two-fold. Firstly, individual body part appearances are not discriminative enough to distinguish between two closely appearing persons. Secondly, re-identification datasets typically lack detailed human body-part annotations. To address these challenges, we present a lightweight yet accurate solution for partial person re-identification. Our proposed approach consists of two key components, namely, design of a lightweight Unary-Binary projective Dictionary Learning (UBDL) model, and, construction of a similarity matrix for distilling knowledge from the deep Omni-scale network (OSNet) to UBDL. The unary dictionary (UD) pair encodes patches horizontally, ignoring the viewpoints. The binary dictionary (BD) pairs, on the other hand, are learned between two views, giving more weight to less occluded vertical patches for improving the correspondence across the views. We formulate appropriate convex objective functions for unary and binary cases by incorporating the above knowledge similarity matrix. Closed-form solutions are obtained for updating unary and binary dictionary components. Final matching scores are computed by fusing unary and binary matching scores with adaptive weighting of relevant cross-view patches. Extensive experiments and ablation studies on a number of occluded and partial re-identification datasets like Occluded-REID (O-REID), Partial-REID (PREID) and Partial-iLIDS (P-iLIDS), clearly showcase the merits of our proposed solution.
More
Translated text
Key words
Projective dictionary learning,Unary-Binary pair,Knowledge distillation,Occluded and partial re-ID,Lightweight framework
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined