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-08 13:25:58 +11:00 committed by GitHub
parent 8fea868f6c
commit 281c49c4fc
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
README.md
View File

@ -28,11 +28,8 @@ The neighbor encoding method of our paper is inspired by the reference [2]. If y
================================================================
### Two python version of re-ranking fcuntions are added in the 'python' folder.
1. re_ranking_feature.py: re-ranking with original feature, Euclidean distance is used. Thanks Hao Luo @michuanhaohao !
2. re_ranking_ranklist: re-ranking with given distance matrices, handle the difference of / division between python 2 and 3. Thanks @huanghoujing !
A python version of re-ranking reproduced by Hao Luo (haoluocsc@zju.edu.cn) is in the "python/" folder. Thanks Hao!
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) !
================================================================