MULTI-FEATURE HASHING BASED ON SNR MAXIMIZATION

被引:0
作者
Yu, Honghai [1 ,2 ]
Moulin, Pierre [1 ,2 ]
机构
[1] Univ Illinois, ECE Dept, Champaign, IL 61820 USA
[2] Adv Digital Sci Ctr, Singapore, Singapore
来源
2015 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP) | 2015年
关键词
Hashing; multi-feature; signal-to-noise ratio;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Hashing algorithms which encode signal content into compact binary codes to preserve similarity, have been extensively studied for applications such as large-scale visual search. However, most existing hashing algorithms work with a single feature type, while combining multiple features is helpful in many vision tasks. In this paper, we propose two multi-feature hashing algorithms based on signal-to-noise ratio (SNR) maximization, where a globally optimal solution is obtained by solving a generalized eigenvalue problem. The first one jointly considers all feature correlations and learns uncorrelated hash functions that maximize SNR, and the second algorithm separately learns hash functions on each individual feature and selects the final hash functions based on the SNR associated with each hash function. The proposed algorithms perform favorably compared to other state-of-the-art multi-feature hashing algorithms on several benchmark datasets.
引用
收藏
页码:1815 / 1819
页数:5
相关论文
共 33 条
[1]  
[Anonymous], CVPR
[2]  
[Anonymous], 1988, Applied Multivariate Statistical Analysis
[3]  
[Anonymous], ICML
[4]  
[Anonymous], 2011, INT C MULT, DOI DOI 10.1145/2072298.2072354
[5]  
[Anonymous], IEEE INT C IM PROC I
[6]  
[Anonymous], P IEEE INT C AC SPEE
[7]  
Barry J.R., 2003, DIGITAL COMMUNICATIO
[8]  
Bhaskaran V., 1997, Image and video compression standards: algorithms and architectures
[9]  
Fu Y., 2008, P 2008 INT C CONT BA, P127, DOI 10.1145/1386352.1386373.
[10]   Optimal relay functionality for SNR maximization in memoryless relay networks [J].
Gomadam, Krishna Srikanth ;
Jafar, Syed Ali .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2007, 25 (02) :390-401