Update README.md

pull/25/head
zhun zhong 2017-05-05 15:12:55 +08:00 committed by GitHub
parent 8f4413e5ca
commit 7fc5b7ff95
1 changed files with 5 additions and 2 deletions

View File

@ -119,7 +119,9 @@ For Market-1501, these results are better than those reported in our paper, sinc
| | Labeled | Labeled| detected | detected| | | Labeled | Labeled| detected | detected|
| -------| ----- | ---- |---- |---- | | -------| ----- | ---- |---- |---- |
|Methods | Rank@1 | mAP| Rank@1 | mAP| |Methods | Rank@1 | mAP| Rank@1 | mAP|
|LOMO + XQDA [1] | 14.8% | 13.6%|12.8% | 11.5%| |BOW + XQDA [1] | -% | -%|6.36% | 6.39%|
|BOW + XQDA + re-ranking | -% | -%|8.29% | 8.81%|
|LOMO + XQDA [3] | 14.8% | 13.6%|12.8% | 11.5%|
|LOMO + XQDA + re-ranking | 19.1% | 20.8%|16.6% | 17.8%| |LOMO + XQDA + re-ranking | 19.1% | 20.8%|16.6% | 17.8%|
|IDE_CaffeNet + Euclidean | 15.6% | 14.9%| 15.1% | 14.2%| |IDE_CaffeNet + Euclidean | 15.6% | 14.9%| 15.1% | 14.2%|
|IDE_CaffeNet + Euclidean + re-ranking | 19.1% | 21.3%|19.3% | 20.6%| |IDE_CaffeNet + Euclidean + re-ranking | 19.1% | 21.3%|19.3% | 20.6%|
@ -132,10 +134,11 @@ For Market-1501, these results are better than those reported in our paper, sinc
### References ### References
[1] Person re-identification by local maximal occurrence representation and metric learning. Liao S, Hu Y, Zhu X, et al. In CVPR. 2015 [1] Scalable Person Re-identification: A Benchmark. Zheng, Liang and Shen, Liyue and Tian, Lu and Wang, Shengjin and Wang, Jingdong and Tian, Qi. In ICCV 2015.
[2] Sparse contextual activation for efficient visual re-ranking. Bai, Song and Bai, Xiang. IEEE Transactions on Image Processing. 2016 [2] Sparse contextual activation for efficient visual re-ranking. Bai, Song and Bai, Xiang. IEEE Transactions on Image Processing. 2016
[3] Person re-identification by local maximal occurrence representation and metric learning. Liao S, Hu Y, Zhu X, et al. In CVPR. 2015
### Contact us ### Contact us
If you have any questions about this code, please do not hesitate to contact us. If you have any questions about this code, please do not hesitate to contact us.