Hierarchical Online Instance Matching for Person Search


  • Di Chen Nanjing University of Science and Technology
  • Shanshan Zhang Nanjing University of Science and Technology
  • Wanli Ouyang The University of Sydney
  • Jian Yang Nanjing University of Science and Technology
  • Bernt Schiele MPI Informatics




Person Search is a challenging task which requires to retrieve a person's image and the corresponding position from an image dataset. It consists of two sub-tasks: pedestrian detection and person re-identification (re-ID). One of the key challenges is to properly combine the two sub-tasks into a unified framework. Existing works usually adopt a straightforward strategy by concatenating a detector and a re-ID model directly, either into an integrated model or into separated models. We argue that simply concatenating detection and re-ID is a sub-optimal solution, and we propose a Hierarchical Online Instance Matching (HOIM) loss which exploits the hierarchical relationship between detection and re-ID to guide the learning of our network. Our novel HOIM loss function harmonizes the objectives of the two sub-tasks and encourages better feature learning. In addition, we improve the loss update policy by introducing Selective Memory Refreshment (SMR) for unlabeled persons, which takes advantage of the potential discrimination power of unlabeled data. From the experiments on two standard person search benchmarks, i.e. CUHK-SYSU and PRW, we achieve state-of-the-art performance, which justifies the effectiveness of our proposed HOIM loss on learning robust features.




How to Cite

Chen, D., Zhang, S., Ouyang, W., Yang, J., & Schiele, B. (2020). Hierarchical Online Instance Matching for Person Search. Proceedings of the AAAI Conference on Artificial Intelligence, 34(07), 10518-10525. https://doi.org/10.1609/aaai.v34i07.6623



AAAI Technical Track: Vision