Minimum Classification Error based Kiss Metric Learning for Personal Reidentification

Minimum Classification Error based Kiss Metric Learning for Personal Reidentification

Special Issue – 2016

International Journal of Engineering Research & Technology (IJERT)

ISSN: 2278-0181

NCETET – 2016 Conference Proceedings

Remya V

PG Scholar

Computer Science and Engineering Younus College of Engineering and Technology,

Kollam, India-691010

Abstract In recent years, person reidentification has re- ceived growing attention with the increasing popularity of intelligent video surveillance. This is because person reiden- tification is critical for human tracking with multiple cameras. Recently, keep it simple and straightforward (KISS) metric learning has been regarded as a top level algorithm for person reidentification. The covariance matrices of KISS are estimated by maximum likelihood (ML) estimation. It is known that discriminative learning based on the minimum classification error (MCE) is more reliable than classical ML estimation with the increasing of the number of training samples. When considering a small sample size problem, direct MCE KISS does not work well, because of the estimate error of small eigenvalues. Therefore, we further introduce the smoothing technique to improve the estimates of the small eigenvalues of a covariance matrix. Our new scheme is termed the minimum classification error-KISS (MCE-KISS). We conduct thorough validation experiments on the VIPeR dataset, which demon- strate the robustness and effectiveness of MCE-KISS for person reidentification.

Index TermsIntelligence video surveillance, LBP Descriptor, HSV histogram, MCE Criterion, Distance metric learning, personal Reidentification

1. INTRODUCTION

   Person reidentification is complex but receives inten- sive attention in the field of intelligent video surveillance (IVS). An aim of person reidentification is to match an instance of a person captured by one camera to another instance of the person captured by different cameras. The person reidentificaiton is a hard problem and still argely unsolved. The main reason may lie in that there usually exists a great variance of a persons appearance in different images obtained by different nonoverlapping cameras. Tra- ditional biometrics, such as face[1][2],iris[3], fingerprint[4], and gait, are not often available, because images are low- quality, variable, and contain motion blur. There are two important stages which need to be considered in the process

   Arun Raj S

   Assistant Professor Information Technology and Engineering

   Younus College of Engineering and Technology,

   Kollam, India-691010

   of person reidentification. They are distance learning, and visual feature extraction and selection.

   KISS(Keep It Simple and Straight forward)[5] is tha Top level algorithm for Person Reidentification. KISS metric learning (KISS) based on an assumption that pairwise dif- ferences are Gaussian distributed. This has acquired state- of-the-art retrieval performance for real applications, such as person reidentification and face recognition.

   The paper introduces the minimum classification error (MCE) criterion to improve KISS distance learning for person reidentification. In particular, eigenvalues of the true covariance matrix are biased, which harms the utilization of the estimated covariance matrix in subsequent operations, such as classification. The covariance matrices of KISS are obtained by maximum likelihood (ML) estimation. With increasing the number of training samples, discriminative learning based on MCE[6] is more reliable than classical ML estimation. However, only introducing the MCE criterion to the training procedure does not work well to estimate the small eigenvalues of the covariance matrices. Therefore, the smoothing technique[7] is required to improve the estimate of the small eigenvalues of a covariance matrix. The im- proved KISS is termed the minimum classification error- KISS, or simply MCE-KISS.

2. LITERATURE SURVEY

   Existing work on personre-identification and appearance modeling can be roughly categorized into three categories: distance learning, local feature selection, and segmentation based matching.

   In distance learning[11], a distance metric is learnt as a means of representing the similarity of individuals between camera pairs. In local feature selection, supervised or unsu- pervised algorithms are designed to select the most relevant features for person re-identification. In segmentation based matching,images of persons are first divided into small blobs and then the correspondences between these blobs are calculated.

   In another point of view, existing techniques can be also

   categorized as single-shot and multiple-shot groups based on

   Volume 4, Issue 17 Published by, www.ijert.org 1

   Special Issue – 2016

   their experimental setups. In the single-shot group, an asso- ciating pair of images,each containing one instance of the individual,are used for training and testing,respectively.The approaches have to model a person by analyzing the sin- gle training image. In contrast to the single-shot group,the multiple-shot approaches train and test the person appear- ance model using multiple images which are usually ob- tained through tracking.The person re-identification presents a number of challenges beyond tracking and object detec- tion.

   1. Using quaternionic local binary pattern

      Person reidentification is to identify the persons ob- served in nonoverlapping camera networks. Most existing methods usually extract features from the red, green, and blue color channels of images individually. They, however, neglect the connections between each color component in the image. To overcome this problem, a novel quaternionic local binary pattern (QLBP)[14] is proposed for person reidentification in this paper. The quaternion, introduced by Hamilton in 1843, is a four-dimensional generation of the complex number with one real part and three imaginary parts. It can be represented in a complex form as follows: q = a + ib + jc + kd, where a, b, c and d are real numbers, i, j and k are complex operators, In the proposed QLBP, each pixel in a color image is represented by a quaternion so that we can handle all color components in a holistic way and then extract LBP features[8] based on the quater- nionic representation. Consequently, the obtained features integrate advantages of both the quaternionic representation and LBP such that they can be used to address the person reidentification problem well. A novel pseudo-rotation of quaternion (PRQ) is proposed to rank two quaternions. After a QLBP coding,the local histograms are extracted and used as features.

   2. Using Spatiotemporal Appearance

      This paper focuses on reidentification algorithms that use the overall appearance of an individual as opposed to passive biometrics such as face and gait. Person reidentification approaches have two aspects:(i) establish correspondence between parts.(ii) generate signatures that are invariant to variations in illumination, pose, and the dynamic appear- ance of clothing.A novel spatiotemporal [15] segmentation algorithm is employed to generate salient edgels that are robust to changes in appearance of clothing. The invariant signatures are generated by combining normalized color and salient edgel histograms.Two approaches are proposed to generate correspondences:(i)a model based approach that fits an articulated model to each individual to establish a correspondence map.(ii)an interest point operator approach that nominates a large number of potential correspondences which are evaluated usin a region growing scheme.

      International Journal of Engineering Research & Technology (IJERT)

      ISSN: 2278-0181

      NCETET – 2016 Conference Proceedings

   3. Using Attribute-restricted latent topic model

      This paper, proposes a novel Attribute-Restricted Latent Topic Model(ARLTM)[12] to encode targets into semantic topics.Although the appearance of the target varies in differ- ent poses and from different view points, humans recognize them all asthe target is wearing a black and gray patched jacket and dark blue uniform pants.This semantic description is invariant with pose, view, and other such changes in appearance.Thus the paper propose to use such intermedi- ate invariable descriptions as a reliable repre sentation for person re-identification.

      Background subtraction and human tracking are first car- ried out inorder to capture the human targets in continuous video streams.For the targets captured,we then extract color and texture features such as localHSVhistogram. These local features are then clustered into sets of visual words,thus called codebooks. This intermediate representation encodes high level semantic information for human appearance mod- eling in multi-camera surveillance systems. The values of pre-defined attributes are then manually assigned to the human target. ARLTM is then trained under the restric- tion of the human-specific attributes. ARLTM, bridges the gap between human-specific individual attributes and self- organized topic models, and can be easily generalized and applied to other attribute-based situations.

   4. Using Haar-based and DCD-based Signature

   A person can be recognized in one camera if his/her visual signature has been previously extracted in another camera. Here the re-identification algorithm was tested with manually annotated people in two non-overlapping scenes to validate the method. The algorithm uses Histograms of Oriented Gradients (HOG) [9]to automatically detect and track humans. Each detected human is tracked in order to accumulate images with person of interest. From these im- ages we extract human blobs using foreground-background separation technique. Finally, sets of human blobs are used by AdaBoost scheme to create a reliable visual signature. The AdaBoost scheme is applied to haar-like features[13] and to dominant color descriptor. For each detected and tracked human a visual signature is generated. All such created visual signatures from different scenes are stored in one human signature database. The performance evaluation of our re-identification algorithms is based on querying the human signature database by extracted signatures. The re- sults are analyzed using cumulative matching characteristic (CMC) curve.

3. MINIMUM CLASSIFICATION ERROR- BASED KISS METRIC LEARNING

   1. KISS Metric Learning Review

      Kostinger proposed KISS metric learning[5] (KISS)

      based on an assumption that pairwise differences are Gaus- sian distributed. This has acquired state-of-the-art retrieval

      Volume 4, Issue 17 Published by, www.ijert.org 2

      Special Issue – 2016

      performance for real applications, such as person reidentifi- cation and face recognition.

      Considering the person reidentification problem, a fea- ture vector pair Xi and Xj represents two samples. The hypothesis H0 can assume that the feature vector pair is dis- similar, i.e., Xi and Xj are sampled from different people, and the hypothesis H1 denotes that the feature vector pair is similar, i.e., Xi and Xj are sampled from the same person. Equation (1) defines the logarithm of the ratio between the two posteriors.

      (Xi , Xj ) = log(p(Xi , Xj | H0 ) (1)

      p(Xi , Xj | H1 ) )

      For metric learning, a large (Xi , Xj ) indicates Xi and Xj represent different people, while a small (Xi , Xj ) indicates Xi and Xj represent a same person. We denote the difference of the feature vector pair by Xij = Xi Xj , and thus we have

      (Xij ) = log(p(Xij | H0 ) (2)

      p(Xij | H1 ) )

      which can be rewritten as

      International Journal of Engineering Research & Technology (IJERT)

      ISSN: 2278-0181

      NCETET – 2016 Conference Proceedings

      Equation (7) shows that the eigenvalues of 0 and 1 are positive. Let KISS project 11 01 onto the cone of the positive a semi-definite matrix M, so we have

      (Xij ) = XTij MXij (8) where M is the KISS metric matrix.

   2. MCE-KISS Metric Learning

      Although KISS has largely improved the accuracy of person reidentification, there is a lot of room to improve efficiency and stability. It is critical to estimate the covari-

      ance matrices in (3.6) accurately to improve performance for person reidentification. It is known that the model of Gaussian distribution suffers from estimate error given limited training samples. Specifically, it is laborious and tedious to get a large number of labeled samples in real applications, to overcome the estimate error of the small eigenvalues of the covariance matrices which arose through the problem of small sample size. In statistics, to obtain

      robust estimations, a large number of techniques have been

      proposed. In this paper, the smoothing technique[7] , and the MCE criterion[6], are introduced to improve the accuracy

      where f (Xij

      (Xij ) = log(f (Xij | 0 )

      f (Xij | 1 ) )

      ) is the probability density function with pa-

      1. of estimates of covariance matrices in KISS. By enlarging the estimate to the small eigenvalues of a covariance matrix,

         the smoothing technique can compensate for the decrease in

         performance which arose from the estimate errors of small

         rameter for hypothesis H. After assuming the difference space is a Gaussian structure, we have

         1

         eigenvalues. On the other hand, the covariance matrices of KISS are estimated by ML estimation. It is known that the ML estimation for Gaussian density model is imprecise,

         XT

         XT

         f (Xij | k ) = 2d/2 | 1/2 | exp(- 2

         ij k -1 Xij ) (4) the discriminative learning procedure based on MCE aims to adjust the parameters of Gaussian density model and

         where k {0, 1}, d is the dimensionality of the feature vector, and k is the covariance matrix of Xij . Note that

         for specific i and j, since both XijandXji belong to the

         pairwise difference set, we have = 0 i.e., zero i,j Xij

         mean and 1 = (0, 1 ) and 0 = (0, 0 ). Given(4), (3) can be written as

         (Xij ) = 12 XiTj (11 -01 )Xij + 2 log( | 1 | ) (5)

         0

         By dropping the constant terms we have

         improves the generalization ability by increasing the number of training samples.

         The covariance matrix i in (6) is first diagonalized and

         can be written as

         iii (9)

         where i = diag [i1 , i2 , … ..id ] with ij being an eigenvalue of i , i = [i1 , i2 … …id ] with ij being

         an eigenvector of i , and eigenvalues in i are arranged in a descending order.

         we substitute (9) into (6)

         (Xij ) = XT

         ij (11 01 )Xij

         Define yij as the indicative variable of Xi and Xj . yij = 1

         (6)

         (Xij

         ) = X

         ) = X

         T

         ij (11 01 )Xij

         if Xi and Xj are the same person, otherwise yij = 0. Let

         = XTij (1 11 1 0 01 0 )Xij (10)

         N1 denote the number of similar feature vector pairs, while N0 denotes the number of dissimilar feature vector pairs.

         d

         (Xij ) =

         1 d 1

         The covariance matrices are estimated as follows:

         n=1

         1n (1nXij )2

         n=1

         0n (0nXij )2

         1

         =

         Xij XT

         1

         =

         (X X )(X

         X )T

         Through (10), we can explain that the small eigenvalues

         0 N0

         1

         ij

         yij =0

         i j i j

         N0 yij =0

         1

         significantly affect the score of metric. Next, we replace the small eigenvalues of the covariance matrix with a small constant

         1 =

         Xij XTij =

         N

         N

         1 yij =0

         p>

         1

         1

         (Xi N yij =0

         • Xj )(Xi

         • Xj )T

         (7)

         i

         i = diag[i1 , i2 ……ik, i , … .i ] (11)

         Volume 4, Issue 17 Published by, www.ijert.org 3

         Special Issue – 2016

         Let there be d-k number of i , where d is the dimensionality

         of training samples. Taking into account the smoothing technique, the constant i is set to the value of the average of all the small eigenvalues.

         1 d

         International Journal of Engineering Research & Technology (IJERT)

         ISSN: 2278-0181

         NCETET – 2016 Conference Proceedings

         where c is the class information. According to (18), we

         expect that the distance between x and the farthest intraclass sample are as small as possible and the distance between x and the closest interclass sample are as large as possible. The parameters in KISS include the eigenvectors and

         i = in

         d k n=k+1

         Thus (10) can be written as

         k 1 d 1

         1. eigenvalues of 0 and 1 , i.e.,1n , 1 , 0n , 0 , 1n , 0n . In MCE-KISS, we minimize the empirical loss L by means of adjusting these parameters via gradient descent. Let

            denote the parameters, according to gradient descent, we can get a general update rule of parameters.

            n=k+1

            n=k+1

            (Xij ) =

            n= 1

            1n (1nXij )2 + 1 (1nXij )2

            (t + 1) = (t) (t) L

            (19)

            k 1 d 1

            = (t) (t) lc (X )

            n=k+1

            n=k+1

            0n (0nXij )2 0 (0nXij )2

            1

            1

            k n= k

            1

            l

            l

            c (X ) 1

            (Xij ) =

            1n (1nXij )2 + 1

            (Xij 2 (1nXij )2 ) = (1).

            hc (X )

            k

            k

            n= 1

            1

            1

            nk=1

            (1 + ehc (X ) )2 .()ehc (X )

            = l

            = l

            c (X )(1 lc (X )) hc(X )

            0n

            n= 1

            (0nXij )2 1

            (Xij 2 (0nXij )2 ) 0 n=1

            (13)

            (20)

            According to the MCE criterion, we need to optimize hc (X ) the parameters of covariance matrices by utilizing the gradient descent method. Then, we have the evaluation of

            = ( (X, Xc ) (X, Xr ) ) (21)

            misclassification of a sample x belonging to class c. According to (19) to (21) we have

            hc (x) = max(X, Xc ) min(X, Xr ) (14)

            where Xc is a sample of the class c, and Xr is the closest interclass sample.Equation (14) considers two aspects:

            (t + 1) = (t) (t)lc (X )(1 lc (X ))

            ( (X, Xc ) (X, Xr ) )

            (22)

            1) the distance between x and the farthest intraclass sample and 2) the distance between x and the closest interclass sample.

            Furthermore, the loss of the misclassification can be written as 1

            In the learning process, we need to guarantee eigenvalues are positive, so we further define

            in = ein , in = ei (23)

            We rewrite (23) to

            lc (x) = 1 + ehc(x) (15)

            in

            where is a trade-off parameter and is selected in the range

            = lnin , i = lnin (24)

            of (0,+]. Given the training samples {Xn |n = 1, 2, …, N },

            and the label of each sample {Ci |i = 1, 2, …, M }, we can compute the empirical loss by using (16)

            N M

            Based on (22), we convert the parameter updating to the computation of partial derivatives (25)-(28).

            L = 1 N li (Xn )I (Xn Ci ) n=1 i=1

            I (Xn Ci ) = 1, ifXn Ci I (Xn Ci ) = 0, ifXn Ci

            And (16) can be further deducedNto

            (16)

            (17)

            We can optimize the parameters of 0 and 1 by using (25)-(28) and the distance metric (xij ) satisfied theneeds

            Volume 4, Issue 17

            L = 1 N

            lc (Xn ) (18) of the MCE. n=1

            Published by, www.ijert.org 4

            Special Issue – 2016

            International Journal of Engineering Research & Technology (IJERT)

            ISSN: 2278-0181

            NCETET – 2016 Conference Proceedings

            ing.

            1. The newly proposed MCE-KISS by seamlessly integrating MCE criterion and smoothing technique to significantly improve the performance of KISS metric learning.

            2. A rough comparison between MCE KISS and KISS to demonstrate its robust and effectiveness.

4. EXPERIMENTAL RESULTS

   Based on the above discussions, we summarize MCE-KISS as:

   Algorithm for Minimum Classification Error-KISS

   Step 1: The initial 01 and 11 are calculated by using (7) and (8).

   Step 2: Smooth technique: By using (12) to amend for the estimation errors of small eigenvalues of 01 and 11 Step 3: MCE technique: By using (25), (26), (27), and (28) optimize the parameters of 01 and 11

   Step 4: The distance metric is calculated by using (6).

   The procedure for MCE-KISS-based person reidentifi- cation can be summarized by the following steps:

   1) partitioning the image into a regular grid of size 8 4

   and overlapping block of size 88, and the color features and texture features are extracted from the overlapping blocks; 2) concatenating all the feature descriptors together and conducting PCA to achieve a robust feature representation for each sample;

   1. training MCE-KISS;

   2. finally finding the matching rank according to the query target. The main contribution of this paper include the follow-

      The widely used yet challenging dataset, VIPeR by Gray et al [10] was used to demonstrate the effectiveness of the proposed MCE-KISS method. All images from the two datasets were normalized to a standard size of 128 x 48. In general, this manipulation causes shape distortion which has limited effect on human visual systems. For each image, we concatenated the extracted LBP descriptor and some color features into a high dimensional feature vector.

      In experiments, all samples of pts subjects were selected to form the test set, while the rest ptr were used for model training. During training, we used intraperson image pairs as similar pairs, and generated interperson image pairs (by randomly selecting two images from different subjects) as dissimilar pairs.The image pairs are used to estimate 01 and 11 according Algorithm 1. During testing, the test set were divided into two parts, i.e., a gallery set and a probe set. We randomly chose one sample of each subject to comprise the gallery set. The rest were used for the probe set. Person reidentification aims to identify a persons photo in the probe set by comparing it with images of several individuals stored in the gallery set.

      By using the average cumulative match characteristic (CMC) curves, we evaluated the performance of the pro-

      posed algorithm. Because the complexity of the reidentifi-

      cation problem, the top n-ranked matching rate was consid- ered.

      1. VIPeR Dataset

         The VIPeR dataset was collected by Gray et al [10] and contains 1264 outdoor images obtained from two views of 632 subjects. Intraperson image pairs may contain a

         viewpoint change of 90 degree celsius. Other variations are also considered, such as lighting conditions, shooting locations, and image quality. Thus, it is challenge to conduct image-based person reidentification on the VIPeR dataset. Example images are shown in Fig. 4.1.

         We set pts = 316 and pts = 632, respectively to evalu- ate the matching performance of different algorithms. We repeated the process and the average CMC curves were depicted.

      2. Feature Descriptors

   It is known that both texture features and color histograms are useful for person reidentification. In our experiments, each image was partitioned into a regular

   Volume 4, Issue 17 Published by, www.ijert.org 5

   Special Issue – 2016

   International Journal of Engineering Research & Technology (IJERT)

   ISSN: 2278-0181

   NCETET – 2016 Conference Proceedings

   rate. MCE-KISS integrates the smoothing technique and the MCE criterion for precise covariance matrix estiation.

   Figure 1. Some typical samples from the VIPER dataset

   grid with 8 pixel spacing in the horizontal direction, and 4 pixel spacing in the vertical direction. From the grid, the LBP descriptor, HSV histogram, and RGB histogram were extracted from overlapping blocks of size 8 8. The

   HSV and RGB histograms encoded the different color distribution information in the HSV and RGB color spaces, respectively. The texture distribution information was modeled effectively by LBP descriptor. All the feature descriptors were concatenated together. Figure shows the process of feature extraction. We conducted PCA to obtain a 40-dimensional representation, to suppress the Gaussian

   noise.

   Figure 2. Feature extraction

5. RESULT ANALYSIS

   The graph shows the comparison of our proposed MCEKISS metric learning with KISS. The x-coordinate is the rank score, and the y-coordinate is the matching

   Figure 3. Comparison between MCE KISS and KISS

6. CONCLUSION

   The distance metric is critically important for effective person reidentification in surveillance tasks. Thus, it is ratio- nal to find a suitable distance metric learning algorithm to boost the performance of person reidentification.The prob- lem in this is there are only limited training image pairs to learn a metric in person reidentification.

   Given a small number of training samples, we observe that covariance matrices estimated by KISS are biased. Therefore, we present the MCE-KISS. The proposed MCE- KISS algorithm exploits the smoothing technique to enlarge the small eigenvalues of the estimated covariance matrix, and discriminative learning based on MCE which is more reliable than classical ML estimation. The employed two statistical techniques effectively enlarge the underestimated small eigenvalues and better estimate the covariance matrix. Therefore, MCE-KISS significantly improves KISS for per- son reidentification.

7. FUTURE ENHANCEMENT

The algorithm demands as input, the number of small eigen values to be replaced by its average. Thus making the algorithm to take the number automatically according the input data, can be considered as a future work.

REFERENCES

1. V. Chatzis, A. G. Bors, and I. Pitas, Multimodal decision-level fusion for person authentication, IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 29, no. 6, pp. 674680, Nov. 1999

   Volume 4, Issue 17 Published by, www.ijert.org 6

   Special Issue – 2016

   International Journal of Engineering Research & Technology (IJERT)

   ISSN: 2278-0181

   NCETET – 2016 Conference Proceedings

2. F. Dornaika and A. Bosaghzadeh, Exponential local discriminant em- bedding and its application to face recognition, IEEE Trans. Cybern., vol. 43, no. 3, pp. 921934, Jun. 2013.

3. R. M. Da Costa and A. Gonzaga, Dynamic features for iris recognition, IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 42, no. 4, pp. 10721082, Aug. 2012.

4. R. Cappelli, M. Ferrara, and D. Maio, A fast and accurate palmprint recognition system based on minutiae, IEEE Trans. Syst., Man, Cy- bern. B, Cybern., vol. 42, no. 3, pp. 956962, Jun. 2012.

5. M. Kostinger, M. Hirzer, P. Wohlhart, P. M. Roth, and H. Bischof, Large scale metric learning from equivalence constraints, in Proc. IEEE CVPR, Providence, RI, USA, 2012, pp. 22882295.

6. B.-H. Juang, W. Hou, and C.-H. Lee, Minimum classification error rate methods for speech recognition, IEEE Trans. Speech Audio Process., vol. 5, no. 3, pp. 257265, May 1997.

7. F. Kimura, K. Takashina, S. Tsuruoka, and Y. Miyake, Modified quadratic discriminant functions and the application to Chinese char- acter recognition, IEEE Trans. Pattern Anal. Mach. Intell., vol. 9, no. 1, pp. 149153, Jan. 1987.

8. T. Ojala, M. Pietikainen, and T. Maenpaa, Multiresolution gray-scale and rotation invariant texture classification with local binary patterns, IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 7, pp. 971987, Jul. 2002.

9. R. Lienhart and J. Maydt, An extended set of Haar-like features for rapid object detection, in Proc. ICIP, 2002, pp. 900903.

10. D. Gray, S. Brennan, and H. Tao, Evaluating appearance models for recognition, reacquisition, and tracking, in Proc. 10th PETS, 2007.

11. M. Kostinger, M. Hirzer, P. Wohlhart, P. M. Roth, and H. Bischof, Large scale metric learning from equivalence constraints, in Proc. IEEE CVPR, Providence, RI, USA, 2012, pp. 22882295.

12. Liu, Xiao, et al. Attribute-restricted latent topic model for person re-identification. Pattern recognition 45.12 (2012): 4204-4213.

13. Bak, Slawomir, et al. Person re-identification using haar-based and dcd-based signature. Advanced Video and Signal Based Surveillance (AVSS), 2010 Seventh IEEE International Conference on. IEEE, 2010.

14. Lan, Rushi, et al. Person reidentification using quaternionic local binary pattern. Multimedia and expo (ICME), 2014 IEEE international conference on. IEEE, 2014.

15. Gheissari, Niloofar, Thomas B. Sebastian, and Richard Hartley. Per- son reidentification using spatiotemporal appearance. Computer Vi- sion and Pattern Recognition, 2006 IEEE Computer Society Confer- ence on. Vol. 2. IEEE, 2006.

16. Ma, Andy J., et al. Cross-domain person reidentification using do- main adaptation ranking svms. Image Processing, IEEE Transactions

    on 24.5 (2015): 1599-1613.

17. Li, Annan, et al. Clothing attributes assisted person reidentification. Circuits and Systems for Video Technology, IEEE Transactions on 25.5 (2015): 869-878.

18. E. McDermott, T. J. Hazen, J. Le Roux, A. Nakamura, and S. Kata- giri, Discriminative training for large-vocabulary speech recognition using minimum classification error, IEEE Trans. Audio, Speech, Lang. Process., vol. 15, no. 1, pp. 203223, Jan. 2007.

Volume 4, Issue 17 Published by, www.ijert.org 7