Log In Sign Up

Image-Image Domain Adaptation with Preserved Self-Similarity and Domain-Dissimilarity for Person Re-identification

Person re-identification (re-ID) models trained on one domain often fail to generalize well to another. In our attempt, we present a "learning via translation" framework. In the baseline, we translate the labeled images from source to target domain in an unsupervised manner. We then train re-ID models with the translated images by supervised methods. Yet, being an essential part of this framework, unsupervised image-image translation suffers from the information loss of source-domain labels during translation. Our motivation is two-fold. First, for each image, the discriminative cues contained in its ID label should be maintained after translation. Second, given the fact that two domains have entirely different persons, a translated image should be dissimilar to any of the target IDs. To this end, we propose to preserve two types of unsupervised similarities, 1) self-similarity of an image before and after translation, and 2) domain-dissimilarity of a translated source image and a target image. Both constraints are implemented in the similarity preserving generative adversarial network (SPGAN) which consists of a Siamese network and a CycleGAN. Through domain adaptation experiment, we show that images generated by SPGAN are more suitable for domain adaptation and yield consistent and competitive re-ID accuracy on two large-scale datasets.


Similarity-preserving Image-image Domain Adaptation for Person Re-identification

This article studies the domain adaptation problem in person re-identifi...

Identity Preserving Generative Adversarial Network for Cross-Domain Person Re-identification

Person re-identification is to retrieval pedestrian images from no-overl...

Generative Adversarial Networks for Video-to-Video Domain Adaptation

Endoscopic videos from multicentres often have different imaging conditi...

A Novel Unsupervised Camera-aware Domain Adaptation Framework for Person Re-identification

Unsupervised cross-domain person re-identification (Re-ID) faces two key...

Domain Bridge for Unpaired Image-to-Image Translation and Unsupervised Domain Adaptation

Image-to-image translation architectures may have limited effectiveness ...

Domain Camera Adaptation and Collaborative Multiple Feature Clustering for Unsupervised Person Re-ID

Recently unsupervised person re-identification (re-ID) has drawn much at...

Cross Domain Knowledge Transfer for Unsupervised Vehicle Re-identification

Vehicle re-identification (reID) is to identify a target vehicle in diff...

Code Repositories


Image-Image Domain Adaptation with Preserved Self-Similarity and Domain-Dissimilarity for Person Re-identification (

view repo


An implementation of SPGAN using TensorFlow

view repo

1 Introduction

This paper considers domain adaptation in person re-ID. The re-ID task aims at searching for the relevant images to the query. In our setting, the source domain is fully annotated, while the target domain does not have ID labels. In the community, domain adaptation of re-ID is gaining increasing popularity, because 1) of the expensive labeling process and 2) when models trained on one dataset are directly used on another, the re-ID accuracy drops dramatically [6] due to dataset bias [41]. Therefore, supervised, single-domain re-ID methods may be limited in real-world scenarios, where domain-specific labels are not available.

Figure 1: Illustration of self-similarity and domain-dissimilarity. In each triplet, left: an source-domain image, middle: a source-target translated version of the source image, right: an arbitrary target-domain image. We require that 1) a source image and its translated image should contain the same ID, i.e., self-similarity, and 2) the translated image should be of a different ID with any target image, i.e., domain dissimilarity. Note: the source and target domains contain entirely different IDs.
Figure 2: Pipeline of the “learning via translation” framework. First, we translate the labeled images from a source domain to a target domain in an unsupervised manner. Second, we train re-ID models with the translated images using supervised feature learning methods. The major contribution consists in the first step, i.e., similarity preserving image-image translation.

A common strategy for this problem is unsupervised domain adaptation (UDA). But this line of methods assume that the source and target domains contain the same set of classes. Such assumption does not hold for person re-ID because different re-ID datasets usually contain entirely different persons (classes). In domain adaptation, a recent trend consists in image-level domain translation [18, 4, 28]. In the baseline approach

, two steps are involved. First, labeled images from the source domain are transferred to the target domain, so that the transferred image has a similar style with the target. Second, the style-transferred images and their associated labels are used in supervised learning in the target domain. In literature, commonly used style transfer methods include

[27, 22, 48, 57]. In this paper, we use CycleGAN [57] following the practice in [27, 18].

In person re-ID, there is a distinct yet unconsidered requirement for the baseline described above: the visual content associated with the ID label of an image should be preserved after image-image translation. In our scenario, such visual content usually refers to the underlying (latent) ID information for a foreground pedestrian. To meet this requirement tailored for re-ID, we need additional constraints on the mapping function. In this paper, we propose a solution to this requirement, motivated from two aspects. First, a translated image, despite of its style changes, should contain the same underlying identity with its corresponding source image. Second, in re-ID, the source and target domains contain two entirely different sets of identities. Therefore, a translated image should be different from any image in the target dataset in terms of the underlying ID.

This paper introduces the Similarity Preserving cycle-consistent Generative Adversarial Network (SPGAN), an unsupervised domain adaptation approach which generates images for effective target-domain learning. SPGAN is composed of an Siamese network (SiaNet) and a CycleGAN. Using a contrastive loss, the SiaNet pulls close a translated image and its counter part in the source, and push away the translated image and any image in the target. In this manner, the contrastive loss satisfies the specific requirement in re-ID. Note that, the added constraint is unsupervised, i.e., the source labels are not used during domain adaptation. During training, in each mini-batch (batch size = 1), a training image is firstly used to update the Generator (of CycleGAN), then the Discriminator (of CycleGAN), and finally the layers in SiaNet. Through the coordination between CycleGAN and SiaNet, we are able to generate samples which not only possess the style of target domain but also preserve their underlying ID information.

Using SPGAN, we are able to create a dataset on the target domain in an unsupervised manner. The dataset inherits the labels from the source domain and thus can be used in supervised learning in the target domain. The contributions of this work are summarized below:

  • Minor contribution: we present a “learning via translation” baseline for domain adaptation in person re-ID.

  • Major contribution: we introduce SPGAN to improve the baseline. SPGAN works by preserving the underlying ID information during image-image translation.

2 Related Work

Image-image translation. Image-image translation aims at constructing a mapping function between two domains. A representative method is the conditional GAN [20], which using paired training data produces impressive transition results. However, the paired training data is often difficult to acquire. Unpaired image-image translation is thus more applicable. To tackle unpaired settings, a cycle consistency loss is introduced by [22, 48, 57]. In [3], an unsupervised distance loss is proposed for one side domain mapping. In [27], a general framework is proposed by making a shared latent space assumption. A camera style adaptation method [56] is proposed for re-ID based on CycleGAN. Our work aims to find a mapping function between the source domain and target domain, and we are more concerned with similarity preserving translation.

Neural style transfer [12, 23, 43, 21, 5, 24, 19, 25] is another strategy of image-image translation, which aims at replicating the style of one image, while our work focuses on learning the mapping function between two domains, rather than two images.

Unsupervised domain adaptation. Our work relates to unsupervised domain adaptation (UDA) where no labeled target images are available during training. In this community, some methods aim to learn a mapping between source and target distributions [37, 13, 9, 38]. Correlation Alignment (CORAL) [38] proposes to match the mean and covariance of two distributions. Recent methods [18, 4, 28] use an adversarial approach to learn a transformation in the pixel space from one domain to another. Other methods seek to find a domain-invariant feature space [34, 31, 10, 30, 42, 11, 2]. Long et al. [30] and Tzeng et al. [42] use the Maximum Mean Discrepancy (MMD) [15] for this purpose. Ganin et al. [11] and Ajakan et al. [2] introduce a domain confusion loss to learn domain-invariant features. Different from the settings in this paper, most of the UDA methods assume that class labels are the same across domains, while different re-ID datasets contain entirely different person identities (classes). Therefore, the approaches mentioned above can not be utilized directly for domain adaptation in re-ID.

Unsupervised person re-ID. Hand-craft features [32, 14, 7, 33, 26, 51] can be directly employed for unsupervised re-ID. But these feature design methods do not fully exploit rich information from data distribution. Some methods are based on saliency statistics [50, 44]. In [49]

, K-means clustering is used for learning an unsupervised asymmetric metric. Peng

et al. [35] propose an asymmetric multi-task dictionary learning for cross-data transfer.

Recently, several works focus on label estimation of unlabeled target dataset. Ye

et al. [47] use graph matching for cross-camera label estimation. Fan et al. [6] propose a progressive method based on the iterations between K-means clustering and IDE [52] fine-tuning. Liu et al. [29] employ a reciprocal search process to refine the estimated labels. Wu et al. [46] propose a dynamic sampling stragy for one-shot video-based re-ID. Our work seeks to learn re-ID models that can be utilized directly to target domain, and can potentially cooperate with label estimation methods in model initialization. Finally, we would like to refer the reader to the concurrent work named TJ-AIDL [45] that utilizes additional attribute annotation to learn a feature representation space for the unlabeled target dataset.

3 Proposed Method

3.1 Baseline Overview

Given an annotated dataset from source domain and unlabeled dataset from target domain, our goal is to use the labeled source images to train a re-ID model that generalizes well to target domain. Figure 2 presents a pipeline of the “learning via translation” framework, which consists of two steps, i.e., source-target image translation for training data creation, and supervised feature learning for re-ID.

  • Source-target image translation. Using a generative function that translates the annotated dataset from the source domain to target domain in an unsupervised manner, we “create” a labeled training dataset on the target domain. In this paper, we use CycleGAN [57], following the practice in [27, 18].

  • Feature learning. With the translated dataset that contains labels, feature learning methods are applied to train re-ID models. Specifically, we adopt the same setting as [52], in which the rank-1 accuracy and mAP on the fully-supervised Market-1501 dataset is 75.8% and 52.2%.

The focus of this paper is to improve Step 1, so that with better training samples, the overall re-ID accuracy can be improved. The experiment will validate the proposed Step 2 () on several feature learning methods. A brief summary of different methods considered in this paper is presented in Table 1. We denote the method “Direct Transfer” as directly using the training set instead of for model learning. This method yields the lowest accuracy because the style difference between the source and target is not resolved (to be shown in Table 2). Using CycleGAN and SPGAN to generate a new training set, which is more style-consistent with the target, yields improvement.

Method Train. Set Test. Set Accuracy
Supervised +++++
Direct Transfer ++
CycleGAN (basel.) +++
SPGAN ++++
Table 1: A brief summary of different methods considered in this paper. “” and “” denote the Generator in CycleGAN and SPGAN, respectively. , , denote the training set of the source dataset, the training set and testing set of the target dataset, respectively.

3.2 SPGAN: Approach Details

3.2.1 CycleGAN Revisit

CycleGAN introduces two generator-discriminator pairs, and , which map a sample from source (target) domain to target (source) domain and produce a sample that is indistinguishable from those in the target (source) domain, respectively. For generator and its associated discriminator , the adversarial loss is


where and denote the sample distributions in the source and target domain, respectively. For generator and its associated discriminator , the adversarial loss is


Considering there exist infinitely many alternative mapping functions due to the lack of paired training data, CycleGAN introduces a cycle-consistent loss, which attempts to recover the original image after a cycle of translation and reverse translation, to reduce the space of possible mapping functions. The cycle-consistent loss is


Apart from cycle-consistent loss and adversarial loss, we use the target domain identity constraint [40]

as an auxiliary for image-image translation. Target domain identity constraint is introduced to regularize the generator to be the identity matrix on samples from target domain, written as


As mentioned in [57], generators and may change the color of input images without . In experiment, we observe that model may generate unreal results without (Fig. 4(b)). This is undesirable for re-ID feature learning.

Thus, we use to preserve the color composition between the input and output (see Section 4.3).

Figure 3: SPGAN consists of two components: an SiaNet (top) and CycleGAN (bottom). CycleGAN learns mapping functions and between two domains, and the SiaNet learns a latent space that constrains the learning procedure of mapping functions.

3.2.2 Spgan

Applied in person re-ID, similarity preserving is an essential function to generate improved samples for domain adaptation. As analyzed in Section 1, we aim to preserve the ID-related information for each translated image. We emphasize that such information should not be the background or image style, but should be underlying and latent. To fulfill this goal, we integrate a SiaNet with CycleGAN, as shown in Fig 3. During training, CyleGAN is to learn a mapping function between two domains, and SiaNet is to learn a latent space that constrains the learning of mapping function.

Similarity preserving loss function.

We utilize the contrastive loss [16] to train SiaNet:


where and

are a pair of input vectors,

denotes the Euclidean distance between normalized embeddings of two input vectors, and represents the binary label of the pair. if and are positive pair; if and are negative pair.

is the margin that defines the separability in the embedding space. When , the loss of negative training pair is not back-propagated in the system. When , both positive and negative sample pairs are considered. A larger means that the loss of negative training samples has a higher weight in back propagation.

Training image pair selection. In Eq. 5, the contrastive loss uses binary labels of input image pairs. The design of the pair similarities reflects the “self-similarity” and “domain-dissimilarity” principles. Note that, we select training pairs in an unsupervised manner, so that we use the contrastive loss without additional annotations.

Formally, CycleGAN has two generators, i.e., generator which maps source-domain images to the style of the target domain, and generator which maps target-domain images to the style of the source domain. Suppose two samples denoted as and come from the source domain and target domain, respectively. Given and , we define two positive pairs: 1) and , 2) and . In either image pair, the two images contain the same person; the only difference is that they have different styles. In the learning procedure, we encourage the whole network to pull these two images close.

On the other hand, for generators and , we also define two types of negative training pairs: 1) and , 2) and . Such design of negative training pairs is based on the prior knowledge that datasets in different re-ID domains have entirely different sets of IDs. Thus, a translated image should be of different ID from any target image. In this manner, the network pushes two dissimilar images away. Training pairs are shown in Fig. 1. Some positive pairs are also shown in (a) and (d) of each column in Fig. 4.

Overall objective function. The final SPGAN objective can be written as


where controls the relative importance of four objectives. The first three losses belong to the CycleGAN formulation [57], and the contrastive loss induced by SiaNet imposes a new constraint on the system.

SPGAN training procedure. In the training phase, SPGAN are divided into three components which are learned alternately, the generators, discriminators and SiaNet. When the parameters of two components are fixed, the parameters of the third component is updated. We train the SPGAN until the convergence or the maximum iterations.

3.3 Feature Learning

Feature learning is the second step of the “learning via translation” framework. Once we have style-transferred dataset composed of the translated images and their associated labels, the feature learning step is the same as supervised methods. Since we mainly focus on Step 1 (source-target image translation), we adopt the baseline ID-discriminative Embedding (IDE) following the practice in [52, 53, 54]. We employ ResNet-50 [17] as the base model and only modify the output dimension of the last fully-connected layer to the number of training identities. During testing, given an input image, we can extract the 2,048-dim Pool5 vector for retrieval under the Euclidean distance.

Figure 4: Visual examples of image-image translation. The left four columns map Market images to the Duke style, and the right four columns map Duke images to the Market style. From top to bottom: (a) original image, (b) output of CycleGAN, (c) output of CycleGAN + , and (d) output of SPGAN. Images produced by SPGAN have the target style while preserving the ID information in the source.
Figure 5: Illustration of LMP. We partition the feature map into parts horizontally. We conduct global max/avg pooling on each part and concatenate the feature vectors as the final representation.

Local Max Pooling. To further improve re-ID performance on the target dataset

, we introduce a feature pooling method named as local max pooling (LMP). It works on a well-trained IDE model and can reduce the impact of noisy signals incurred by the fake translated images. In the original ResNet-50, global average pooling (GAP) is conducted on Conv5. In our proposal (Fig.

5), we first partition the Conv5 feature maps to parts horizontally, and then conduct global max/avg pooling on each part. Finally, we concatenate the output of global max pooling (GMP) or GAP of each part as the final feature representation. The procedure is nonparametric, and can be directly used in the testing phase. In the experiment, we will compare local max pooling and local average pooling, and demonstrate the superiority of the former (LMP).

4 Experiment

4.1 Datasets

We select two large-scale re-ID datasets for experiment, i.e., Market-1501 [51] and DukeMTMC-reID [36, 53]. Market-1501 is composed of 1,501 identities, 12,936 training images and 19,732 gallery images (with 2,793 distractors). It is split into 751 identities for training and 750 identities for testing. Each identity is captured by at most 6 cameras. All the bounding boxes are produced by DPM [8]. DukeMTMC-reID is a re-ID version of the DukeMTMC dataset [36]. It contains 34,183 image boxes of 1,404 identities: 702 identities are used for training and the remaining 702 for testing. There are 2,228 queries and 17,661 database images. For both datasets, we adopt rank-1 accuracy and mAP for re-ID evaluation [51]. Sample images of the two datasets are shown in Fig.6.

Figure 6: Sample images of (upper left:) DukeMTMC-reID dataset, (lower left:) Market-1501 dataset, (upper right:) Duke images which are translated to Market style, and (lower right:) Market images translated to Duke style. We use SPGAN for unpaired image-image translation.
Methods DukeMTMC-reID Market-1501
rank-1 rank-5 rank-10 rank-20 mAP rank-1 rank-5 rank-10 rank-20 mAP
Supervised Learning 66.7 79.1 83.8 88.7 46.3 75.8 89.6 92.8 95.4 52.2
Direct Transfer 33.1 49.3 55.6 61.9 16.7 43.1 60.8 68.1 74.7 17.0
CycleGAN (basel.) 38.1 54.4 60.5 65.9 19.6 45.6 63.8 71.3 77.8 19.1
CycleGAN (basel.) + 38.5 54.6 60.8 66.6 19.9 48.1 66.2 72.7 80.1 20.7
SPGAN () 37.7 53.1 59.5 65.6 20.0 49.2 66.9 74.0 80.0 20.5
SPGAN () 39.5 55.0 61.4 67.3 21.0 48.7 65.7 73.0 79.3 21.0
SPGAN () 41.1 56.6 63.0 69.6 22.3 51.5 70.1 76.8 82.4 22.8
SPGAN () + LMP 46.9 62.6 68.5 74.0 26.4 58.1 76.0 82.7 87.9 26.9
Table 2: Comparison of various methods on the target domains. When tested on DukeMTMC-reID, Market-1501 is used as source, and vice versa. “Supervised learning” denotes using labeled training images on the corresponding target dataset. “Direct Transfer” means directly applying the source-trained model on the target domain (see Section 3.1). By varying specified in Eq. 5, the sensitivity of SPGAN to the relative importance of the positive and negative pairs is shown. When local max pooling (LMP) is applied, the number of parts is set to 7. We use IDE [52] for feature learning.

4.2 Implementation Details

SPGAN training and testing.

We use Tensorflow

[1] to train SPGAN using the training images of Market-1501 and DukeMTMC-reID. Note that, we do not use any ID annotation during training procedure. In all experiments, we empirically set in Eq. 6 and in Eq. 5

. With an initial learning rate 0.0002, and model stop training after 5 epochs. During the testing procedure, we employ the Generator

for Market-1501 DukeMTMC-reID translation and the Generative for DukeMTMC-reID Market-1501 translation. The translated images are used to fine-tune the model trained on source images.

For CycleGAN, we adopt the architecture released by its authors. For SiaNet, it contains 4 convolutional layers, 4 max pooling layers and 1 fully connected (FC) layer, configured as below. (1) Conv.

, stride = 2, #feature maps = 64; (2) Max pooling

, stride = 2; (3) Conv. , stride = 2, #feature maps = 128; (4) Max pooling , stride = 2; (5) Conv. , stride = 2, feature maps = 256; (6) Max pool , stride = 2; (7) Conv. , stride = 2, #feature maps = 512; (8) Max pooling , stride = 2; (9) FC, output dimension = 128.

Feature learning for re-ID. As described in Section 3.3, we adopt IDE for feature learning.

Specifically, ResNet-50 [17]

pretrained on ImageNet is used for fine-tuning on the translated training set. We modify the output of the last fully-connected layer to 751 and 702 for Market-1501 and DukeMTMC-reID, respectively. We use mini-batch SGD to train CNN models on a Tesla K80 GPU. Training parameters such as batch size, maximum number epochs, momentum and gamma are set to 16, 50, 0.9 and 0.1, respectively. The initial learning rate is set as 0.001, and decay to 0.0001 after 40 epochs.

4.3 Evaluation

Comparison between supervised learning and direct transfer. The supervised learning method and the direct transfer method are specified in Table 1. When comparing the two methods in Table 2, we can clearly observe a large performance drop when directly using a source-trained model on the target domain. For instance, the ResNet-50 model trained and tested on Market-1501 achieves in rank-1 accuracy, but drops to when trained on DukeMTMC-reID and tested on Market-1501. A similar drop can be observed when DukeMTMC-reID is used as the target domain, which is consistent with the experiments reported in [6]. The reason behind the performance drop is the bias of data distributions in different domains.

The effectiveness of the “learning via translation” baseline using CycleGAN. In this baseline domain adaptation approach (Section 3.1), we first translate the label images from the source domain to the target domain and then use the translated images to train re-ID models. As shown in Table 2, this baseline framework effectively improves the re-ID performance in the target dataset. Compared to the direct transfer method, the CycleGAN transfer baseline gains improvements in rank-1 accuracy on Market-1501. When tested on DukeMTMC-reID, the performance gain is +5.0% in rank-1 accuracy. Through such an image-level domain adaptation method, effective domain adaptation baselines can be learned.

The impact of the target domain identity constraint. We conduct experiment to verify the influence of the identity loss on performance in Table 2. We arrive at mixed observations. On the one hand, on DukeMTMC-reID, compared with the CycleGAN baseline, CycleGAN + achieves similar rank-1 accuracy and mAP. On the other hand, on Market-1501, CycleGAN + gains and

improvement in rank-1 accuracy and mAP, respectively. The reason is that Market-1501 has a larger inter-camera variance. When translating Duke images to the Market style, the translated images may be more prone to translation errors induced by the camera variances. Therefore, the identity loss is more effective when Market is the target domain.

As shown in Fig. 4, this loss prevents CycleGAN from generating strangely colored images.

SPGAN effect. On top of the CycleGAN baseline, we replace CycleGAN with SPGAN (). The effectiveness of the proposed similarity preserving constraint can be seen in Table 2. Compared with Cycle + , on DukeMTMC-reID, the similarity preserving constraint leads to and improvement over CycleGAN + in rank-1 accuracy and mAP, respectively. On Market-1501, the gains are and . The working mechanism of SPGAN consists in preserving the underlying visual cues associated with the ID labels. The consistent improvement suggests that this working mechanism is critical for generating suitable samples for training in the target domain. Examples of translated images by SPGAN are shown in Fig. 6.

Figure 7: Domain adaptation performance with different feature learning methods, including IDE (Section 3.3), IDE [55], and SVDNet [39]. Three domain adaptation methods are compared, i.e., direct transfer, CycleGAN with identity loss, and the proposed SPGAN. The results are on Market-1501.

Comparison of different feature learning methods. In Step 2, we evaluate three feature learning methods, i.e., IDE [52] (described in Section 3.3), IDE [55], and SVDNet [39]. Results are shown in Fig. 7. An interesting observation is that, while IDE and SVDNet are superior to IDE under the scenario of “Direct Transfer”, the three learning methods are basically on par with each other when using training samples generated by SPGAN.

A possible explanation is that some translated images are noisy, which has a large effect on better learning methods.

Figure 8: (Eq. 6) v.s re-ID accuracy. A larger means larger weight of similarity preserving constraint.

Sensitivity of SPGAN to key parameters. The margin defined in Eq. 5 is a key parameter. If , the loss of negative pairs is not back propagated. If gets larger, the weight of negative pairs in loss calculation increases. We conduce experiment to verify the impact of , and results are shown in Table 2. When turning off the contribution of negative pairs in Eq. 5, (), SPGAN only marginally improves the accuracy on Market-1501, and even compromises the system on Duke. When increasing to 2, we have much superior accuracy. It indicates that the negative pairs are critical to the system.

Moreover, we evaluate the impact of in Eq. 6 on Market-1501. controls the relative importance of the proposed similarity preserving constraint. As shown in Fig. 9, the proposed constraint is proven effective when compared to , but a larger does not bring more gains in accuracy. Specifically, yields the best accuracy.

#parts mode dim DukeMTMC-reID Market-1501
rank-1 mAP rank-1 mAP
 1 Avg 2048 41.1 22.3 51.5 22.8
Max 44.3 25.0 55.7 21.8
 2 Avg 4096 42.3 23.3 54.4 25.0
Max 45.6 25.5 57.3 26.2
 3 Avg 6144 43.1 23.6 54.9 25.5
Max 45.5 25.6 57.4 26.4
 7 Avg 14336 44.2 24.4 56.0 26.1
Max 46.9 26.4 58.1 26.9
Table 3: Performance of various pooling strategies with different numbers of parts () and pooling modes (maximum or average) over SPGAN. The best results are in bold.

Local max pooling.

We apply the LMP on the Conv5 layer to mitigate the influence of noise. Note that LMP is directly adopted in the feature extraction step for testing without fine-tuning. We empirically study how the number of parts and the pooling mode affect the performance. Experiment is conducted on SPGAN. The performance of various numbers of parts (

) and different pooling modes (max or average) is provided in Table 3. When we use average pooling and , we have the original GAP used in ResNet-50. From these results, we speculate that with more parts, a finer partition leads to higher discriminative descriptors and thus higher re-ID accuracy.

Moreover, we test LMP on supervised learning and domain adaptation scenarios with three feature learning methods, i.e., IDE [52], IDE [55], and SVDNet [39]. As shown in Fig. 9, LMP does not guarantee stable improvement on supervised learning as observed in “IDE” and SVDNet.

However, when applied in the scenario of domain adaptation, LMP yields improvement over IDE, IDE

, and SVDNet. The superiority of LMP probably lies in that max pooling filters out some detrimental signals in the descriptor induced by noisy translated images.

Figure 9: Experiment of LMP on scenarios of supervised learning and domain adaptation with SPGAN and Cycle + . Three feature learning methods are compared, i.e., IDE [52], IDE [55], and SVDNet [39]. The results are on Market-1501.

4.4 Comparison with State-of-the-art Methods

We compare the proposed method with the state-of-the-art unsupervised learning methods on Market-1501 and DukeMTMC-reID in Table

4 and Table 5, respectively.

Methods Market-1501
Setting Rank-1 Rank-5 Rank-10 mAP
Bow [51] SQ 35.8 52.4 60.3 14.8
LOMO [26] SQ 27.2 41.6 49.1 8.0
UMDL [35] SQ 34.5 52.6 59.6 12.4
PUL [6]* SQ 45.5 60.7 66.7 20.5
Direct transfer SQ 43.1 60.8 68.1 17.0
Direct transfer MQ 47.9 65.5 73.0 20.6
CAMEL [49] MQ 54.5 - - 26.3
SPGAN SQ 51.5 70.1 76.8 22.8
SPGAN MQ 57.0 73.9 80.3 27.1
SPGAN+LMP SQ 58.1 76.0 82.7 26.9
Table 4: Comparison with state-of-the-art on Market-1501. * denotes unpublished papers. “SQ” and “MQ” are the single-query and multiple-query settings, respectively. The best results are in bold.

Market-1501. On Market-1501, we first compare our results with two hand-crafted features, i.e., Bag-of-Words (BoW) [51] and local maximal occurrence (LOMO) [26]. Those two hand-crafted features are directly applied on test dataset without any training process, their inferiority can be clearly observed. We also compare existing unsupervised methods, including the Clustering-based Asymmetric MEtric Learning (CAMEL) [49], the Progressive Unsupervised Learning (PUL) [6], and UMDL [35]. The results of UMDL are reproduced by Fan et al. [6]. In the single-query setting, we achieve rank-1 accuracy = 51.5% and mAP = 22.8%. It outperforms the second best method [6] by +6.0% in rank-1 accuracy. In the multiple-query setting, we arrive at rank-1 accuracy = 57.0%, which is +2.5% higher than CAMEL [49]. The comparisons indicate the competitiveness of the proposed method on Market-1501.

DukeMTMC-reID. On DukeMTMC-reID, we compare the proposed method with BoW [51], LOMO [26], UMDL [35], and PUL [6] under the single-query setting (there is no multiple-query setting in DukeMTMC-reID). The result obtained by the proposed method is rank-1 accuracy = 41.1%, mAP = 22.3%. Compared with the second best method, i.e., PUL [6], our result is +11.1% higher in rank-1 accuracy. Therefore, the superiority of SPGAN can be concluded.

Methods DukeMTMC-reID
Rank-1 Rank-5 Rank-10 mAP
Bow [51] 17.1 28.8 34.9 8.3
LOMO [26] 12.3 21.3 26.6 4.8
UMDL [35] 18.5 31.4 37.6 7.3
PUL [6]* 30.0 43.4 48.5 16.4

Direct transfer
33.1 49.3 55.6 16.7
SPGAN 41.1 56.6 63.0 22.3
SPGAN+LMP 46.9 62.6 68.5 26.4

Table 5: Comparison with state-of-the-art on DukeMTMC-reID under the single-query setting. * denotes unpublished papers. The best results are in bold.

5 Conclusion

This paper focuses on domain adaptation in person re-ID. When models trained on one dataset are directly transferred to another dataset, the re-ID accuracy drops dramatically due to dataset bias. To achieve improved performance in the new dataset, we present a “learning via translation” framework for domain adaptation, characterized by 1) unsupervised image-image translation and 2) supervised feature learning. We further propose that the underlying (latent) ID information for the foreground pedestrian should be preserved after image-image translation. To meet this requirement tailored for re-ID, we introduce the unsupervised self-similarity and domain-dissimilarity for similarity preserving image generation (SPGAN). We show that SPGAN better qualifies the generated images for domain adaptation and yields consistent improvement over the CycleGAN.

Acknowledgment. Weijian Deng, Qixiang Ye, and Jianbin Jiao are supported by the NSFC under Grant 61671427, 61771447, and Beijing Municipal Science and Technology Commission. Liang Zheng is the recipient of a SIEF STEM+ Business Fellowship, and Yi Yang is the recipient of the Google Faculty Research Award. We thank Pengxu Wei for many helpful comments.


  • [1] M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard, M. Kudlur, J. Levenberg, R. Monga, S. Moore, D. G. Murray, B. Steiner, P. A. Tucker, V. Vasudevan, P. Warden, M. Wicke, Y. Yu, and X. Zheng.

    Tensorflow: A system for large-scale machine learning.

    In OSDI, 2016.
  • [2] H. Ajakan, P. Germain, H. Larochelle, F. Laviolette, and M. Marchand. Domain-adversarial neural networks. arXiv preprint arXiv:1412.4446, 2014.
  • [3] S. Benaim and L. Wolf. One-sided unsupervised domain mapping. In NIPS, 2017.
  • [4] K. Bousmalis, N. Silberman, D. Dohan, D. Erhan, and D. Krishnan. Unsupervised pixel-level domain adaptation with generative adversarial networks. In CVPR, 2017.
  • [5] T. Q. Chen and M. Schmidt. Fast patch-based style transfer of arbitrary style. arXiv preprint arXiv:1612.04337, 2016.
  • [6] H. Fan, L. Zheng, and Y. Yang. Unsupervised person re-identification: Clustering and fine-tuning. arXiv preprint arXiv:1705.10444, 2017.
  • [7] M. Farenzena, L. Bazzani, A. Perina, V. Murino, and M. Cristani. Person re-identification by symmetry-driven accumulation of local features. In CVPR, 2010.
  • [8] P. Felzenszwalb, D. McAllester, and D. Ramanan. A discriminatively trained, multiscale, deformable part model. In CVPR, 2008.
  • [9] B. Fernando, A. Habrard, M. Sebban, and T. Tuytelaars. Unsupervised visual domain adaptation using subspace alignment. In ICCV, 2013.
  • [10] Y. Ganin and V. S. Lempitsky.

    Unsupervised domain adaptation by backpropagation.

    In ICML, 2015.
  • [11] Y. Ganin, E. Ustinova, H. Ajakan, P. Germain, H. Larochelle, F. Laviolette, M. Marchand, and V. S. Lempitsky.

    Domain-adversarial training of neural networks.

    Journal of Machine Learning Research, 2016.
  • [12] L. A. Gatys, A. S. Ecker, and M. Bethge.

    Image style transfer using convolutional neural networks.

    In CVPR, 2016.
  • [13] B. Gong, Y. Shi, F. Sha, and K. Grauman. Geodesic flow kernel for unsupervised domain adaptation. In CVPR, 2012.
  • [14] D. Gray and H. Tao. Viewpoint invariant pedestrian recognition with an ensemble of localized features. In ECCV, 2008.
  • [15] A. Gretton, K. M. Borgwardt, M. J. Rasch, B. Schölkopf, and A. J. Smola. A kernel two-sample test. Journal of Machine Learning Research, 2012.
  • [16] R. Hadsell, S. Chopra, and Y. LeCun. Dimensionality reduction by learning an invariant mapping. In CVPR, 2006.
  • [17] K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learning for image recognition. In CVPR, 2016.
  • [18] J. Hoffman, E. Tzeng, T. Park, and J.-Y. Zhu. Cycada: Cycle-consistent adversarial domain adaptation. arXiv preprint arXiv:1711.03213, 2017.
  • [19] X. Huang and S. J. Belongie. Arbitrary style transfer in real-time with adaptive instance normalization. In ICCV, 2017.
  • [20] P. Isola, J. Zhu, T. Zhou, and A. A. Efros. Image-to-image translation with conditional adversarial networks. In CVPR, 2017.
  • [21] J. Johnson, A. Alahi, and L. Fei-Fei.

    Perceptual losses for real-time style transfer and super-resolution.

    In ECCV, 2016.
  • [22] T. Kim, M. Cha, H. Kim, J. K. Lee, and J. Kim. Learning to discover cross-domain relations with generative adversarial networks. In ICML, 2017.
  • [23] C. Li and M. Wand. Precomputed real-time texture synthesis with markovian generative adversarial networks. In ECCV, 2016.
  • [24] Y. Li, C. Fang, J. Yang, Z. Wang, X. Lu, and M. Yang. Diversified texture synthesis with feed-forward networks. In CVPR, 2017.
  • [25] Y. Li, N. Wang, J. Liu, and X. Hou. Demystifying neural style transfer. In IJCAI, 2017.
  • [26] S. Liao, Y. Hu, X. Zhu, and S. Z. Li. Person re-identification by local maximal occurrence representation and metric learning. In CVPR, 2015.
  • [27] M. Liu, T. Breuel, and J. Kautz. Unsupervised image-to-image translation networks. In NIPS, 2017.
  • [28] M. Liu and O. Tuzel. Coupled generative adversarial networks. In NIPS, 2016.
  • [29] Z. Liu, D. Wang, and H. Lu. Stepwise metric promotion for unsupervised video person re-identification. In ICCV, 2017.
  • [30] M. Long, Y. Cao, J. Wang, and M. I. Jordan. Learning transferable features with deep adaptation networks. In ICML, 2015.
  • [31] M. Long, G. Ding, J. Wang, J. Sun, Y. Guo, and P. S. Yu. Transfer sparse coding for robust image representation. In CVPR, 2013.
  • [32] B. Ma, Y. Su, and F. Jurie. Covariance descriptor based on bio-inspired features for person re-identification and face verification. Image Vision Comput., 2014.
  • [33] T. Matsukawa, T. Okabe, E. Suzuki, and Y. Sato. Hierarchical gaussian descriptor for person re-identification. In CVPR, 2016.
  • [34] S. Motiian, M. Piccirilli, D. A. Adjeroh, and G. Doretto. Unified deep supervised domain adaptation and generalization. In ICCV, 2017.
  • [35] P. Peng, T. Xiang, Y. Wang, M. Pontil, S. Gong, T. Huang, and Y. Tian.

    Unsupervised cross-dataset transfer learning for person re-identification.

    In CVPR, 2016.
  • [36] E. Ristani, F. Solera, R. Zou, R. Cucchiara, and C. Tomasi. Performance measures and a data set for multi-target, multi-camera tracking. In

    European Conference on Computer Vision workshop on Benchmarking Multi-Target Tracking

    , 2016.
  • [37] K. Saenko, B. Kulis, M. Fritz, and T. Darrell. Adapting visual category models to new domains. In ECCV, 2010.
  • [38] B. Sun, J. Feng, and K. Saenko. Return of frustratingly easy domain adaptation. In AAAI, 2016.
  • [39] Y. Sun, L. Zheng, W. Deng, and S. Wang. SVDNet for pedestrian retrieval. In ICCV, 2017.
  • [40] Y. Taigman, A. Polyak, and L. Wolf. Unsupervised cross-domain image generation. ICLR, 2016.
  • [41] A. Torralba and A. A. Efros. Unbiased look at dataset bias. In CVPR, 2011.
  • [42] E. Tzeng, J. Hoffman, N. Zhang, K. Saenko, and T. Darrell. Deep domain confusion: Maximizing for domain invariance. arXiv preprint arXiv:1412.3474, 2014.
  • [43] D. Ulyanov, V. Lebedev, A. Vedaldi, and V. S. Lempitsky. Texture networks: Feed-forward synthesis of textures and stylized images. In ICML, 2016.
  • [44] H. Wang, S. Gong, and T. Xiang. Unsupervised learning of generative topic saliency for person re-identification. In BMVC, 2014.
  • [45] J. Wang, X. Zhu, S. Gong, and L. Wei.

    Transferable joint attribute-identity deep learning for unsupervised person re-identification.

    In CVPR, 2018.
  • [46] Y. Wu, Y. Lin, X. Dong, Y. Yan, W. Ouyang, and Y. Yang. Exploit the unknown gradually: One-shot video-based person re-identification by stepwise learning. In CVPR, 2018.
  • [47] M. Ye, A. J. Ma, L. Zheng, J. Li, and P. C. Yuen. Dynamic label graph matching for unsupervised video re-identification. In ICCV, 2017.
  • [48] Z. Yi, H. Zhang, P. Tan, and M. Gong. Dualgan: Unsupervised dual learning for image-to-image translation. In ICCV, 2017.
  • [49] H. Yu, A. Wu, and W. Zheng. Cross-view asymmetric metric learning for unsupervised person re-identification. In ICCV, 2017.
  • [50] R. Zhao, W. Ouyang, and X. Wang. Unsupervised salience learning for person re-identification. In CVPR, 2013.
  • [51] L. Zheng, L. Shen, L. Tian, S. Wang, J. Wang, and Q. Tian. Scalable person re-identification: A benchmark. In ICCV, 2015.
  • [52] L. Zheng, Y. Yang, and A. G. Hauptmann. Person re-identification: Past, present and future. arXiv preprint arXiv:1610.02984, 2016.
  • [53] Z. Zheng, L. Zheng, and Y. Yang. Unlabeled samples generated by gan improve the person re-identification baseline in vitro. In ICCV, 2017.
  • [54] Z. Zhong, L. Zheng, D. Cao, and S. Li. Re-ranking person re-identification with k-reciprocal encoding. In CVPR, 2017.
  • [55] Z. Zhong, L. Zheng, G. Kang, S. Li, and Y. Yang. Random erasing data augmentation. arXiv preprint arXiv:1708.04896, 2017.
  • [56] Z. Zhong, L. Zheng, Z. Zheng, S. Li, and Y. Yang. Camera style adaptation for person re-identification. In CVPR, 2018.
  • [57] J. Zhu, T. Park, P. Isola, and A. A. Efros. Unpaired image-to-image translation using cycle-consistent adversarial networks. ICCV, 2017.