Part‐level attention networks for cross‐domain person re‐identification

IET Image ProcessingVolume 15, Issue 14 p. 3599-3607 ORIGINAL RESEARCH PAPEROpen Access Part-level attention networks for cross-domain person re-identification Qun Zhao, Qun Zhao orcid.org/0000-0002-0025-8509 College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, China Guizhou Provincial Key Laboratory of Public Big Data, Guiyang, Guizhou, ChinaSearch for more papers by this authorNisuo Du, Nisuo Du Guizhou Provincial Key Laboratory of Public Big Data, Guiyang, Guizhou, ChinaSearch for more papers by this authorZhi Ouyang, Zhi Ouyang Guizhou Provincial Key Laboratory of Public Big Data, Guiyang, Guizhou, ChinaSearch for more papers by this authorNing Kang, Ning Kang University of Electronic Science and Technology of China, Chengdu, ChinaSearch for more papers by this authorZiyan Liu, Ziyan Liu College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, ChinaSearch for more papers by this authorXu Wang, Corresponding Author Xu Wang xuwang@gzu.edu.cn orcid.org/0000-0001-6324-7359 College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, China Correspondence Xu Wang, College of Big Data and Information Engineering, Guizhou University, Guiyang 550025, China; Jingkuan Song, University of Electronic Science and Technology of China, Chengdu 611731, China. Email: xuwang@gzu.edu.cn; jingkuan.song@gmail.comSearch for more papers by this authorQing He, Qing He College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, ChinaSearch for more papers by this authorYiling Xu, Yiling Xu Guizhou Institute of Quantum Information and Big Data Applied Technology, Guiyang, Guizhou, ChinaSearch for more papers by this authorShichun Ge, Shichun Ge Guizhou Institute of Quantum Information and Big Data Applied Technology, Guiyang, Guizhou, ChinaSearch for more papers by this authorJingkuan Song, Corresponding Author Jingkuan Song jingkuan.song@gmail.com University of Electronic Science and Technology of China, Chengdu, China Correspondence Xu Wang, College of Big Data and Information Engineering, Guizhou University, Guiyang 550025, China; Jingkuan Song, University of Electronic Science and Technology of China, Chengdu 611731, China. Email: xuwang@gzu.edu.cn; jingkuan.song@gmail.comSearch for more papers by this author Qun Zhao, Qun Zhao orcid.org/0000-0002-0025-8509 College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, China Guizhou Provincial Key Laboratory of Public Big Data, Guiyang, Guizhou, ChinaSearch for more papers by this authorNisuo Du, Nisuo Du Guizhou Provincial Key Laboratory of Public Big Data, Guiyang, Guizhou, ChinaSearch for more papers by this authorZhi Ouyang, Zhi Ouyang Guizhou Provincial Key Laboratory of Public Big Data, Guiyang, Guizhou, ChinaSearch for more papers by this authorNing Kang, Ning Kang University of Electronic Science and Technology of China, Chengdu, ChinaSearch for more papers by this authorZiyan Liu, Ziyan Liu College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, ChinaSearch for more papers by this authorXu Wang, Corresponding Author Xu Wang xuwang@gzu.edu.cn orcid.org/0000-0001-6324-7359 College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, China Correspondence Xu Wang, College of Big Data and Information Engineering, Guizhou University, Guiyang 550025, China; Jingkuan Song, University of Electronic Science and Technology of China, Chengdu 611731, China. Email: xuwang@gzu.edu.cn; jingkuan.song@gmail.comSearch for more papers by this authorQing He, Qing He College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou, ChinaSearch for more papers by this authorYiling Xu, Yiling Xu Guizhou Institute of Quantum Information and Big Data Applied Technology, Guiyang, Guizhou, ChinaSearch for more papers by this authorShichun Ge, Shichun Ge Guizhou Institute of Quantum Information and Big Data Applied Technology, Guiyang, Guizhou, ChinaSearch for more papers by this authorJingkuan Song, Corresponding Author Jingkuan Song jingkuan.song@gmail.com University of Electronic Science and Technology of China, Chengdu, China Correspondence Xu Wang, College of Big Data and Information Engineering, Guizhou University, Guiyang 550025, China; Jingkuan Song, University of Electronic Science and Technology of China, Chengdu 611731, China. Email: xuwang@gzu.edu.cn; jingkuan.song@gmail.comSearch for more papers by this author First published: 22 June 2021 https://doi.org/10.1049/ipr2.12292AboutSectionsPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat Abstract Person re-identification (Re-ID) is in significant demand for intelligent security and single or multiple-target tracking. However, there are issues in the person Re-ID tasks, such as sharp decline in cross-data sets detection accuracy, poor generalization and cross-domain ability of the model. This work mainly studies the generalization and adaptation of cross-domain person Re-ID models. Different from most existing methods for cross-domain Re-ID tasks, the authors use diversified spatial semantic feature in pixel-level learning in the target domain to improve the generality and adaptability of the model. In the case that no information of the target domain is used during the model training, the trained model is directly tested on the data set of the target domain. It has proven effective to add the attention cascade module into the backbone network combining with the part-level branch. The authors conducted extensive experiments based on the three data sets of Market-1501, DukeMTMC-ReID and MSMT17, resulting in both single-domain and cross-domain tests with an average improvement of Rank1 and mAP values of about 10% compared with Baseline through the authors' proposed method named Part-Level Attention Network. 1 INTRODUCTION The person Re-ID is an extension of the retrieval task which aims to search for the most likely matching image of the same pedestrian from different locations in different time. Person Re-ID is commonly used for security monitoring such as cross-border header tracking and intelligent security. In 2006, Gheissari et al. [1] was the first to propose using colour and significant edge histograms to recognize pedestrians. However, along with rapid expansion of general deep learning research, many scholars [2-7] began to explore person Re-ID methods based on deep learning. Re-ID is an open problem in view of the random and significant changes in person posture, lighting condition, human occlusion and background noise etc. leading to the dislocation of image matching. It is difficult to grasp the fine features that do not only fully describe the aspect of a person but also distinguish them from another. Therefore, methods to acquire discriminative features are significant for person Re-ID tasks. Person Re-ID has made remarkable achievements in the training and testing of single-domain data sets [8, 9]. However, in the cross-domain case (training on a source domain, testing on a target domain) but the performance of the model will be greatly compromised if a new data set is re-identified by using the pre-trained model directly. In order to adapt recognition across domains, researchers have widely explored unsupervised cross-domain adaptive methods [10-14]. Most methods encompass attribute feature transformation from the source domain into the target domain, and then use the transformed image to train the model. However, they require to operate on both the source domain and the target domain, thus increasing the task complexity. Therefore, the challenge we are tackling is not to use any feature information of the target domain, which indicates that the model has been pre-trained and still achieves excellent performance in the new target domain. The most challenging problem is how to optimize the adaptation and generalization ability of the model. In other words, the pre-trained model can still extract discriminative features from other data. In essence, this model has high adaptive generalization ability to extract discriminant features from different data sets. To address this issue, we propose the following improvements to the model of Luo et al. [15], which are used as our baseline: 1. We propose to introduce an attention cascade module by optimizing the SE (Squeeze and Excite) Model and PAM (Position Attention Model) cascade. The attention cascade module enhances the attention on spatial features of persons in the foreground and reduces the influence of background noise on model features. 2. We design a new part-level branch to divide the characteristics of the backbone network and extract the diverse features with different discrimination channel features. 3. By combining features extracted from the backbone network with part-level branch features, Re-ID model is trained to obtain a more generalized and adaptable model. In the following sections, we first review the models and solutions of cross-domain learning, attention and feature learning in person Re-ID tasks (Section 2). We show the overall framework of the PLAN (Part-Level Attention Network) method, including attention cascade module and part-level branch design analysis (Section 3). Subsequently, we perform extensive experiments through three Re-ID data sets, namely, Market-1501, DukeMTMC-ReID and MSMT17, and discuss the role of each module in the PLAN method by ablation experiments (Section 4). We conclude with the problems solved by the PLAN method and produce the best performance in cross domain setup (Section 5). 2 RELATED WORK The task of person Re-ID has cross-domain characteristics in practical applications, which requires a more generalizable and adaptable model. In the past decade, researchers focused on integrating target domain features into model training [16-18] such as camera angles, light intensity, person attributes and image style differences with the methods of GAN or Style transfer. Liu et al. [10] propose a new adaptive transmission network (ATNet) for person Re-ID. According to the principle of 'divide and conquer', ATNet finds the root cause of the domain gap and removes it. ATNet decomposes the complex cross-domain transmission into a group of factor-wise sub-transmissions, where each sub-transmission focuses on the style transmission of one imaging factor. By selecting lighting, resolution and camera angle as the main factors of the difference between domains, ATNet proposes an adaptive strategy to integrate the factor transmission through measuring the influence of these factors on the image, and generates a set of images similar to the target domain style. Yu et al. [19] propose an unsupervised soft multi-label learning model for person Re-ID. Their method is to mine potential label information of unlabelled samples by introducing an auxiliary data set. The model compares an unlabelled image with the source-marked images, and learns a soft multi-label (a vector of likelihoods of the real label) for each unmarked person. There are also many other unsupervised methods [20-25] to train the target domain data set in clustering and false labelling, which operate on the target domain image, to a certain extent in the training model or image processing stage. All the above methods extract features from the image data processing fitting model, but they do not extract more discriminative features from the model itself. The method we propose here is to face the cross-domain challenge directly. The target domain does not participate in the training process of the model at all, only to test the generalizability and adaptability of the model. In the field of deep learning and computer vision, the SE model takes advantage of the relationship between channels [26]; and the channel attention is calculated by the global average of set features. By introducing spatial attention, a convolutional block attention module (CBAM) [27] is proposed to mine channel and spatial attention. They first aggregate the channel information of the feature map using maximum pooling and average pooling. Then these set features are concatenated and convoluted to generate a two-dimensional attention map. The above attention model has been proven to be an effective method to improve the performance of deep neural networks. Inspired by these works, more scholars [28-35] now use an attention mechanism in person Re-ID tasks. Chen et al. [31] propose two different attention branches in person Re-ID tasks to enable the learned feature map to perceive persons and related body parts, respectively. Wang et al. [32] propose an multi-receptive field attention (MRFA) module, which uses filters of different sizes to help the network focus on informative pixels, and introduce a Gaussian level random clipping/filling method to further improve the robustness of the network. Although the above methods apply various attention mechanisms to person Re-ID tasks, most of them only focus on the performance of a single-domain model, and do not test the performance across domains. We use a PAM (Position Attention Model) and an optimized SE Model to form an attention cascade module to join the backbone network, which is derived from the attention module of self-attention [33] improvement. Feature learning is one of the key techniques for pedestrian recognition. In the past few years, various learning methods based on extraction of local, global and multi-branch features have been proposed. Therefore, how to get the characteristics with discrimination and diversity has been a hot topic. Zheng et al. [7] propose a Part-based Convolutional Baseline (PCB) network, which divides the convolution layer uniformly to learn partial features. A PCB network divides people's feature space into six partial networks, and the feature vectors of each part are used to generate a single ID prediction loss. In recent years, the PCB method is very popular; it is widely used in person Re-ID tasks, and more effective methods are developed based on the PCB method [36, 37]. In order to obtain different characteristics from the end-to-end training methods, the multi-branch network architecture has been widely used [4, 7, 38] usually following the shared backbone network with multiple sub-network branches. Therefore, we need to apply different module mechanisms between different branches, such as an attention mechanism. We combine the part-level feature and the multi-branch network to design a new model, which combines the local and global features, to extract the diversity and more discriminative features, and the generalization ability of the model has been improved. The attention cascade module and part-level branch are thus introduced into the backbone network to form our Part-Level Attention Network (PLAN). 3 PART-LEVEL ATTENTION NETWORK The backbone of PLAN is ResNet50. The ResNet50 model is mainly composed from four residual convolution blocks, namely, stages 1 to 4, as shown in Figure 1. An attention cascade module is added after stages 2 and 3, respectively, to extract pixel-level spatial semantic features from the backbone network. The output of stage 4 splits into two branches. One backbone network branch is designed for the training of the backbone network feature classification. An optional Plus branch operates on the global features of the backbone network as the max and average pool, respectively. The other branch is the part-level branch, in which the input features are equally divided into four parts. The eigenvectors of the max pool and the average pool are added and then split into eigencolumn vectors for model training. Finally, the output features of the two branches are spliced and normalized for testing. FIGURE 1Open in figure viewerPowerPoint The pipeline of our part-level attention network 3.1 Attention The position attention model (PAM) is inspired by self-attention [33]. It is used to capture and aggregate semantically related pixels in a spatial domain. Shown in Figure 2, as for each feature map, it is necessary to calculate the degree of correlation between each pixel and the appearance of other pixel points, thus obtaining the red feature map in the figure. But one pixel feature is too small, so instead, we have yellow 2 × 2 and blue 3 × 3 features. The dot product of the three feature graphs is used to obtain the appearance relative feature graph. And then the ith row of S i j is the relationship between the ith point on the characteristic graph and all the other points j. If there are C channel feature maps, then it will end up with C grey feature maps. The input feature X ∈ R C × H × W firstly generates the feature maps F ( x ) ∈ R N × C , G ( x ) ∈ R C × N and H ( x ) ∈ R C × N through 1 × 1 convolution kernel, where C is the number of channels, H × W is the feature map size and N = H × W . Then, F ( x ) and G ( x ) are used to compute the pixel attention matrix S ∈ R N × N , and the correlation between N pixels is obtained, as shown in Formula 1. The pixel level attention matrix S is dotted with the mapping feature H ( x ) , and the PAM feature m j is obtained by normalizing the BN layer. S i j = F x i × G x j . (1) FIGURE 2Open in figure viewerPowerPoint The attention cascade module Here, S i , j represents the degree of attention that the model pays to position i when synthesizing region j. The PAM features are transmitted to the output of the layer through: m j = B N ∑ i , j = 1 N S i , j H x i . (2) A learnable parameter ε is initialized to 0 to control the weight of the output of the attention layer. The output features of the attention layer are then added to the input features to obtain the feature P i and input it into the cascaded optimized SE model: P i = ε m j + x . (3) Optimization of the SE model: Because different channels of the feature map have different effects on identifying objects. SE module in the SENet [26] first carries out Squeeze operation on the feature graph obtained by convolution to produce the channel-level global features, then compiles Excitation operation on the global features to learn the relationship between each channel, and finally multiplied by the original feature graph to obtain the final features. In this way, the model can pay more attention to the channel features and expand the feature receptive field. As the global pooling operation of the SE module has lost some information in space, it is impossible to extract features more comprehensively and accurately in space. We use a 1 × 1 convolution kernel to replace the global pooling layer and the full connection layer in the SE module, and therefore retain the information of features in space. The feature map obtains an attention feature value between 0 and 1 through the Sigmoid activation function: V = S igmoid C o n v Relu C o n v P . (4) As shown in Figure 2, through the cascade of two attention mechanisms, the PAM module obtains the pixel-level spatial characteristics. After optimizing the SE model, it is input into the backbone network to expand the feature receptive field and obtain more comprehensive channel feature information. Therefore, by extracting more accurate and comprehensive pixel-level spatial location features, the pixel-level spatial semantic features of more discriminating people can be obtained. The attention feature is multiplied (dot-product) with the original image feature vector: E = P ∗ V . (5) 3.2 Attention part-level branch A PCB network [7] divides the whole feature space into m horizontal stripes and generates m part-level feature vectors. As shown in Figure 3, through the backbone network, the input image is passed forward with the convolution layer to form a three-dimensional tensor T. PCB only uses the traditional average pooling layer to sample the T-Space into m column vectors g 1 , g 2 , … g m , and then m classifiers generate m ID prediction losses. The fully connected (FC) layer and softmax function are used for classification. Therefore, given a batch of input marker samples ( x i , y i ), i = 1 , … , n , PCB uses multiple IDs to predict the loss as follows: L m I D = ∑ m = 1 n L i d m , (6) L i d p = − 1 n ∑ i = 1 n log exp W p y i T g p i + b y i ∑ j exp W p j T g p j + b j , (7)where W p j and W p y i are the jth and y i th columns of weight matrix W p , respectively, and W p is the P classifier specified by g p . As illustrated in Figure 3, by forcing each part-level feature vector to match a single ID prediction loss, useful part-level features can be obtained to discriminate different persons. However, the multiple part-level feature vector may be unable to capture the discriminative information between persons. This limits the PCB method to obtain part-level information. FIGURE 3Open in figure viewerPowerPoint Part-level branch In order to learn the identification features with part-level, we suggest connecting m part-level feature vectors into a column vector d to calculate a single ID prediction loss: d = d 1 T , d 2 T , d 3 T ⋯ d m T , (8) L i d p = − 1 n ∑ i = 1 n log exp W y i T d i + b y i ∑ j exp W j T d j + b j , (9) where W j and W y i are the jth and y i th columns of weight matrix W, respectively, and W is a single classifier of vector d. The vector d contains all information of the input image, and sufficient discrimination information can be learned by using a single ID loss. The proposed method is thus to perform max pooling (MP) and average pooling (AP) of tensor T to capture the statistical characteristics of different channels in the map: d M A P = 1 m ∑ p = 1 m d p + max d . (10) 4 EXPERIMENTS AND ANALYSIS 4.1 Implementation details Based on the Pytorch framework, the method in this paper uses the Resnet50 model [15] pre-trained on ImageNet as the backbone network. In stage 4, we change the convolution stride from 2 to 1. The input image in the training stage is randomly scaled to 256 × 128 for data expansion with a filling of 10. We randomly extract p-identity and k-person images to form a training batch, while the requirement for triple loss is equal to P × K . Here we set P = 16 and K = 4, and use the Adam method [21] as the optimizer, where β 1 = 0.9 and β 2 = 0.999 . For better performance, we adapt the learning rate according to a fixed schedule in four stages, and use 10 epochs to increase the learning rate from 3.5 × 10 − 5 to 3.5 × 10 − 4 linearly. The learning rate in the 40th stage is decreased to 3.5 × 10 − 5 , while in the 70th stage, the learning rate is decreased to 3.5 × 10 − 6 . A total of 120 epochs were trained in Market-1501 and DukeMTMC-ReID data sets, and 200 epochs were trained in MSMT17 data sets. The learning rate l r ( t ) of period T is calculated as: l r t = 3.5 × 10 − 5 × t 10 i f t ≤ 10 3.5 × 10 − 4 i f 10 < t ≤ 40 3.5 × 10 − 5 i f 40 < t ≤ 70 3.5 × 10 − 6 i f 70 < t ≤ 120 . ( 11 ) We also use a data enhancement method proposed by Zhong et al. [42], called random erasure augmentation (REA). In this experiment, we set the super parameters to P = 0.5, the size of random erasure area to 0.02 < Se < 0.4, and initialize randomly the size of length–width ratio of random erasure area as 0.3 to 3.33. 4.2 Ablation study As shown in Tables 2, 3 and 4, we have done ablation experiments to compare with the baseline presented by Zhong et al. [42] and verified the effectiveness of the attention mechanism, part-level branch, global pooling layer and maximum pooling layer in the three data sets Market-1501, DukeMTMC-ReID and MSMT17, respectively. The introduction of the three data sets is shown in Table 1. In the ablation experiment, M → D means the model is trained with the Market-1501 data set and tested with the DukeMTMC-ReID data set. M s → D represents training the model on MSMT17 and evaluating it on DukeMTMC-ReID etc. In the tables for the ablation study, '+att' stands for adding attention cascade module, i.e. '+att23' represents adding attention cascade modules after both backbone networks stages 2 and 3, '+part' means adding part-level branch, '+amp' stands for MP and AP, '-REA' means removing the random erasure methods (we will use the same abbreviations below). First, we discuss the cases that include REA: 1. The attention cascade module designed is added to the Baseline [15] stages 2 and 3 of our backbone network through the optimized SE model and PAM model, and then obtains the pixel-level spatial semantic features. As shown in Table 2 ('+att'), in a single-domain setting, we get basically the same result as baseline, but in a cross-domain setting, our effectiveness is significantly improved. It shows that the pixel-level spatial semantic features extracted by our attention cascade module optimize the generalization ability of the model. 2. The part-level branch we designed is similar to PCB [7], but the PCB network uses multiple IDs to predict the loss, which limits the acquisition of part-level feature information. Our part-level branch first obtains the characteristics of different channels through MP and AP, and then splices each part's features into a global feature for a single ID prediction loss, so as to obtain more comprehensive feature information pertaining to the complete image. As shown in Table 2 ('+part+amp'), our test results on the Market-1501 and DukeMTMC-ReID data sets are improved to different degrees in both single-domain and cross-domain settings. The performance and generalization ability of the model are further improved by our method of single ID prediction loss for multi-channel characteristics. 3. Now turn to the case with both the attention cascade module and the part-level branch added to the backbone network. First, we extract the pixel-level spatial semantic features, and then through the part-level branch, we refine the features of diversity. Then, we train the network with the global features of the backbone network and achieve the person Re-ID. As shown in Tables 2 and 3, excellent performance has been achieved in the Market-1501, DukeMTMC-ReID and MSMT17 data sets. In Table 2 ('PLAN'), in a single-domain setting, we compare to the Baseline: the values of the Market-1501 data set Rank1 and mAP increase by 1 and 1.9 percentage points, respectively; and the values of the DukeMTMC-ReID data set Rank1 and mAP increase by 3.3 and 4.2 percentage points, respectively. However, in the case of cross-domain settings, the improvement over the baseline is more prominent: Rank1 and mAP values of Market-1501 to DukeMTMC-ReID increase by 16.8 and 13.5 percentage points, respectively; and Rank1 and mAP values of DukeMTMC-ReID to Market-1501 increase by 12.4 and 10.9 percentage points, respectively. In Table 3, we compare the MSMT17 data set to the Baseline in a single-domain setting: the Rank1 and mAP values increase by 5.2 and 5.8 percentage points, respectively; in a cross-domain settings compared to the Baseline: Rank1 and mAP values of MSMT17 to Market-1501 increase by 3.2 and 2.6 percentage points, respectively and the values of MSMT17 to DukeMTMC-ReID Rank1 and mAP increase by 10.6 and 7.1 percentage points, respectively. Cross-domain and single-domain test results improve further as we select the Plus branch in the backbone network. TABLE 1. Comparison of three person Re-ID data sets Data sets Market-150 [39] DukeMTMC-ReID [40, 41] MSMT17 [11] Training images 12,936 16,522 32,621 Training identities 751 702 1041 Query images 3368 2228 11,659 Test images 15,913 17,661 82,161 Test identities 751 702 3060 Cameras 6 8 12 TABLE 2. Market-1501 and DukeMTMC-ReID data sets used REA method to conduct single-domain and cross-domain ablation experiments Methods M → M M → D D → D D → M (REA) Rank1 mAP Rank1 mAP Rank1 mAP Rank1 mAP Baseline 94.1 85.7 27.5 15.0 86.2 75.9 47.4 21.4 +att2 94.7 86.5 33.7 21.1 87.8 77.5 49.3 23.5 +att23 94.0 85.3 42.1 25.4 87.4 75.9 50.3 24.5 +att123 94.4 86.6 40.1 26.1 87.6 77.5 55.3 26.5 +part+amp 94.6 87.2 41.9 25.9 87.0 76.0 55.1 26.0 +att23+part 94.9 87.3 44.2 28.5 89.1 79.7 59.8 30.5 PLAN 95.1 87.6 49.1 31.2 89.5 80.1 62.9 33.3 PLAN(Plus) 95.6 88.1 49.3 31.2 89.6 81.5 62.3 33.5 TABLE 3. Market-1501, DukeMTMC-ReID and MSMT17 data sets were used for single-domain and cross-domain ablation experiments M s → M s M s → M M s → D Methods Rank1 mAP Rank1 mAP Rank1 mAP Baseline 75.6 52.4 56.5 30.0 50.9 34.7 Baseline(-REA) 76.0 47.7 62.6 33.4 60.9 41.5 PLAN 80.8 58.2 59.7 32.6 61.5 41.8 PLAN(Plus) 81.0 58.6 64.1 35.4 64.7 44.6 PLAN(-REA) 77.4 48.4 66.1 36.6 65.1 45.2 TABLE 4. Market-1501 and DukeMTMC-R