Context-Aware Graph Convolution Network for Target Re-identification
- URL: http://arxiv.org/abs/2012.04298v3
- Date: Wed, 17 Mar 2021 05:10:13 GMT
- Title: Context-Aware Graph Convolution Network for Target Re-identification
- Authors: Deyi Ji, Haoran Wang, Hanzhe Hu, Weihao Gan, Wei Wu, Junjie Yan
- Abstract summary: The proposed method achieves state-of-the-art performance on both person and vehicle re-identification datasets.
We present a novel Context-Aware Graph Convolution Network (CAGCN), where the probe-gallery relations are encoded into the graph nodes.
Experiments show that the proposed method achieves state-of-the-art performance on both person and vehicle re-identification datasets.
- Score: 61.34688291210318
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Most existing re-identification methods focus on learning robust and
discriminative features with deep convolution networks. However, many of them
consider content similarity separately and fail to utilize the context
information of the query and gallery sets, e.g. probe-gallery and
gallery-gallery relations, thus hard samples may not be well solved due to the
limited or even misleading information. In this paper, we present a novel
Context-Aware Graph Convolution Network (CAGCN), where the probe-gallery
relations are encoded into the graph nodes and the graph edge connections are
well controlled by the gallery-gallery relations. In this way, hard samples can
be addressed with the context information flows among other easy samples during
the graph reasoning. Specifically, we adopt an effective hard gallery sampler
to obtain high recall for positive samples while keeping a reasonable graph
size, which can also weaken the imbalanced problem in training process with low
computation complexity.Experiments show that the proposed method achieves
state-of-the-art performance on both person and vehicle re-identification
datasets in a plug and play fashion with limited overhead.
Related papers
- Federated Graph Condensation with Information Bottleneck Principles [44.404509071881364]
We propose and study the novel problem of federated graph condensation for graph neural networks (GNNs)
We decouple the typical gradient matching process for graph condensation into client-side gradient calculation and server-side gradient matching.
Our framework can consistently protect membership privacy during training.
arXiv Detail & Related papers (2024-05-07T00:08:15Z) - Relation Rectification in Diffusion Model [64.84686527988809]
We introduce a novel task termed Relation Rectification, aiming to refine the model to accurately represent a given relationship it initially fails to generate.
We propose an innovative solution utilizing a Heterogeneous Graph Convolutional Network (HGCN)
The lightweight HGCN adjusts the text embeddings generated by the text encoder, ensuring the accurate reflection of the textual relation in the embedding space.
arXiv Detail & Related papers (2024-03-29T15:54:36Z) - Redundancy-Free Self-Supervised Relational Learning for Graph Clustering [13.176413653235311]
We propose a novel self-supervised deep graph clustering method named Redundancy-Free Graph Clustering (R$2$FGC)
It extracts the attribute- and structure-level relational information from both global and local views based on an autoencoder and a graph autoencoder.
Our experiments are performed on widely used benchmark datasets to validate the superiority of our R$2$FGC over state-of-the-art baselines.
arXiv Detail & Related papers (2023-09-09T06:18:50Z) - CONVERT:Contrastive Graph Clustering with Reliable Augmentation [110.46658439733106]
We propose a novel CONtrastiVe Graph ClustEring network with Reliable AugmenTation (CONVERT)
In our method, the data augmentations are processed by the proposed reversible perturb-recover network.
To further guarantee the reliability of semantics, a novel semantic loss is presented to constrain the network.
arXiv Detail & Related papers (2023-08-17T13:07:09Z) - Learnable Graph Matching: A Practical Paradigm for Data Association [74.28753343714858]
We propose a general learnable graph matching method to address these issues.
Our method achieves state-of-the-art performance on several MOT datasets.
For image matching, our method outperforms state-of-the-art methods on a popular indoor dataset, ScanNet.
arXiv Detail & Related papers (2023-03-27T17:39:00Z) - Efficient Relation-aware Neighborhood Aggregation in Graph Neural Networks via Tensor Decomposition [4.041834517339835]
We propose a novel knowledge graph that incorporates tensor decomposition within the aggregation function of Graph Conalvolution Network (R-GCN)
Our model enhances the representation of neighboring entities by employing projection matrices of a low-rank tensor defined by relation types.
We adopt a training strategy inspired by contrastive learning to relieve the training limitation of the 1-k-k encoder method inherent in handling vast graphs.
arXiv Detail & Related papers (2022-12-11T19:07:34Z) - Spatial-spectral Hyperspectral Image Classification via Multiple Random
Anchor Graphs Ensemble Learning [88.60285937702304]
This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE)
Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region.
Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
arXiv Detail & Related papers (2021-03-25T09:31:41Z) - Addressing Class Imbalance in Scene Graph Parsing by Learning to
Contrast and Score [65.18522219013786]
Scene graph parsing aims to detect objects in an image scene and recognize their relations.
Recent approaches have achieved high average scores on some popular benchmarks, but fail in detecting rare relations.
This paper introduces a novel integrated framework of classification and ranking to resolve the class imbalance problem.
arXiv Detail & Related papers (2020-09-28T13:57:59Z) - Image Retrieval for Structure-from-Motion via Graph Convolutional
Network [13.040952255039702]
We present a novel retrieval method based on Graph Convolutional Network (GCN) to generate accurate pairwise matches without costly redundancy.
By constructing a subgraph surrounding the query image as input data, we adopt a learnable GCN to exploit whether nodes in the subgraph have overlapping regions with the query photograph.
Experiments demonstrate that our method performs remarkably well on the challenging dataset of highly ambiguous and duplicated scenes.
arXiv Detail & Related papers (2020-09-17T04:03:51Z) - Affinity Graph Supervision for Visual Recognition [35.35959846458965]
We propose a principled method to supervise the learning of weights in affinity graphs.
Our affinity supervision improves relationship recovery between objects, even without manually annotated relationship labels.
We show that affinity learning can also be applied to graphs built from mini-batches, for neural network training.
arXiv Detail & Related papers (2020-03-19T23:52:51Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.