arrow
Return

Progressive Context-Aware Graph Feature Learning for Target Re-Identification

delete2023-01-01
delete3
PRE
AI
M
Min Cao
C
Cong Ding
陈晨 (Chen Chen) *
H
Hao Dou
胡晰远 cover
胡晰远 (Xiyuan Hu)
J
Junchi Yan
DOI:10.1109/TMM.2022.3140647delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper aims at robust and discriminative feature learning for target re-identification (Re-ID). In addition to paying attention to the individual appearance information as in most Re-ID methods, we further utilize the abundant contextual information as additional clues to guide the feature learning. Graph as a format of structured data is used to represent the target sample with its context. It describes the first-order appearance information of the samples and the second-order topological relationship information among samples, based on which we compute the feature representation by learning a graph feature embedding. We provide a detailed analysis of graph convolutional network mechanism applied in target Re-ID and propose a novel progressive context-aware graph feature learning method, in which the message passing is dominated by a pre-defined adjacency relationship followed by a learned relationship in a self-adaptive way. The proposed method fully exploits and utilizes contextual information at a low cost for Re-ID. Extensive experiments on five Re-ID benchmarks demonstrate the state-of-the-art performance of the proposed method.
Keywords:
Target re-identification
graph convolutional network
feature learning
contextual information
graph feature learning

Journal

IEEE Transactions on Multimedia cover
IEEE Transactions on Multimedia
IF:
9.7
Papers:
4.5K
Citations:
2.4W

Organization

I
institute of automation, cas
Scholars:
2.2K
Papers: 2.1K
Citations: 2
S
soochow university - china
Scholars:
5.2W
Papers: 3.6W
Citations: 82
C
chinese academy of sciences
Scholars:
56.1W
Papers: 44.8W
Citations: 704
researcher View more organizations