FutureTwT / HMAH

The source code of "Teacher-Student Learning: Efficient Hierarchical Message Aggregation Hashing for Cross-Modal Retrieval." (Accepted by TMM 2022)
18 stars 2 forks source link

您好,我申请了数据集的访问权限,麻烦您通过下 #1

Closed zzidlezz closed 2 years ago

FutureTwT commented 2 years ago

十分感谢您对本工作的关注,请您重新发一下申请

FutureTwT commented 2 years ago

NUSWIDE 参考 nus-wide-tc21-iall.mat Flickr 参考 FLICKR-25K.mat https://github.com/jiangqy/DCMH-CVPR2017/tree/master/DCMH_tensorflow/DCMH_tensorflow

zzidlezz commented 2 years ago

您好,我重发了申请

------------------ 原始邮件 ------------------ 发件人: "FutureTwT/HMAH" @.>; 发送时间: 2022年6月8日(星期三) 上午9:01 @.>; @.**@.>; 主题: Re: [FutureTwT/HMAH] 您好,我申请了数据集的访问权限,麻烦您通过下 (Issue #1)

十分感谢您对本工作的关注,请您重新发一下申请

— Reply to this email directly, view it on GitHub, or unsubscribe. You are receiving this because you authored the thread.Message ID: @.***>

zzidlezz commented 2 years ago

您好请教您个问题,就是比如我用MIRFLICKR这个数据集,然后每个bit位数跑100次,10次作为一次测试,比如16bit是在20个epoch时map值最高,32bit是在40,其他两位是在别的epoch,那么我可以直接选取他们各自的最好结果吗,还是说不同位数也要固定到一个epoch,比如说都是50次

------------------ 原始邮件 ------------------ 发件人: "FutureTwT/HMAH" @.>; 发送时间: 2022年6月8日(星期三) 上午9:17 @.>; @.**@.>; 主题: Re: [FutureTwT/HMAH] 您好,我申请了数据集的访问权限,麻烦您通过下 (Issue #1)

NUSWIDE 参考 nus-wide-tc21-iall.mat Flickr 参考 FLICKR-25K.mat https://github.com/jiangqy/DCMH-CVPR2017/tree/master/DCMH_tensorflow/DCMH_tensorflow

— Reply to this email directly, view it on GitHub, or unsubscribe. You are receiving this because you authored the thread.Message ID: @.***>