Abstract

The classical person re-identification methods are mostly focused on employing discriminative features amongst which the distance is measured on Euclidean space, while the effort of re-ranking is constrained as the lack of the utilization of quality context representation in embedding set. In this paper, we incorporate graph models on feature subsets resorting to the initial ranking by adopting the integration of the attention mechanism into graph convolution network. On the one hand, the context information regarding embedding pairs is considered to compute feature group similarity through the aggregation operation by using graph convolution networks. On the other hand, we adopt a channel attention mechanism to enhance the contribution of relevant feature channels, further strengthening the ability of similarity pulling and dissimilarity pushing of the overall network. Experimental study shows that the proposed network structure is superior to the state-of-the-art deep neural networks on three very challenging datasets that are popular in examining person re-identification techniques.

Highlights

  • Given a set of probe images, the person re-identification (Re-ID) aims at searching for the identical person across multiple different cameras

  • Deep neural networks have made remarkable successes in feature representation and the task of person Re-ID, large appearance variations in occlusions, viewpoints, illumination, and pose diversity remain challenging as a result of the problem of large inter-class similarity and small intra-class similarity [5]

  • We propose a competitive re-ranking method based on graph convolution channel attention network for person reidentification

Read more

Summary

Introduction

Given a set of probe images, the person re-identification (Re-ID) aims at searching for the identical person across multiple different cameras. Deep neural networks have made remarkable successes in feature representation and the task of person Re-ID, large appearance variations in occlusions, viewpoints, illumination, and pose diversity remain challenging as a result of the problem of large inter-class similarity and small intra-class similarity [5]. This problem has been alleviated by learning additional feature discriminative features through the convolutional neural network that calculates feature similarities by either Euclidean distance or cosine distance [3]. A re-ranking method incorporating similarity information obtained from trainable feature context is desired for weighting paired features

Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.