Person Re-identification: Implicitly Defining the Receptive Fields of
Deep Learning Classification Frameworks
- URL: http://arxiv.org/abs/2001.11267v4
- Date: Thu, 2 Jul 2020 19:59:52 GMT
- Title: Person Re-identification: Implicitly Defining the Receptive Fields of
Deep Learning Classification Frameworks
- Authors: Ehsan Yaghoubi, Diana Borza, Aruna Kumar, Hugo Proen\c{c}a
- Abstract summary: This paper describes a solution for implicitly driving the inference of the networks' receptive fields.
We use a segmentation module to distinguish between the foreground (important)/background (irrelevant) parts of each learning instance.
This strategy typically drives the networks to early convergence and appropriate solutions, where the identity and descriptions are not correlated.
- Score: 5.123298347655088
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The \emph{receptive fields} of deep learning classification models determine
the regions of the input data that have the most significance for providing
correct decisions. The primary way to learn such receptive fields is to train
the models upon masked data, which helps the networks to ignore any unwanted
regions, but has two major drawbacks: 1) it often yields edge-sensitive
decision processes; and 2) augments the computational cost of the inference
phase considerably. This paper describes a solution for implicitly driving the
inference of the networks' receptive fields, by creating synthetic learning
data composed of interchanged segments that should be \emph{apriori}
important/irrelevant for the network decision. In practice, we use a
segmentation module to distinguish between the foreground
(important)/background (irrelevant) parts of each learning instance, and
randomly swap segments between image pairs, while keeping the class label
exclusively consistent with the label of the deemed important segments. This
strategy typically drives the networks to early convergence and appropriate
solutions, where the identity and clutter descriptions are not correlated.
Moreover, this data augmentation solution has various interesting properties:
1) it is parameter-free; 2) it fully preserves the label information; and, 3)
it is compatible with the typical data augmentation techniques. In the
empirical validation, we considered the person re-identification problem and
evaluated the effectiveness of the proposed solution in the well-known
\emph{Richly Annotated Pedestrian} (RAP) dataset for two different settings
(\emph{upper-body} and \emph{full-body}), observing highly competitive results
over the state-of-the-art. Under a reproducible research paradigm, both the
code and the empirical evaluation protocol are available at
\url{https://github.com/Ehsan-Yaghoubi/reid-strong-baseline}.
Related papers
- ContextSeg: Sketch Semantic Segmentation by Querying the Context with Attention [7.783971241874388]
This paper presents ContextSeg - a simple yet highly effective approach to tackling this problem with two stages.
In the first stage, to better encode the shape and positional information of strokes, we propose to predict an extra dense distance field in an autoencoder network.
In the second stage, we treat an entire stroke as a single entity and label a group of strokes within the same semantic part using an auto-regressive Transformer with the default attention mechanism.
arXiv Detail & Related papers (2023-11-28T10:53:55Z) - DecoupleNet: Decoupled Network for Domain Adaptive Semantic Segmentation [78.30720731968135]
Unsupervised domain adaptation in semantic segmentation has been raised to alleviate the reliance on expensive pixel-wise annotations.
We propose DecoupleNet that alleviates source domain overfitting and enables the final model to focus more on the segmentation task.
We also put forward Self-Discrimination (SD) and introduce an auxiliary classifier to learn more discriminative target domain features with pseudo labels.
arXiv Detail & Related papers (2022-07-20T15:47:34Z) - Domain Adaptive Semantic Segmentation without Source Data [50.18389578589789]
We investigate domain adaptive semantic segmentation without source data, which assumes that the model is pre-trained on the source domain.
We propose an effective framework for this challenging problem with two components: positive learning and negative learning.
Our framework can be easily implemented and incorporated with other methods to further enhance the performance.
arXiv Detail & Related papers (2021-10-13T04:12:27Z) - DomainMix: Learning Generalizable Person Re-Identification Without Human
Annotations [89.78473564527688]
This paper shows how to use labeled synthetic dataset and unlabeled real-world dataset to train a universal model.
In this way, human annotations are no longer required, and it is scalable to large and diverse real-world datasets.
Experimental results show that the proposed annotation-free method is more or less comparable to the counterpart trained with full human annotations.
arXiv Detail & Related papers (2020-11-24T08:15:53Z) - i-Mix: A Domain-Agnostic Strategy for Contrastive Representation
Learning [117.63815437385321]
We propose i-Mix, a simple yet effective domain-agnostic regularization strategy for improving contrastive representation learning.
In experiments, we demonstrate that i-Mix consistently improves the quality of learned representations across domains.
arXiv Detail & Related papers (2020-10-17T23:32:26Z) - Semi-supervised Collaborative Filtering by Text-enhanced Domain
Adaptation [32.93934837792708]
We consider the problem of recommendation on sparse implicit feedbacks as a semi-supervised learning task.
We focus on the most challenging case -- there is no user or item overlap.
We adopt domain-invariant textual features as the anchor points to align the latent spaces.
arXiv Detail & Related papers (2020-06-28T05:28:05Z) - Attentive WaveBlock: Complementarity-enhanced Mutual Networks for
Unsupervised Domain Adaptation in Person Re-identification and Beyond [97.25179345878443]
This paper proposes a novel light-weight module, the Attentive WaveBlock (AWB)
AWB can be integrated into the dual networks of mutual learning to enhance the complementarity and further depress noise in the pseudo-labels.
Experiments demonstrate that the proposed method achieves state-of-the-art performance with significant improvements on multiple UDA person re-identification tasks.
arXiv Detail & Related papers (2020-06-11T15:40:40Z) - Phase Consistent Ecological Domain Adaptation [76.75730500201536]
We focus on the task of semantic segmentation, where annotated synthetic data are aplenty, but annotating real data is laborious.
The first criterion, inspired by visual psychophysics, is that the map between the two image domains be phase-preserving.
The second criterion aims to leverage ecological statistics, or regularities in the scene which are manifest in any image of it, regardless of the characteristics of the illuminant or the imaging sensor.
arXiv Detail & Related papers (2020-04-10T06:58:03Z)
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.