基于改进三元丢失的行人重新识别

Zheng-guang Xu, Yunfei Wang
{"title":"基于改进三元丢失的行人重新识别","authors":"Zheng-guang Xu, Yunfei Wang","doi":"10.12783/dtetr/mcaee2020/35016","DOIUrl":null,"url":null,"abstract":"Person re-identification technology is an important foundation for security, pedestrian tracking and other fields, and is the key to building a safe and smart city. In recent years, a large number of researchers have trained pedestrian re-identification networks through triplet loss, especially the triplet loss with batch hard mining (BHTri loss) has greatly improved person re-identification networks on accuracy. However, triplet loss with batch hard mining for an anchor sample only select the hardest positive sample and the hardest negative sample to calculate the loss, ignoring the influence of other samples on network parameters. In response to the above issues, this paper proposes a variant of triplet loss with batch hard mining, which is called adaptive weight triplet loss with batch hard mining. After the training dataset extracts features from the backbone network, in the phase of calculating loss, it takes the average of the sum of the distances between an anchor sample and all corresponding positive samples as a threshold, and both positive samples with an anchor point distance greater than the threshold and negative samples smaller than the threshold are retained, then based on The distance of the anchor sample is given the corresponding sample weight for calculating the loss. Compared with BHTri, mAP have improved 1.79%, 2.04%, and 1.25% respectively on the Market1501, DukeMTMC-reID and CUHK03 datasets, indicating that the proposed algorithm is effective.","PeriodicalId":11264,"journal":{"name":"DEStech Transactions on Engineering and Technology Research","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Pedestrian Re-ID Based on Improved Triplet Loss\",\"authors\":\"Zheng-guang Xu, Yunfei Wang\",\"doi\":\"10.12783/dtetr/mcaee2020/35016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Person re-identification technology is an important foundation for security, pedestrian tracking and other fields, and is the key to building a safe and smart city. In recent years, a large number of researchers have trained pedestrian re-identification networks through triplet loss, especially the triplet loss with batch hard mining (BHTri loss) has greatly improved person re-identification networks on accuracy. However, triplet loss with batch hard mining for an anchor sample only select the hardest positive sample and the hardest negative sample to calculate the loss, ignoring the influence of other samples on network parameters. In response to the above issues, this paper proposes a variant of triplet loss with batch hard mining, which is called adaptive weight triplet loss with batch hard mining. After the training dataset extracts features from the backbone network, in the phase of calculating loss, it takes the average of the sum of the distances between an anchor sample and all corresponding positive samples as a threshold, and both positive samples with an anchor point distance greater than the threshold and negative samples smaller than the threshold are retained, then based on The distance of the anchor sample is given the corresponding sample weight for calculating the loss. Compared with BHTri, mAP have improved 1.79%, 2.04%, and 1.25% respectively on the Market1501, DukeMTMC-reID and CUHK03 datasets, indicating that the proposed algorithm is effective.\",\"PeriodicalId\":11264,\"journal\":{\"name\":\"DEStech Transactions on Engineering and Technology Research\",\"volume\":\"2 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DEStech Transactions on Engineering and Technology Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12783/dtetr/mcaee2020/35016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DEStech Transactions on Engineering and Technology Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12783/dtetr/mcaee2020/35016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

人员再识别技术是安防、行人跟踪等领域的重要基础,是建设平安智慧城市的关键。近年来,大量研究人员通过三重损失训练行人再识别网络,特别是具有批处理硬挖掘的三重损失(BHTri loss)极大地提高了人再识别网络的准确率。而批量硬挖锚样的三重损失只选择最硬的正样本和最硬的负样本来计算损失,忽略了其他样本对网络参数的影响。针对上述问题,本文提出了一种基于批硬挖掘的三元组损失算法,即批硬挖掘自适应权值三元组损失算法。训练数据集从骨干网络中提取特征后,在损失计算阶段,取锚点样本与所有对应正样本距离之和的平均值作为阈值,保留锚点距离大于阈值的正样本和小于阈值的负样本,然后根据锚点样本的距离给出相应的样本权值用于计算损失。与BHTri相比,mAP在Market1501、DukeMTMC-reID和CUHK03数据集上分别提高了1.79%、2.04%和1.25%,表明该算法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Pedestrian Re-ID Based on Improved Triplet Loss
Person re-identification technology is an important foundation for security, pedestrian tracking and other fields, and is the key to building a safe and smart city. In recent years, a large number of researchers have trained pedestrian re-identification networks through triplet loss, especially the triplet loss with batch hard mining (BHTri loss) has greatly improved person re-identification networks on accuracy. However, triplet loss with batch hard mining for an anchor sample only select the hardest positive sample and the hardest negative sample to calculate the loss, ignoring the influence of other samples on network parameters. In response to the above issues, this paper proposes a variant of triplet loss with batch hard mining, which is called adaptive weight triplet loss with batch hard mining. After the training dataset extracts features from the backbone network, in the phase of calculating loss, it takes the average of the sum of the distances between an anchor sample and all corresponding positive samples as a threshold, and both positive samples with an anchor point distance greater than the threshold and negative samples smaller than the threshold are retained, then based on The distance of the anchor sample is given the corresponding sample weight for calculating the loss. Compared with BHTri, mAP have improved 1.79%, 2.04%, and 1.25% respectively on the Market1501, DukeMTMC-reID and CUHK03 datasets, indicating that the proposed algorithm is effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信