Horizontal Pyramid Matching for Person Re-identification

04/14/2018 ∙ by Yang Fu, et al. ∙ University of Illinois at Urbana-Champaign cornell university CloudWalk Technology Co., Ltd. Stevens Institute of Technology 0

Despite the remarkable recent progress, person Re-identification (Re-ID) approaches are still suffering from the failure cases where the discriminative body parts are missing. To mitigate such cases, we propose a simple yet effective Horizontal Pyramid Matching (HPM) approach to fully exploit various partial information of a given person, so that correct person candidates can be still identified even if some key parts are missing. Within the HPM, we make the following contributions to produce a more robust feature representation for the Re-ID task: 1) we learn to classify using partial feature representations at different horizontal pyramid scales, which successfully enhance the discriminative capabilities of various person parts; 2) we exploit average and max pooling strategies to account for person-specific discriminative information in a global-local manner; 3) we introduce a novel horizontal erasing operation during training to further resist the problem of missing parts and boost the robustness of feature representations. Extensive experiments are conducted on three popular benchmarks including Market-1501, DukeMTMC-reID and CUHK03. We achieve mAP scores of 83.1 these benchmarks, which are the new state-of-the-arts.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 3

page 7

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

Introduction

Figure 1: Illustration of the proposed Horizontal Pyramid Matching. We split a person into different horizontal parts of multiple scales. The feature representations produced by Global Average Pooling (GAP) and Global Max Pooling (GMP) of each part are then leveraged to learn to the person Re-ID independently.

Person re-identification (Re-ID) aims at re-identifying a query person from a collection of images, which are taken by multiple cameras across time. It is challenging to learning robust feature representations [Yang et al.2009] for each person because of large variations of human attributes like poses, gaits, clothes, as well as the environmental settings like illumination, complex background, and occlusions. To address the complexities of visual cues, deep-based approaches [Ahmed, Jones, and Marks2015, Hermans, Beyer, and Leibe2017, Ding et al.2015, Chen et al.2017, Li et al.2014] provide promising solutions. However, these approaches only take advantage of global person features, which turns out to be sensitive to the missing key parts.

To relieve such issues, many recent approaches have been focusing on learning partial discriminative feature representations. These methods usually take advantage of both global features like body size and local ones like cloths logo, to enhance the robustness of the Re-ID methods. They can be categorized into three types based on the local-region generation scheme. In the first type, prior knowledge like poses or body landmarks are estimated and extracted to localize the discriminative regions 

[Su et al.2017, Zheng et al.2017, Wei et al.2017]. However, the performance of Re-ID in this case highly relies on the robustness of the pose or landmark estimation models. Unexpected errors like erroneous estimation of poses may greatly influence the identification result. The second type, attention-based approaches  [Liu et al.2016, Liu et al.2017, Zhao et al.2017b, Li, Zhu, and Gong2018, Fu et al.2019]

, focus on extracting the salient regions of interest (ROI) adaptively by localizing the high activations in the deep feature maps. The selected regions however lack semantic interpretation. The third type of methods crop deep feature maps into pre-defined patches or stripes by assuming the images are perfectly aligned 

[Sun et al.2017b, Li et al.2017]

, and are thus prone to errors introduced by outliers.

Figure 2: Comparisons of results w/ HPM and w/o HPM in Person Re-ID.

To effectively learn partial discriminative features and eliminate the negative effect caused by unexpected pose-variant and unaligned cases, we propose a simple yet effective approach, called Horizontal Pyramid Matching (HPM). Our HPM aim to simultaneously exploit global and partial information of a person for the Re-ID task in a more robust and efficient manner. Specifically, we make three contributions as follows:

  • We horizontally slice the deep feature maps into multiple spatial bins using various pyramid scales for the following pooling operation, which is named as Horizontal Pyramid Pooling (HPP), and learn to classify each spatial bins features output from different pyramid scales independently. Intuitively, using multiple scales of bins will incorporate a slack distance to mitigate the outliers issue caused by misalignment. Also, learning multi-scale information independently will enhance the discriminative information learned in all the scale-specific person parts.

  • We combine the average and max pooling features in each partition. In particular, average pooling is able to perceive the global information of each spatial bin and takes the background context into account. In contrast, the max pooling targets on extracts the most discriminative information and ignore those interference information, mainly coming from similar clothing or background. Integrating them both thus balance the effectiveness of these two strategies in a global-local manner.

  • We evaluate our proposed method on three mainstream person re-identification datasets, Market1501, DukeMTMC-ReID and CUHK03(with new protocol).The experimental results show that our model beats most of state-of-arts approaches by end-to-end trainable.

We illustrate our HPM with one example shown in Figure 1. We first extract the feature representation of the given image with multiple convolutional layers and horizontally slice the feature maps at different pyramid scales. The feature representations generated by both global average pooling and max pooling of each partial scrip are then employed to conduct Re-ID independently. By learning the HPM in such a manner, the partial discriminative capability can be enhanced in a more effective way, which can overcome the disadvantages (e.g. sensitive to the missing key parts or misalignment) of current solutions . Figure 2 shows the heatmaps of the last convolutional feature maps learned by w/ HPM and w/o HPM schemes. It is observed that more discriminative parts can be identified by our HPM, which leads to better person Re-ID results.

Extensive experiments and ablation study conducted on Market-1501, DukeMTMC-ReID and CUHK03 have demonstrated the effectiveness of each design. In particular, we achieve the mAP scores of 83.1%, 74.5% and 59.7% on the three benchmarks, which outperform the state-of-the-arts more than 1.5%, 5.3% and 2.2%, respectively.

Related Work

In this section, we review several closely related work including deep learning methods for Person Re-ID, part-based models, spatial pyramid pooling.

Deep learning for Person Re-ID

Deep learning based method has dominated in Re-ID community [Zheng, Yang, and Hauptmann2016]. Yi [Yi et al.2014]

first employed deep neural network to determine if a pair of input images belong to the same ID. In general, two types of models are used for person re-identification: verification and identification model.

For the verification model, they adopt siamese neural network or triplet loss to pull the pair of images with same identity and push away that with different identity [Ahmed, Jones, and Marks2015, Hermans, Beyer, and Leibe2017, Ding et al.2015, Chen et al.2017, Li et al.2014]. In [Hermans, Beyer, and Leibe2017], Hermans et al.. proposed a variant of triplet loss to perform end-to-end deep metric learning, which can outperforms many other published methods by a large margin. However, generally, this kind of model may have a compromised efficiency on large gallery. This is because it does not make full use of Re-ID annotations.

For the identification model [Xiao et al.2016, Zheng, Zheng, and Yang2017a, Sun et al.2017b], it tries to learn a discriminative representation of given input image and it always yields superior accuracy compared with verification model. Xiao et al. [Xiao et al.2016] propose a novel dropout strategy to train a classification model with multiple datasets jointly. In [Zheng, Zheng, and Yang2017a], the verification and classification losses are combined together to learn a discriminative embedding and a similarity measurement at the same time. In [Sun et al.2017b], a Part-based Convolutional network is proposed to learn discriminative part-informed features.

Part-based Model

Recently, many works generate deep representation from local parts for fine-grained discriminative features of person. This kind of part-based model can be divided into three categories. First one is based on some prior knowledge like pose estimation and landmark detection [Zheng et al.2017, Su et al.2017, Wei et al.2017]. These methods share a same drawback that is the gap lying between datasets for pose estimation and person retrieval. Second, several other works abandon the semantic cues for partition [Yao et al.2017, Liu et al.2017, Zhao et al.2017b, Li, Zhu, and Gong2018]. For example, Yao et al. [Yao et al.2017]

employed the Part Loss Networks which enforces the deep network to learn representations for different parts and gain the discriminative power on unseen persons. Third, the partition is cropped into pre-defined patches 

[Sun et al.2017b, Li et al.2017]. Sunet al. [Sun et al.2017b] proposed Part-based Convolutional Baseline (PCB) to learn discriminative partition features. However, the PCB may suffer some outliers, which make the inconsistency in each partition, thus they proposed Refined Part Pooling (RPP) to enhance within-part consistency.

Spatial Pyramid Pooling

Since convolutional neural networks with the fully connectedly layer always require the fixed input size. In order to remove this constrain, He 

et al. [He et al.2014] proposed the Spatial Pyramid Pooling network, which is able to generate a fixed length output regardless of the input size and maintain spatial information by pooling in local spatial bins. Multi-level spatial pooling has also shown to be robust to object deformations. It can improve the performance of classification and object detection tasks. Similarly pyramid pooling module is also used in [Zhao et al.2017a], the pyramid level pooling separates the feature map into different sub-regions and forms pooled representation for different locations.

Figure 3: Overview of the proposed Horizontal Pyramid Matching (HPM) approach. The input image firstly goes through a convolutional neural network to extract its feature maps. Then, the horizontal pyramid pooling is leveraged to producing feature representation of each part using both global average pooling and global max pooling. Finally, prediction of each part is fed into the classifier to conduct partial-level person Re-ID. During the testing stage, we concatenate features of parts at different pyramid scales to form the final feature representation of each image.

Proposed Method

This section describes the structure of Horizontal Pyramid Matching(HPM) framework as shown in Fig 3. The input image is fed into the a backbone network to extract the feature maps. After that, we use horizontal spatial pyramid pooling module to obtain spatial information in each local and global spatial bin. For each horizontal spatial bin, we use both global average pooling operation and max pooling operation to obtain the features of global part and most discriminative part of person body. Then, convolutional layers are used to reduce the dimensions of the column feature maps from 2048 to 256 and each column feature is input into a non-share fully connectedly layer and followed by a softmax function to predict the ID of each input image. During testing, all these features are concatenated together to obtain the final Re-ID feature representations. More details will be given in the following.

Horizontal Pyramid Matching

Backbone Network The HPM can take various network architecture like VGG [Simonyan and Zisserman2014], Resnet [He et al.2016] and Google Inception [Szegedy et al.2016] as the backbone. Our paper choose the Resnet50 as backbone network with some modifications following the previous state-of-the-art [Sun et al.2017b]

. First, the average pooling layer and the fully connected layer are removed. Also, the stride of the conv4_1 is set to 1. As a result, the size extracted feature maps will be

of the input image size.

Horizontal Pyramid Pooling (HPP) module HPP is inspired by Special Pyramid Pooling (SPP) [He et al.2014]

, which is proposed to eliminate uncertain length of feature vectors caused by different input sizes of images. The differences between our HPP module and SPP mainly include two aspects: 1)

motivation: HPP is designed to learn to enhance the discriminative information of partial person body at various scales, while SPP is to address the issue of inconsistent length of image feature vectors. 2) operation: Since the distribution of distinguish partitions of a person is from head to foot, HPP slices the feature maps into multiple scrips in a horizontal manner, which is different from SPP using a 2-D spatial manner. With HPP, we can obtain vectors of fixed length for person parts at different horizontal pyramid scales. These vectors are further fed into one convolutional layer and one fully-connected layer for learning classification. In this way, the discriminative ability of person parts can be captured from global to local, from coarse to fine.

Formally, denote the feature maps extracted by the backbone network as . We adopt 4 pyramid scales within the HPP module and is sliced into several spatial bins horizontally and equally according to different scales. Specifically, assume each spatial bin as . stand for the index of scale and the index of bins in each scale. For instance, means the fourth bin in third pooling scale. Then, we pool each spatial bin by global average and max pooling to generate column feature vector, .

After that, each is fed into a convolutional layer to reduce the dimensions from 2048 to 256, denote as . These with the same i can be considered as a description of the person. This kind of description covers more detailed partial features with the increasing pyramid scales.

Loss Function

We leverage the classification-based model to tackle the person Re-ID task. Therefore, the target is to predict the ID of each person, thus person-specific feature representations can be then learned by the optimized classification model. We use a branch of fully connected layer as the classifier, each feature column vector is fed into a corresponding classifier and following a softmax function to predict its ID. During training, the output of given image is a set of predictions . Each can be formulated as

where the P is the total number of person ID, is the learnt weights of , is the ground truth ID of input image

. The loss function is sum of Cross Entropy loss of each output

.

where N is the size of mini-batch, CE is the Cross Entropy loss.

Variant of HPM

HPM may have some variants different from the basic framework describe above,  e.g. different pyramid scales and pooling strategies.

Number of pyramid scales The HPM can have several different number of scales. Instead of the 4 scales, it can be any number up to the , where is the height of feature map. The HPM structure with different pyramid scales is shown in Table 1.The model will focus on more detailed and fine partitions of the given person with the increasing of pyramid scales. Since our loss function is a linear combination of each pyramid scales, if there are too many pyramid scales, the global information of the person may be underestimated. On the other hand, if too few pyramid scales, the features of local discriminative partition may be more difficult to extract. Thus, choosing a proper pyramid scales that can balance the global and local features is vital for the performance of HPM.

# Pyramid Scale # Spatial Bins Size of Spatial Bins
1 1 24x8
2 1, 2 24x8, 12 x 8
3 1, 2, 4 24 x 8, 12x8, 6x8
4 1, 2, 4, 8 24 x 8, 12x8, 6x8, 3x8
Table 1: HPM Structure with different pyramid scales.

Pooling strategies The HPM uses both average pooling and max pooling. The global average pooling is a traditional operation in many classification framework, because it enforces a corresponding relation between feature maps and categories. However, the global average pooling can lose some very discriminative information by the average operation. For example, if one partition of the person is very discriminative but surrounded by background, in this case, the global average pooling will obtain the average of the discriminative part and the background region, which may lead to a low response and miss it. To deal with this problem, we use both average pooling and max pooling, which can maintain the global relation with the identification and preserve the discriminative part.

We will provide extreme ablation experiments in the following section to validate the effectiveness of our settings.

Experiments

Dataset and Evaluation Protocol

Market1501 [Zheng et al.2015] contains 32,668 images of 1,501 labeled persons of six camera views. There are 19,732 gallery images and 12,936 training images detected by DPM [Felzenszwalb et al.2010], including 751 identities in the training set and 750 identities in the testing set. It also contains 500,000 images as some distractors, which may has a considerable influence on the retrieval accuracy.

DukeMTMC-ReID [Ristani et al.2016, Zheng, Zheng, and Yang2017c] is a subset of the DukeMTMC dataset. It contains 1,812 identities captured by 8 cameras. There are 2,228 query images, 16,522 training images and 17,661 gallery images, with 1,404 identities appear in more than two cameras.Also, similar with the Market1501, the rest 408 IDs are considered as distractor images. DukeMTMC-ReID is one of the most challenging re-ID datasets up to now with so many images from 8 multi-cameras.

CUHK03 [Li et al.2014] consists of 14,097 cropped images from 1,467 identities. For each identity, images are captured from two cameras and there are about 5 images for each view. There are two ways to obtain the annotations: human labeled and detected by DPM. Our evaluation is based on the detected label image.

Evaluation Protocol In our experiment, we use Cumulative Matching Characteristic (CMC) curve and the mean average precision (mAP) to evaluate our approach. CMC represents the accuracy of the person retrieval, it is accurate when each query only has one ground truth. However, when multiple ground truths exist in the gallery, the goal is to return all right match to user. In this case, CMC may not have enough discriminative ability, but the mAP could reflect the recall. For Market-1501 and DukeMTMC-ReID. We use the evaluation packages provided by [Zheng et al.2015] and [Zheng, Zheng, and Yang2017c], respectively. And for CUHK03, we adopt the new training/testing protocol proposed in [Zhong et al.2017]. Moreover, for simplicity, all results reported in this paper is under the single-query setting and does not use the re-ranking proposed in [Zhong et al.2017].

Implementation Details

In order to obtain enough information from person image and proper size of feature map for horizontal pyramid pooling, we resize all the image to 384x128. For the backbone network, we use Resnet50 that initialized with the weights pretrained on ImageNet 

[Deng et al.2009]

. We remove the last fully connected layer and average pooling layer and set the stride of last resent conv4_1 from 2 to 1. The training images are augmented with horizontal flipping and normalization. The batch size is set to 64 and we train model for 60 epoch. The base learning rate is set to 0.1 and decay to 0.01 after 40 epochs. Notice that learning rate for all pretrained Resnet layer is set to 0.1 x base learning rate. The stochastic gradient descent (SGD) with 0.9 momentum is implemented in each mini-batch to update the parameters. During evaluation, we concatenate the feature vectors after the

convolution operation together to generate feature representation of query image. The feature from original image and horizontal flipped image are added up and normalized feature for retrieval evaluation. Our model is implemented on Pytorch platform and train with two NVIDIA TITAN X GPUs. All datasets share the same experiments setting as above.

Figure 4: Qualitative Results: (a) Queries and the corresponding discriminative heatmaps learned by the proposed HPM. (b) Comparisons of R5 of w/ HPM and w/o HPM schemes.
Model Market1501 DukeMTMC-ReID CUHK03
R1 R5 R10 mAP R1 mAP R1 mAP
BoW+kissme [Zheng et al.2015] 44.4 63.9 72.2 20.8 25.1 12.2 6.4 6.4
WARCA [Jose and Fleuret2016] 45.2 68.1 76.0
SVDNet [Sun et al.2017a] 82.3 92.3 95.2 62.1 76.7 56.8 41.5 37.3
PAN [Zheng, Zheng, and Yang2017b] 82.8 63.4 71.6 51.5 36.3 34.0
PAR [Zhao et al.2017b] 81.0 92.0 94.7 63.4
MultiLoss [Li, Zhu, and Gong2017] 83.9 64.4
TripletLoss [Hermans, Beyer, and Leibe2017] 84.9 94.2 69.1
MultiScale [Chen, Zhu, and Gong2017] 88.9 73.1 79.2 60.6 40.7 37.0
MLFN [Chang, Hospedales, and Xiang2018] 90.0 74.3 81.0 62.8 54.7 49.2
HA-CNN [Li, Zhu, and Gong2018] 91.2 75.7 80.5 63.8 41.7 38.6
AlignedReID [Zhang et al.2017] 91.0 96.3 79.4
Deep-Person [Bai et al.2017] 92.3 79.5 80.9 64.8
PCB [Sun et al.2017b] 92.4 97.0 97.9 77.3 81.8 66.1 61.3 54.2
PCB + RPP[Sun et al.2017b] 93.8 97.5 98.5 81.6 83.3 69.2 63.7 57.5
HPM(ours) 94.2 97.5 98.5 82.7 86.6 74.3 63.9 57.5
Table 2: Comparison of the proposed method with the state-of-art on Market-1501, DukeMTMC-ReID and CUHK03 with new protocol. HPM is implemented with four pyramid scales and combine both average pooling and max pooling described in Fig 3.
Model Market1501
R1 R5 mAP
No Pyramid Structure 88.1 94.6 71.2
HPM 94.2(+6.1) 97.5(+2.9) 82.7(+11.5)
Table 3: Evaluation of effectiveness of Pyramid Structure, HPM uses four pyramid scales and combine both average pooling and max pooling, Non pyramid structure split the feature into same partitions as the last scale in HPM but without pyramid structure
Model Feature Dim Market1501 DukeMTMC-ReID CUHK03
R1 R5 R10 mAP R1 R5 R10 mAP R1 R5 R10 mAP
HPM + #PS 1 + Avg pool 256 88.1 94.6 96.4 71.2 79.3 89.7 91.9 61.0 39.2 61.1 71.6 37.3
HPM + #PS 2 + Avg pool 256x(1+2) 92.0 96.9 97.9 78.3 83.1 91.9 93.4 68.9 53.2 73.2 79.6 48.9
HPM + #PS 3 + Avg pool 256x(1+2+4) 92.3 97.2 97.9 79.3 84.5 92.4 94.1 70.8 58.2 76.7 83.1 52.8
HPM + #PS 4 + Avg pool 256x(1+2+4+8) 93.2 97.3 98.1 79.5 84.8 92.5 94.1 72.1 58.6 76.8 83.8 53.4
HPM + #PS 4 + Max pool 256x(1+2+4+8) 93.6 97.7 98.3 81.6 86.2 93.2 94.8 74.1 62.4 78.9 86.3 57.4
HPM + #PS 4 + Max+Avg pool 256x(1+2+4+8) 94.2 97.5 98.5 82.7 86.6 93.0 95.1 74.3 63.9 79.7 86.1 57.5
Table 4: Performance comparison of the proposed method with different pyramid scales and different pooling strategies as described in Section3.4. PS is the abbreviation of Pyramid Scales.

Comparison with the State-of-the-arts

Results on Market1501 Comparisons between HPM and state-of-art approaches on Market1501 are shown in Table 2. The results show that our HPM achieves the mAP of 83.1% and Rank 1 accuracy 94.2%, which both surpass all existing works more than 1.5% and 0.4%, respectively. It should be noted that we do not conduct any post-processing operation ( e.g. the re-rank algorithm given by [Zhong et al.2017]), which can further bring a considerably improvement in terms of mAP. PCB [Sun et al.2017b] is closest competitor, which also leverages partial-based leaning for person Re-ID. However, there are mainly two disadvantages of PCB, i.e. 1) it splits the features maps into pre-defined patches (6 in PCB) with the assumption that most persons in the given images are well aligned, which not make scene and resist to some outliers; 2) its state-of-the-art results are benefited from a powerful post-processing approach called RPP, which enable the optimized model cannot be trained in an end-to-end manner. In contrast, our HPM splits the feature maps according to various pyramid scales, which is more robust compared with PCB in addressing the outliers that are not well aligned. In addition, our HPM can be end-to-end learned and we believe that any post-processing operation can make a continued improvements upon the current results. From Table 2, we can observe that our HPM makes a 5.4% improvements compared with PCB in mAP. Even without post-processing, our HPM is still better than PCB+RPP ( i.e. 83.1% vs. 81.6%). Beyond PCB, the best model aims to deal with different size of person MultiScale [Chen et al.2017] yields the mAP of 73.1% and Rank 1 accuracy of 88.9%. Our HPM model outperforms it by 5.3% and 10.0% on Rank 1 and mAP, respectively.

Results on DukeMTMC-ReID Person Re-ID results on Duke MTMC-ReID are given in Table 2. This dataset is challenging because it has 8 different camera and the person bounding box size varies drastically across different camera views, however, our HPM achieves even better performance on this dataset. Without any post-processing, it still achieves 74.8% on mAP and 86.6% on Rank 1 accuracy, which is better than all other state-of-the-art methods by a large margin, 5.3% and 3.3%. Note that our HPM is the first model that can achieve above 80% on mAP, which surpass all state-of-the-art methods by more than 5.0%

Results on CUHK03 Table 2 shows results on CUHK03 when detected person bounding boxes are used for both training and testing. HPM achieves the best result of mAP, 59.7% under this setting. Although the Rank 1 accuracy of HPM is a little lower than PCB+RPP, there’s a clear gap, more than 2%, between HPM and other methods, including the PCB+RPP, on mAP. And We believe that, as a end-to-end and part-based model, the RPP can also boost the performance HPM further.

Qualitative Result We visualize some examples in Figure 4. Concretely, Figure 4 (a) shows the queries and the corresponding heatmaps111We normalize each feature map of the last convolutional feature maps and sum them together to obtain the heatmap. of the last convolutional feature maps. We observe that the discriminative abilities of multiple person parts are enhanced with our HPM. Figure 4 (b) compares the Re-ID results of w/ HPM and w/o HPM schemes. It can be seen that our HPM is very effective in guaranteeing accurate Re-ID results.

Ablation Study

To verify the effectiveness of each component and setting of HPM, we design several ablation study with different settings on Market-1501, DukeMTMC-ReID and CUHK03, including different number of pyramid scales, w/ and w/o using pyramid structure, different pooling strategies. Note that all unrelated settings are the same as HPM implementation detailed in Section 4.2

Effectiveness of Pyramid Structure Previous analysis shows that the HMP reaches the best performance with four pyramid scales, which has up to 8 partial bins on the feature map. In order to verify the effectiveness of pyramid structure, we remove other branches and just preserve the branch with 8 partial bins. From Table 3, we can observe that Rank 1, Rank 5 and mAP drop from 94.2%, 97.5% and 82.7% to 92.0%, 96.3% and 76.4%, respectively. Such an operation is similar to PCB, which leverage 6 partial bins. The reason is that many persons are not well aligned in the images, and naively split the feature maps into a pre-defined number of bins cannot well resist to unaligned outliers. In addition, discriminative information may hardly be learned for some parts if we apply too dense division. In contrast, with our pyramid structure, we can formulate partial features from coarse to fine, which can finally form into a more robust feature representation for person images.

Number of Pyramid Scales Table 4 shows the Re-ID results of HPM with different pyramid scales,  e.g. 1, 2, 4, 8. From these results, we can find that HPM reaches the best performance with four pyramid scales. Intuitively, the number of pyramid determines the granularity of the partition feature. When , it is equivalent to global pooling. With the increasing the number of , Rank 1 accuracy and mAP are significant improved from 88.1% and 71.2% to 93.2% and 79.5%, as illustrated in Fig 5. The reason why the HPM does not drops dramatically at some point as introduced in [Sun et al.2017b] is that the pyramid structure can combine both global and local features, which may increase the discriminative ability of very small partition. Since the last convolutional feature maps are with 24 horizontal units, we also try more dense pyramid scales, such as 12 and 24. However, more pyramid scales will bring additional computational cost and there is no obvious improvement can be observed. Therefore, we finally adopt 4 pyramid scales in this work.

Figure 5: Impact of pyramid scales. Rank-1 accuracy and mAP are compared.

Pooling Strategies Row4 and Row 5 in Table 4 shows the performance of HPM with different pooling strategies. It can be observed that max pooling performs better than average pooling in the most cases. The reason is that average pooling will take all locations of a particular parts into account and all the locations contribute equally to the final partial representation. Thus, the discriminative ability of the representation produced by average pooling can be easily influenced by the unrelated background patterns. In contrast, the global max pooling only preserve the largest response values for a local view. We consider these two pooling strategies are complementary in producing feature representations from global and local vies. Therefore, we integrate them into a unified model to take advantages from these two strategies. Experimental results in Table 4 demonstrate that mixing the two pooling strategies achieves better results compared with using either of them.

Conclusion

In this work, we propose a novel Horizontal Pyramid Matching (HPM) approach to address the challenging person Re-ID task. The proposed HPM exploits partial information of each person to Re-ID, which successfully enhances the discriminative ability of partial feature and finally forms the into a more robust feature representation for the target person. In addition, we leverage both partial-based global average and max pooling to mine the discriminative information of each part in a global-local manner, which can further improve the robustness of partial features. All the components detailed in this work can be easily embedded into any other framework to make a further performance improvement. Extensive ablation studies and comparisons well demonstrate the effectiveness of our HPM approach. In the future, we are plan to simultaneously optimize Re-ID and other related tasks, such as human activity recognition [Dai et al.2017a, Dai et al.2017b, Dai et al.2019].

Acknowledgements. This work is in part supported by IBM-ILLINOIS Center for Cognitive Computing Systems Research (C3SR) - a research collaboration as part of the IBM AI Horizons Network. Shi is supported in part by IARPA Deep Intermodal Video Analytics (IARPA DIVA). Fu and Zhou are supported by CloudWalk Technology.

References