Deep Feature Ranking for Person Re-Identification

Person re-identification plays a critical part in many surveillance applications. Due to complicated illumination environments and various viewpoints, it is still a challenging problem to extract robust features. To solve this issue, we propose a novel deep feature ranking scheme. Our main contribution is to rank achieved deep features, which are obtained by classic deep learning model, and set the sort order number as our feature vector, named as ordinal deep features (ODFs). Person re-identification results are acquired by ranking person candidates by measuring distance based on ODFs. Since applying for rank orders rather than original feature values, our method achieves robust results, especially under the situation of viewpoints shift. Comprehensive experiments are carried out to demonstrate the significance of the proposed feature. Meanwhile, comparative experiments are applied over the publicly available dataset, our method achieves promising performance and outperforms the state of the art methods. Moreover, we applied the proposed feature in the scenario of image classification and discussed the effectiveness.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.