Large-Scale Remote Sensing Image Retrieval Based on Semi-Supervised Adversarial Hashing

被引:32
作者
Tang, Xu [1 ]
Liu, Chao [1 ]
Ma, Jingjing [1 ]
Zhang, Xiangrong [1 ]
Liu, Fang [2 ]
Jiao, Licheng [1 ]
机构
[1] Xidian Univ, Key Lab Intelligent Percept & Image Understanding, Minist Educ,Joint Int Res Lab Intelligent Percept, Int Res Ctr Intelligent Percept & Computat,Sch Ar, Xian 710071, Shaanxi, Peoples R China
[2] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Jiangsu, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
hash learning; large-scale remote sensing image retrieval; APPROXIMATE NEAREST-NEIGHBOR; ALGORITHMS; SEARCH;
D O I
10.3390/rs11172055
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Remote sensing image retrieval (RSIR), a superior content organization technique, plays an important role in the remote sensing (RS) community. With the number of RS images increases explosively, not only the retrieval precision but also the retrieval efficiency is emphasized in the large-scale RSIR scenario. Therefore, the approximate nearest neighborhood (ANN) search attracts the researchers' attention increasingly. In this paper, we propose a new hash learning method, named semi-supervised deep adversarial hashing (SDAH), to accomplish the ANN for the large-scale RSIR task. The assumption of our model is that the RS images have been represented by the proper visual features. First, a residual auto-encoder (RAE) is developed to generate the class variable and hash code. Second, two multi-layer networks are constructed to regularize the obtained latent vectors using the prior distribution. These two modules mentioned are integrated under the generator adversarial framework. Through the minimax learning, the class variable would be a one-hot-like vector while the hash code would be the binary-like vector. Finally, a specific hashing function is formulated to enhance the quality of the generated hash code. The effectiveness of the hash codes learned by our SDAH model was proved by the positive experimental results counted on three public RS image archives. Compared with the existing hash learning methods, the proposed method reaches improved performance.
引用
收藏
页数:36
相关论文
共 80 条
[1]   Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions [J].
Andoni, Alexandr ;
Indyk, Piotr .
COMMUNICATIONS OF THE ACM, 2008, 51 (01) :117-122
[2]  
[Anonymous], 2010, Advances in Neural Information Processing Systems
[3]  
[Anonymous], 2014, Hashing for similarity search: A survey
[4]  
[Anonymous], 2015, CoRR abs/1511.05644
[5]  
[Anonymous], 2004, P 20 ACM S COMP
[6]  
[Anonymous], P 3 INT C LEARNING R
[7]  
[Anonymous], 2015, P 24 INT JOINT C ART
[8]  
[Anonymous], P 13 AAAI C ART INT
[9]  
[Anonymous], IEEE T GEOSCI REMOTE
[10]  
[Anonymous], 2015, Nature, DOI [10.1038/nature14539, DOI 10.1038/NATURE14539]