Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-Identification

Existing projection-based person re-identification methods usually suffer from long time training, high dimension of projection matrix, and low matching rate. In addition, the intra-class instances may be much less than the inter-class instances when a training data set is built. To solve these prob...

Full description

Bibliographic Details
Main Authors: Tongguang Ni, Zongyuan Ding, Fuhua Chen, Hongyuan Wang
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8263222/
id doaj-f1f9fd95445243249880a94be82e7ec7
record_format Article
spelling doaj-f1f9fd95445243249880a94be82e7ec72021-03-29T20:46:29ZengIEEEIEEE Access2169-35362018-01-016114051141110.1109/ACCESS.2018.27950208263222Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-IdentificationTongguang Ni0https://orcid.org/0000-0002-0354-5116Zongyuan Ding1Fuhua Chen2Hongyuan Wang3https://orcid.org/0000-0003-1236-6141School of Information Science and Engineering, Changzhou University, Changzhou, ChinaSchool of Information Science and Engineering, Changzhou University, Changzhou, ChinaSchool of Information Science and Engineering, Changzhou University, Changzhou, ChinaSchool of Information Science and Engineering, Changzhou University, Changzhou, ChinaExisting projection-based person re-identification methods usually suffer from long time training, high dimension of projection matrix, and low matching rate. In addition, the intra-class instances may be much less than the inter-class instances when a training data set is built. To solve these problems, a novel relative distance metric leaning based on clustering centralization and projection vectors learning is proposed. When constructing training data set, the images of a same target person are clustering centralized with fuzzy c-means). The training data sets are built by these clusters in order to alleviate the imbalanced data problem of the training data sets. In addition, during learning projection matrix, the resulted projection vectors can be approximately orthogonal by using an iteration strategy and a conjugate gradient projection vector learning method to update training data sets. Experimental results show that the proposed algorithm has higher efficiency. The matching rate can be significantly improved, and the time of training is much shorter than most of existing algorithms of person re-identification.https://ieeexplore.ieee.org/document/8263222/Person re-identificationdistance centralizationmetric learningprojection vectorsconjugate gradient
collection DOAJ
language English
format Article
sources DOAJ
author Tongguang Ni
Zongyuan Ding
Fuhua Chen
Hongyuan Wang
spellingShingle Tongguang Ni
Zongyuan Ding
Fuhua Chen
Hongyuan Wang
Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-Identification
IEEE Access
Person re-identification
distance centralization
metric learning
projection vectors
conjugate gradient
author_facet Tongguang Ni
Zongyuan Ding
Fuhua Chen
Hongyuan Wang
author_sort Tongguang Ni
title Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-Identification
title_short Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-Identification
title_full Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-Identification
title_fullStr Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-Identification
title_full_unstemmed Relative Distance Metric Leaning Based on Clustering Centralization and Projection Vectors Learning for Person Re-Identification
title_sort relative distance metric leaning based on clustering centralization and projection vectors learning for person re-identification
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description Existing projection-based person re-identification methods usually suffer from long time training, high dimension of projection matrix, and low matching rate. In addition, the intra-class instances may be much less than the inter-class instances when a training data set is built. To solve these problems, a novel relative distance metric leaning based on clustering centralization and projection vectors learning is proposed. When constructing training data set, the images of a same target person are clustering centralized with fuzzy c-means). The training data sets are built by these clusters in order to alleviate the imbalanced data problem of the training data sets. In addition, during learning projection matrix, the resulted projection vectors can be approximately orthogonal by using an iteration strategy and a conjugate gradient projection vector learning method to update training data sets. Experimental results show that the proposed algorithm has higher efficiency. The matching rate can be significantly improved, and the time of training is much shorter than most of existing algorithms of person re-identification.
topic Person re-identification
distance centralization
metric learning
projection vectors
conjugate gradient
url https://ieeexplore.ieee.org/document/8263222/
work_keys_str_mv AT tongguangni relativedistancemetricleaningbasedonclusteringcentralizationandprojectionvectorslearningforpersonreidentification
AT zongyuanding relativedistancemetricleaningbasedonclusteringcentralizationandprojectionvectorslearningforpersonreidentification
AT fuhuachen relativedistancemetricleaningbasedonclusteringcentralizationandprojectionvectorslearningforpersonreidentification
AT hongyuanwang relativedistancemetricleaningbasedonclusteringcentralizationandprojectionvectorslearningforpersonreidentification
_version_ 1724194204650831872