Hashing has recently received excellent performance for similarity search on large-scale data set. In many scenarios, most image contains multi-instance features, and how to hash multi-instance image is an important task. Although some researchers focus on this problem and put forward solutions, they usually simply combine with existing hashing methods, which are not efficient methods for multi-instance hashing. To address this issue, we propose an Efficient Multi-Instance Hashing (EMIH) method. EMIH first construct bag features by multi-instance feature mapping. To improve the quality of hash codes, EMIH are both consider semantic correlation and local similarity preserving between bag features. Different from existing methods that relaxing the binary constraints, EMIH learn discrete codes directly by an alternate algorithm. Experimental results on two benchmark datasets demonstrate the superiority of EMIH as compared to related multi-instance hashing methods.
|