mirrors
/
person-re-ranking
mirror of https://github.com/zhunzhong07/person-re-ranking
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Update README.md

pull/25/head
Zhun Zhong 2018-01-14 11:19:09 +11:00 committed by GitHub
parent f35a9faf48
commit 122721db65
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -31,7 +31,7 @@ The neighbor encoding method of our paper is inspired by the reference [2]. If y
1. re_ranking_feature.py: re-ranking with original feature, Euclidean distance is used. Thanks [Hao Luo](https://github.com/michuanhaohao) !
2. re_ranking_ranklist: re-ranking with given distance matrices, handle the difference of / division between python 2 and 3. Thanks [huang houjing](https://github.com/huanghoujing) !
### Pytorch re-implementations
### Pytorch re-implementation
[[Person_reID_baseline + Random Erasing + Re-ranking]](https://github.com/layumi/Person_reID_baseline_pytorch)
================================================================