Consistency-Preserving deep hashing for fast person re-identification

Abstract

Numerous methods have been proposed for person re-identification (Re-ID) with promising performances. While most of them neglect the matching efficiency which is crucial in real-world applications. Recently, several hashing based approaches have been developed, which consider the importance of matching speed in large-scale datasets. Despite the considerable efficiency of these traditional and deep learning based hashing methods, the concomitant matching accuracy reduction is unacceptable in practical application. Towards this end, we propose a novel deep hashing framework, namely Consistency-Preserving Deep Hashing (CPDH), aiming to bridge the gap between the effective high-dimensional feature and low-dimensional binary vector by focusing on the consistency preservation of hash code. First, CPDH designs a new hash structure to extract the hash code. Next, a noise consistency cost is proposed to improve robustness of both hash code and high-dimensional feature. Finally, a topology consistency cost is provided to maintain the ordinal relation between the high-dimensional feature space and Hamming space. Comprehensive experimental results on three widely-used benchmark datasets demonstrate the superior performance of proposed method as compared with existing state-of-the-art approaches.