Consistency-Preserving deep hashing for fast person re-identification

作者:

Highlights:

• We design a new hash structure to guide the hash code learning to be consistent with the high-dimensional feature learning by applying the same softmax classification loss and an improved triplet distance metric learning loss respectively.

• We propose an effective noise consistency loss to optimize high-dimensional feature learning and hash code extraction in a more robust direction, to keep the prediction of two models same. And these two models are provided with the same image with different noises.

• We propose a new implementation of topology constraint, which bridge the gap caused by feature binarization, and preserve the topology consistency with ordinal relation and label information.

• Comprehensive experimental results on the three widely used datasets with various experimental settings demonstrate the superiority of our proposed method.

摘要

•We design a new hash structure to guide the hash code learning to be consistent with the high-dimensional feature learning by applying the same softmax classification loss and an improved triplet distance metric learning loss respectively.•We propose an effective noise consistency loss to optimize high-dimensional feature learning and hash code extraction in a more robust direction, to keep the prediction of two models same. And these two models are provided with the same image with different noises.•We propose a new implementation of topology constraint, which bridge the gap caused by feature binarization, and preserve the topology consistency with ordinal relation and label information.•Comprehensive experimental results on the three widely used datasets with various experimental settings demonstrate the superiority of our proposed method.

论文关键词:Convolutional neural network,Fast person re-identification,Deep hashing,Consistency preservation

论文评审过程:Received 30 December 2018, Revised 13 May 2019, Accepted 26 May 2019, Available online 27 May 2019, Version of Record 29 May 2019.

论文官网地址:https://doi.org/10.1016/j.patcog.2019.05.036