## 1.

## Introduction

Person reidentification (PR-ID) is a very important branch of computer vision and has been widely used in many safety-critical applications, such as video surveillance and forensics. The basic task of PR-ID shown in Fig. 1 is to determine whether or not two images from nonoverlapping cameras show the same person of interest. However, in real-world applications, there are many significant challenges for PR-ID because an image pair of a person is usually captured by different cameras with significantly different backgrounds, levels of illumination, viewpoints, occlusions, and image resolutions. To overcome these issues, many PR-ID methods have been proposed in recent years and can be generally classified into two categories: feature representation^{1}^{,}^{2} and metric learning methods.^{3}^{,}^{4} For feature representation methods, Schwartz and Davis^{1} proposed a high-dimensional feature extraction algorithm. Baltieri et al.^{2} proposed a view-independent signature method by mapping the local descriptors extracted from RGB-D sensors on an articulated body model. The pose priors and subject-discriminative features were used to reduce the effects of viewpoint changes.^{5} Li et al.^{6} proposed a cross-view multilevel dictionary learning model to improve the representation power, which contains dictionary learning at different representation levels, including image level, horizontal part level, and patch level. For metric learning methods, Cheng et al.^{3} introduced a new and essential ranking graph Laplacian term, which can minimize the intrapedestrian compactness and maximize the interpedestrian dispersion. Li and Wang^{7} presented a method that learns different metrics from the images of a person obtained from different cameras. In addition, Jing et al.^{4} combined semicoupled low-rank discriminant dictionary learning to achieve super-resolution PR-ID, and Li et al.^{8} also proposed for low-resolution PR-ID, which jointly learns a pair of dictionaries and a mapping to bridge the gap across lower and higher resolution images to incorporate positive and negative pair information and using the projective dictionary to boost PR-ID efficiency.

With the development of deep-learning methods, deep representation learning has recently achieved great success due to its highly effective learning ability. Several deep PR-ID models achieve a great improvement in the accuracy, such as deep metric learning (DML) for practical PR-ID,^{9} a multitask deep network (MDN) for PR-ID,^{10} and a deep linear discriminant analysis of Fisher networks for PR-ID.^{11} However, existing deep-learning-based methods require learning a deep metric network by maximizing the distance among interclass samples and minimizing the distance among intraclass samples simultaneously. These methods do not effectively use the discriminant information among different samples. Therefore, triplet-based PR-ID models have been proposed to improve the efficiency of exploiting discriminant information through three samples, including a multiscale triplet CNN,^{12} distance metric learning with asymmetric impostors (LISTEN),^{13} and a body-structure-based triplet convolutional neural network.^{14}

Although these triplet-based methods can improve the performance of PR-ID, they did not consider constraint from impostors' congeners samples (IC samples). As shown in Fig. 2, some new impostors may be produced when removing existing impostors by existing impostor-based methods. Therefore, how to alleviate effects of these samples is an important problem on PR-ID.

## 1.1.

### Motivation

Research in Refs. 1213.–14 has demonstrated that triplet-based methods can develop more discriminant information than that in pairwise-based methods. However, existing triplet-based methods cannot solve difficulties caused by IC samples, such as they are transformed to new impostors, or they would be dispersed after projection. They cannot fully use the different discriminant information contained in IC samples. To address this problem, two aspects are needed to be considered in triplet-based methods. (i) Existing triplet-based methods^{12}13.^{–}^{14} exploit information in impostors alone without IC samples. (ii) Impostor and its congeners maybe dispersed after projections, which must reduce the matching accuracy for PR-ID. (iii) Most deep PR-ID models are limited to handcrafted features in images by DML instead of the convolution of original images.

## 1.2.

### Contributions

The major contributions of this study are summarized as follows.

1. We propose a deep triplet-group network that fully employs symmetric and asymmetric information (DSAN) for triplets and IC samples (denoted as triplet group), which learns a deep neural network by the convolution of the original images of a person and trains the network with a symmetric and asymmetric constraint loss function to ensure the clustering effect of impostor and its congeners and make them more efficient and discriminable.

2. We design a triplet-group constraint objective function that requires the distance between a negative pair to be larger than that between a positive pair, and the distances between impostor and its congeners (denoted as impostor-group) are minimized simultaneously.

3. We conduct a number of matching accuracy experiments in this study. The experimental results show that our DSAN approach outperforms various triplet-based methods and other deep-learning methods.

## 2.

## Preliminary Knowledge

The corresponding relationships between an impostor and its relevant positive sample pair can be classified into two cases: a symmetric correspondence relationship and an asymmetric correspondence relationship (ACR). Given an impostor ${x}_{k}$ and the corresponding positive sample pair $\u27e8{x}_{i},{x}_{j}\u27e9$, if ${x}_{k}$ is an impostor of ${x}_{i}$ with respect to ${x}_{j}$ and an impostor of ${x}_{j}$ with respect to ${x}_{i}$, the corresponding relationship between ${x}_{k}$ and $\u27e8{x}_{i},{x}_{j}\u27e9$ is symmetric, as shown in Fig. 2(a). Otherwise, the correspondence relationship is asymmetric, as shown in Fig. 2(b). The ratio of impostors in some PR-ID datasets is presented in Ref. 13, and we can see the importance of impostors for PR-ID. For the distance between two samples $\u27e8{x}_{i},{x}_{j}\u27e9$, we compute the Euclidean distance $d(i,j)$ as follows:

where ${\Vert *\Vert}_{F}$ is the Fibonacci normalization.## 2.1.

### Existing Triplet-Based Methods

The impostor-based metric learning method^{15}16.^{–}^{17} exploits the impostors with a “normal” triplet constraint [i.e., for a triplet $\u27e8i,j,k\u27e9$, it requires $d(i,j)<d(i,k)$, where $d(*)$ is a distance function], meaning that they cannot effectively remove the impostors in the case of an ACR. For this reason, Zhu et al.^{13} proposed LISTEN; it requires that $d(i,k)\gg d(i,j)$ and $d(j,k)\gg d(i,j)$ simultaneously. However, LISTEN does not consider the relationship between $d(i,k)$ and $d(j,k)$ and other samples in a same class with $k$. This may lead to producing another impostor when removing the existing impostors, as in Figs. 2(a) and 2(b).

## 2.2.

### Our Overasymmetric and Oversymmetric Relationship Constraints on Triplet

In our method, we transform the symmetric correlated impostor and asymmetric correlated impostor (Fig. 2) in two cases when an overasymmetric relationship (OAR) and an oversymmetric relationship (OSR) meet on positive pair and IC samples. Given a impostor ${x}_{k}$ with its congeners ${X}_{k}=\{{x}_{k}^{1},{x}_{k}^{2},\cdots ,{x}_{k}^{{N}_{k}}\}$ in a same class and the corresponding positive sample pair $\u27e8{x}_{i},{x}_{j}\u27e9$, we want them to become the desirable status as Fig. 2(c) regardless of their previous status, which make ${d}_{ij}$ a very short distance as much as possible, and ${d}_{ik}$ and ${d}_{jk}$ are very long distance as much as possible. To some extreme degree, the correlation in a triplet $\{i,j,k\}$ can be considered as symmetric relationship because ${d}_{ik}$ and ${d}_{jk}$ are extremely longer than ${d}_{ij}$. Meanwhile, we make ${X}_{k}^{\prime}$ be clustering to ${x}_{k}^{\prime}$ for better classification in class $k$ to avoid circumstances in Figs. 2(a) and 2(b).

## 3.

## Proposed Method

We proposed our deep triplet-group network and a person reidentification method for our proposed and details will be described below.

## 3.1.

### Deep Triplet-Group Network

For our deep triplet-group network, we use a deep convolutional network inspired by Schroff et al.^{18} The network architecture is outlined in Fig. 3. We use $M+1$ layers, where the last layer is our OAR and OSR loss function. The input of the network is the triplet samples with impostor’s congeners, and for image ${x}_{i}$, the output of the first layer is ${h}_{i}^{1}=\sigma ({W}^{1}{x}_{i}+{b}^{1})$, where ${W}^{1}$ is the projection matrix, ${b}^{1}$ is the bias vector to be learned in the first layer of our network, and $\sigma $ is a nonlinear active function that is applied in a component-wise manner. ${h}_{i}^{2}=\sigma ({W}^{2}{h}_{i}^{2}+{b}^{2})$, where ${W}^{2}$ is the projection matrix and ${b}^{2}$ is the bias vector to be learned in the second layer of our network. Similarly, the output for the $m$’th layer ($1\le m\le M$) is ${h}_{i}^{m}=\sigma ({W}^{m}{h}_{i}^{m-1}+{b}^{m})$, and that for the top layer is

According to Eq. (1), we compute the distance between the outputs of the $M$’th layer from ${x}_{i}$ and ${x}_{j}$ as follows:

## (3)

$$\begin{array}{c}d({h}_{i}^{M},{h}_{j}^{M})={\Vert {h}_{i}^{M}-{h}_{j}^{M}\Vert}_{F}^{2},\end{array}$$To increase the image classification performance, we expect all positive pair and IC-sample outputs through the network will simultaneously satisfy the OAR and OSR constraints. Assume a desired status, the impostor ${x}_{k}$ should leave ${x}_{i}$ and ${x}_{j}$, a maximal distance simultaneously, and we can consider there will be a symmetric relationship between ${x}_{i}$, ${x}_{j}$, and ${x}_{k}$. However, it is hard to meet this symmetric relationship in reality, and we develop this symmetric relationship on a cluster center ${u}_{k}$ of impostor ${x}_{k}$ and its congeners (denoted impostor group as ${X}_{k}$), which could not only maintain the asymmetric relationship in triplet but also exploit some discriminative information in its congeners to make impostor group more discriminative. In other words, our developed strategy ensures ${X}_{k}$ meets OAR constraint and OSR constraint between ${x}_{i}$ and ${x}_{j}$. In our network, for each triplet group $\u27e8{x}_{i},{x}_{j},{x}_{k}\u27e9$ and congeners ${X}_{k}$ of ${x}_{k}$, the outputs $\u27e8{h}_{i}^{M},{h}_{j}^{M},{h}_{k}^{M}\u27e9$ and ${u}_{k}^{M}$ satisfy the following objective function:

## (4)

$$\mathrm{min}\text{\hspace{0.17em}}J={\Vert d({h}_{i}^{M},{u}_{k}^{M})-d({h}_{j}^{M},{u}_{k}^{M})\Vert}_{F}^{2}-{\Vert d({h}_{i}^{M},{u}_{k}^{M})-d({h}_{i}^{M},{h}_{j}^{M})\Vert}_{F}^{2}\phantom{\rule{0ex}{0ex}}+\alpha d({h}_{i}^{M},{h}_{j}^{M})-\beta d({h}_{i}^{M},{h}_{k}^{M}),$$## (5)

$$\begin{array}{c}\underset{f}{\mathrm{min}}\text{\hspace{0.17em}}H=g\left(\sum _{\u27e8i,j,k\u27e9\in T}J\right)+\frac{\gamma}{2}\sum _{m=1}^{M}({\Vert {W}^{m}\Vert}_{F}^{2}+{\Vert {b}^{m}\Vert}_{2}^{2}),\end{array}$$## (6)

$$\begin{array}{c}g(a)=\frac{1}{\rho}\text{\hspace{0.17em}}\mathrm{log}[1+\mathrm{exp}(\rho a)],\end{array}$$## Algorithm 1

Our DSAN algorithm

Input: Training set $X$, number of network layers $M+1$, learning rate $\mu $, parameters $\alpha $ and $\beta $, and convergence error $\u03f5$; |

Output: Parameters ${W}^{m}$ and ${b}^{m}$, $1\le m\le M$. |

Initialization: Initialize ${W}^{m}$ and ${b}^{m}$ with appropriate values |

for$k=1,2,\cdots ,K$do |

Compute the triple-group collection $T$ |

for$l=1,2,\cdots ,M$do |

Compute ${h}_{i}^{l}$, ${h}_{j}^{l}$, and ${h}_{k}^{l}$-group using the deep network. |

end |

for$l=M,M-1,\cdots ,1$do |

Obtain the gradients according to backpropagation algorithm. |

end |

for$l=1,2,\cdots ,M$do |

Update ${W}^{m}$ and ${b}^{m}$ according to forward propagation algorithm |

end |

Calculate ${H}_{k}$ using Eq. (5). |

If $k>1$ and $\Vert {H}_{k}-{H}_{k-1}\Vert <\u03f5$, go to Return. |

end |

Return:${W}^{m}$ and ${b}^{m}$, where $1\le m\le M$. |

## 3.2.

### Person Reidentification Method

For the image $y$ of a pedestrian in probe from testing image set, we use $y$ as the input of our network with the learned parameter $f$ and obtain its deep feature representation ${h}_{y}^{M}$. Then, we compute the distances between ${h}_{y}^{M}$ and each image in the gallery from testing image set by Eq. (3). Finally, we choose the smallest distance in every distance, including ${h}_{y}^{M}$, and obtain the label of the sample that has the smallest distance with ${h}_{y}^{M}$ as follows:

## (7)

$$\begin{array}{c}{\mathrm{Label}}_{y}=\mathrm{arg}\text{\hspace{0.17em}}\underset{c}{\mathrm{min}}(y,{x}_{c})\xb71\le c\le C,\end{array}$$## 4.

## Experiments

We conducted extensive experiments using five widely used datasets: CUHK03,^{19} CUHK01,^{20} VIPeR,^{21} iLIDS-VID,^{22} and PRID2011.^{23} Here, we compare the performance of our approach with triplet-based state-of-the-art approaches.

## 4.1.

### Datasets and Experimental Settings

Experiments are conducted with one large dataset and four small datasets. The large dataset is the CUHK03 dataset, which contains 13,164 images from 1360 persons. We randomly selected 1160 persons for training, 100 persons for validation, and 100 persons for testing, following exactly the same settings in Refs. 19 and 24. The four small datasets are the CUHK01, VIPeR, iLIDS, and PRID2011 datasets. For these four datasets, we randomly divided the individuals into two equal parts, with one used for training and the other for testing. Moreover, we created triplet collections following the method by Schroff et al.^{18}

To validate the effectiveness of our DSAN approach, we compare the DSAN model with several state-of-the-art metric-learning-based methods: keep it simple and straightforward metric learning (KISSME)^{25} and relaxed pairwise metric learning (RPML).^{26} In addition, our DSAN model was compared with several state-of-the-art deep-learning-based methods: the improved deep-learning architecture (IDLA),^{24} deep ranking PR-ID (DRank),^{27} and an MDN (MTDnet).^{10} Moreover, our DSAN model was compared with some state-of-the-art triplet-based networks: efficient impostor-based metric learning (EIML),^{17} LISTEN,^{13} an improved triplet loss network (ImpTrLoss),^{28} and a spindle Net.^{29}

## 4.2.

### Implementation Details

For evaluating our DSAN, we use TensorFlow^{30} framework to train our DASN. Note that we used network configuration as in Ref. 18. For all datasets, our network contains six convolutional layers, four max polling layers, and one fully connected (FC) layers for each images. These layers configured as below.(1) $\mathrm{Conv.}\text{\hspace{0.17em}\hspace{0.17em}}7\times 7$, stride = 2, feature maps = 64; (2) Max pool $3\times 3$, stride = 2; (2) Max pool $3\times 3$, stride = 2; (3) $\mathrm{Conv.}3\times 3$, stride = 1, feature maps = 192; (4) Max pool $3\times 4$, stride = 2; (5) $\mathrm{Conv.}3\times 3$, stride = 1, feature maps = 384; (6) Max pool $3\times 3$, stride = 2; (7) $\mathrm{Conv.}3\times 3$, stride = 1, feature maps = 256; (8) $\mathrm{Conv.}3\times 3$, stride = 1, feature maps = 256; (9) $\mathrm{Conv.}3\times 3$, stride = 1, feature maps = 256; and (10) FC, output dimension = 128.

For small datasets, we adopt an unsupervised image generating strategy^{31} to solve the problem of lacking training samples. In detail, we use small dataset as source domain and map 10,000 images in CUHK03 dataset into source domain. This strategy makes the 10,000 images follow distribution of target small dataset. Then, we used these generated images to train our model and fine-tune with target small datasets.

## 4.3.

### Results and Analysis

Table 1 shows our rank-1 matching accuracies, and Figs. 4Fig. 5Fig. 6Fig. 7–8 describe cumulative match characteristic (CMC) curves in different ranks on five datasets. We will describe evaluations on five datasets.

## Table 1

Top-ranked matching rates (%) for five datasets.

Method | CUHK03 | CUHK01 | VIPeR | iLIDS | PRID2011 |
---|---|---|---|---|---|

KISSME | 14.17 | 18.25 | 19.61 | 28.58 | 15.75 |

RPML | 18.67 | 20.14 | 23.93 | 31.97 | 18.69 |

IDLA | 54.74 | 65.00 | 45.90 | 58.15 | 43.18 |

DRank | 45.75 | 70.94 | 38.37 | 52.82 | 45.67 |

MTDnet | 74.68 | 77.50 | 45.89 | 41.04 | 32.03 |

EIML | 20.18 | 21.34 | 22.04 | 21.75 | 18.06 |

LISTEN | 23.71 | 32.77 | 39.62 | 32.81 | 53.75 |

ImpTrLoss | 75.37 | 53.70 | 47.8 | 60.45 | 22.00 |

Spindle | 88.5 | 79.9 | 53.8 | 66.3 | 67 |

DSAN | 77.35 | 82.15 | 54.85 | 66.70 | 68.2 |

## 4.3.1.

#### Evaluation with the CUHK03 dataset

The CUHK03 dataset contains 13,164 images of 1360 pedestrians captured by six surveillance cameras. Each identity is observed by two disjoint camera views. On average, there are 4.8 images per identity for each view. This dataset provides both manually labeled pedestrian bounding boxes and bounding boxes automatically obtained by running a pedestrian detector.^{32} We report results for both versions of the data (labeled and detected). Following the protocol used in Ref. 19, we randomly divided the 1360 identities into nonoverlapping training (1160), test (100), and validation (100) sets. This yielded about 26,000 positive pairs before data augmentation. We used a minibatch size of 150 samples and trained the network for 200,000 iterations. We used the validation set to design the network architecture. In Table 1 and Fig. 4, we compare our method against KISSME, IDLA, MTDnet, ImpTrLoss and Spindle net, and it is observed that DSAN outperforms these methods with regards to the rank-1 matching accuracy except for Spindle. We achieve a rank-1 accuracy of 77.35% with the parameters $\alpha =0.35$ and $\beta =0.25$.

## 4.3.2.

#### Evaluation with the CUHK01 dataset

The CUHK01 dataset has 971 identities, with two images per person for each view. Most previous papers have reported results using the CUHK01 dataset by considering 486 identities for testing. With 486 identities in the test set, only 485 identities remain for training. This leaves only 1940 positive samples for training, which makes it practically impossible for a deep architecture with a reasonable size to not overfit if trained from scratch with these data. One way to solve this problem is to use a model trained with the transformed CUHK03 dataset and then test the 486 identities of the CUHK01 dataset. This is unlikely to work well since the network does not know the statistics of the tests with the CUHK01 dataset. In fact, our model was trained with the transformed CUHK03 dataset and adapted for the CUHK01 dataset by fine-tuning it with the CUHK01 dataset with 485 training identities (nonoverlapping with the test set). Table 1 and Fig. 5 compare the performance of our approach with that of other methods. We used a minibatch size of 150 samples and trained the network for 180,000 iterations. Our method obtains a rank-1 accuracy of 79.35% with the parameters $\alpha =0.15$ and $\beta =0.45$, surpassing all other methods individually.

## 4.3.3.

#### Evaluation with the VIPeR dataset.

The VIPeR dataset contains 632 pedestrian pairs with two views, with only one image per person for each view. The testing protocol is to split the dataset in half: 316 pairs for training and 316 pairs for testing. This dataset is extremely challenging for a deep neural network architecture for two reasons: (a) there are only 316 identities for training with one image per person for each view, giving a total of just 316 positives, and (b) the resolution of the images is lower ($48\times 128$ as compared to $60\times 160$ for the CUHK01 dataset). We trained a model using the transformed CUHK03 dataset and then adapted the trained model to the VIPeR dataset by fine-tuning it with 316 training identities. Since the number of negatives is small for this dataset, hard negative mining does not improve results after fine-tuning because most of the negatives were already used during fine-tuning. The results in Table 1 and Fig. 6 show that DSAN outperforms the state-of-the-art methods by a large margin. We used a minibatch size of 150 samples and trained the network for 130,000 iterations. Our rank-1 accuracy is 49.05%, surpassing all other methods for the parameters $\alpha =0.25$ and $\beta =0.15$.

## 4.3.4.

#### Evaluation with the iLIDS dataset

The iLIDS-VID dataset has 300 different pedestrians observed across two disjoint camera views in a public open space. This dataset is very challenging owing to the clothing similarities among people, the lighting, and the viewpoint variations across camera views. There are two versions: a static-image-based version and image-sequence-based version, and we chose the static images for use in our experiments. This version contains 600 images of 300 distinct individuals, with one pair of images from two camera views for each person. We divided the set into 150 individuals for training and the others for testing. In the iLIDS-VID dataset, we also encounter a similar problem, as for the CUHK01 and VIPeR datasets. We used the pretrained model using the transformed CUHK03 dataset and fine-tuned it for training with the iLIDS-VID dataset. From Table 1 and Fig. 7, DSAN outperforms the state-of-the-art methods. We used a minibatch size of 150 samples and trained the network for 180,000 iterations. Our rank-1 accuracy is 62.55% for the parameters $\alpha =0.25$ and $\beta =0.15$.

## 4.3.5.

#### Evaluation with the PRID2011 dataset

This dataset has 385 trajectories from camera A and 749 trajectories from camera B. Among them, only 200 people appear in both cameras. This dataset also has a single hot version, which consists of randomly selected snapshots. The division and pretraining procedure is similar to that for the iLIDS-VID dataset: half for training and the others for testing. Furthermore, the transformed CUHK03 dataset is used to pretrain and fine-tune with the PRID2011 dataset. In our experiments, we used a minibatch size of 150 samples and trained the network for 160,000 iterations. We obtained a rank-1 accuracy of 55.86% with $\alpha =0.25$ and $\beta =0.15$, and the detailed results are presented in Table 1 and Fig. 8.

## 4.4.

### Discussion

In this section, we discuss several effects of OAR and OSR constraints, clustering enter symmetric constraint, and parameter analysis.

## 4.4.1.

#### Effects of the OAR and OSR constraints

To evaluate the effects of the OAR and OSR constraints, we perform experiments with three datasets with or without utilization of the OAR and OSR constraints. The results obtained using DSAN without the OAR or OSR constraint are denoted as DSN and DAN, respectively. Table 2 reports the rank-1 matching rates of DSAN, DSN, and DAN for the five datasets. We can see that using OAR and OSR constraints improves the rank-1 matching rate by at least 3.55%, which indicates that our OAR and OSR constraints can exploit some discriminative information that is useful for PR-ID.

## Table 2

Effects of the OAR and OSR constraints.

Method | CUHK03 | CUHK01 | VIPeR | iLIDS | PRID2011 |
---|---|---|---|---|---|

DAN | 62.80 | 74.84 | 39.27 | 49.36 | 48.18 |

DSN | 59.35 | 67.95 | 34.84 | 50.80 | 47.52 |

DSAN | 77.35 | 82.15 | 54.85 | 66.70 | 68.2 |

## 4.4.2.

#### Effects of our clustering center symmetric constraint

To evaluate effects of our clustering center symmetric constraint, we conduct several experiments without clustering center symmetric constraint, which only use impostor into triplet constraint denoted as DTN. Table 1 reports the top-rank matching accuracy of our experiment and triplet-based methods (LISTEN and ImpTrLoss). It can be shown that our clustering center symmetric constraint improves by 7.081% on average

## 4.4.3.

#### Parameter analysis

In this experiment, we investigate the effect of parameters, including $\alpha $ and $\beta $. Parameter $\alpha $ balances the effect of intraclass term. Parameter $\beta $ controls the effect of interclass term. When one of the parameters is evaluated, the other is fixed as the values given in evaluation of datasets.

We take the experiment on CUHK03 dataset as an example. Figures 9 and 10 show the rank-1 matching rates of our approach versus different values of $\alpha $ and $\beta $ on CUHK03 dataset. We can observe that: (1) DSAN is not sensitive to the choice of $\alpha $ in the range of [0.10, 0.30]; (2) DSAN achieves the best performance when $\alpha $ and $\beta $ are set as 0.35 and 0.25, respectively; and (3) DSAN can obtain relatively good performance when $\beta $ is in the range of [0.20, 0.30]. Similar effects can be observed on other datasets (Besides, the training and testing time are described in Table 3).

## Table 3

Training time and testing time.

Method | DSAN | CUHK01 | VIPeR | iLIDS | PRID2011 |
---|---|---|---|---|---|

Training | 62.80 | 74.84 | 39.27 | 49.36 | 48.18 |

Testing | 59.35 | 67.95 | 34.84 | 50.80 | 47.52 |

## 5.

## Conclusion

We have developed a deep triplet-group network by exploiting symmetric and asymmetric information on clustering center of impostor and its congeners. It differs from existing methods in that it can use the OAR and OSR constraints to exploit more discriminative information from the relationships between positive samples and its impostor clustering center. From the results of extensive experiments, we can draw the following conclusions. (1) DSAN outperforms several state-of-the-art DL-based methods in terms of the matching rate. (2) With the designed OAR and OSR constraints, DSAN can more effectively exploit discriminative information. (3) There exists some useful information in impostor-based clustering center, and the proper utilization of this information can improve performance.

## References

## Biography

**Benzhi Yu** is a PhD student at Hubei Key Laboratory of Transportation of Things, Wuhan University of Technology. His current research interests include image processing and computer vision.

**Ning Xu** received his PhD in electronic science and technology from the University of Electronic Science and Technology of China, in 2003. Later, he was a postdoctoral fellow with Tsinghua University from 2003 to 2005. Currently, he is a professor at the Computer Science Department of Wuhan University of Technology. His research interests include computer-aided design of VLSI circuits and systems, computer architectures, data mining, and highly combinatorial optimization algorithms.