
Group affinity guided deep hypergraph model for person re‐identification
Author(s) -
Zeng Qixun,
Yu Huimin
Publication year - 2019
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2018.7791
Subject(s) - hypergraph , group (periodic table) , identification (biology) , artificial intelligence , computer science , mathematics , algorithm , theoretical computer science , chemistry , combinatorics , biology , botany , organic chemistry
Person re‐identification aims at searching in a large gallery image database for images of the same identity as probe image, which can also be treated as a retrieval task in which the pairwise affinity is often used to rank the retrieved images. However, most existing methods of person re‐identification only consider pairwise affinity but ignore the group affinity information. Some frameworks incorporate group affinity into the testing phase, which is not end‐to‐end trainable for deep neural networks. In this Letter, a powerful deep learning based framework for person re‐identification is presented, which aims at fully utilising group affinity information for more discriminative features. Specifically, hypergraph model for group information mining is novelly proposed in the training phase, which significantly improves the performance of features acquired by the baseline networks. Extensive experiments on two popular benchmarks demonstrate the effectiveness of the authors' model and applicability on different baseline networks.