一种改进的人员再识别方法

Han Jiang, Xinmei Yang, Yaobin Li
{"title":"一种改进的人员再识别方法","authors":"Han Jiang, Xinmei Yang, Yaobin Li","doi":"10.1145/3282286.3282301","DOIUrl":null,"url":null,"abstract":"This paper proposes a new method which combine Singular Vector Decomposition with k-reciprocal encoding for the application of person re-identification(re-ID). When we use the Euclidean distance to retrieve person, it is observed that the weight vectors in a fully connected layer are usually correlated, which makes a large impact on the retrieval result. Singular Vector Decomposition is adopted to decorrelation in this article, which has a better performance with the restraint and relaxation iteration training. Meanwhile, we add a k-reciprocal method to above result, our hypothesis is based on a gallery image is more likely to match the probe when they are in the k-reciprocal nearest neighbors. So we combine a k-reciprocal feature which is calculated by encoding its k-reciprocal nearest neighbors into a single vector under Jaccard distance and original distance as the final distance. Our method has been experimented on Market-1501 and CUHK03, it achieves a great performance, the results show that, rank-1 accuracy is improved to 82.69% and mAP is improved to 70.60% on Market-1501 for CaffeNet, while for ResNet-50, rank-1 accuracy is improved to 82.63% and mAP is improved to 73.32%.","PeriodicalId":324982,"journal":{"name":"Proceedings of the 2nd International Conference on Graphics and Signal Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Method for Person Re-identification\",\"authors\":\"Han Jiang, Xinmei Yang, Yaobin Li\",\"doi\":\"10.1145/3282286.3282301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new method which combine Singular Vector Decomposition with k-reciprocal encoding for the application of person re-identification(re-ID). When we use the Euclidean distance to retrieve person, it is observed that the weight vectors in a fully connected layer are usually correlated, which makes a large impact on the retrieval result. Singular Vector Decomposition is adopted to decorrelation in this article, which has a better performance with the restraint and relaxation iteration training. Meanwhile, we add a k-reciprocal method to above result, our hypothesis is based on a gallery image is more likely to match the probe when they are in the k-reciprocal nearest neighbors. So we combine a k-reciprocal feature which is calculated by encoding its k-reciprocal nearest neighbors into a single vector under Jaccard distance and original distance as the final distance. Our method has been experimented on Market-1501 and CUHK03, it achieves a great performance, the results show that, rank-1 accuracy is improved to 82.69% and mAP is improved to 70.60% on Market-1501 for CaffeNet, while for ResNet-50, rank-1 accuracy is improved to 82.63% and mAP is improved to 73.32%.\",\"PeriodicalId\":324982,\"journal\":{\"name\":\"Proceedings of the 2nd International Conference on Graphics and Signal Processing\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2nd International Conference on Graphics and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3282286.3282301\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd International Conference on Graphics and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3282286.3282301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种将奇异向量分解与k互反编码相结合的人再识别方法。当我们使用欧几里得距离来检索人的时候,我们观察到在一个完全连接的层中权向量通常是相关的,这对检索结果有很大的影响。本文采用奇异向量分解进行解相关,结合约束松弛迭代训练,解相关效果更好。同时,我们在上面的结果中加入了一个k倒数的方法,我们的假设是基于一个图库图像在k倒数的近邻中更有可能匹配探针。因此,我们将k-倒数特征结合起来,该特征是通过将其k-倒数近邻编码为Jaccard距离和原始距离作为最终距离的单个向量来计算的。我们的方法在Market-1501和CUHK03上进行了实验,取得了很好的效果,结果表明,在Market-1501上,CaffeNet的rank-1准确率提高到82.69%,mAP提高到70.60%,而在ResNet-50上,rank-1准确率提高到82.63%,mAP提高到73.32%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Method for Person Re-identification
This paper proposes a new method which combine Singular Vector Decomposition with k-reciprocal encoding for the application of person re-identification(re-ID). When we use the Euclidean distance to retrieve person, it is observed that the weight vectors in a fully connected layer are usually correlated, which makes a large impact on the retrieval result. Singular Vector Decomposition is adopted to decorrelation in this article, which has a better performance with the restraint and relaxation iteration training. Meanwhile, we add a k-reciprocal method to above result, our hypothesis is based on a gallery image is more likely to match the probe when they are in the k-reciprocal nearest neighbors. So we combine a k-reciprocal feature which is calculated by encoding its k-reciprocal nearest neighbors into a single vector under Jaccard distance and original distance as the final distance. Our method has been experimented on Market-1501 and CUHK03, it achieves a great performance, the results show that, rank-1 accuracy is improved to 82.69% and mAP is improved to 70.60% on Market-1501 for CaffeNet, while for ResNet-50, rank-1 accuracy is improved to 82.63% and mAP is improved to 73.32%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信