Geometry and Topology Preserving Hashing for SIFT Feature

被引:18
作者
Kang, Chen [1 ,2 ,3 ]
Zhu, Li [4 ]
Qian, Xueming [5 ,6 ,7 ]
Han, Junwei [8 ]
Wang, Meng [9 ]
Tang, Yuan Yan [10 ]
机构
[1] Xi An Jiao Tong Univ, SMILES LAB, Xian 710049, Shaanxi, Peoples R China
[2] Xi An Jiao Tong Univ, Sch Software Engn, Xian 710049, Shaanxi, Peoples R China
[3] Univ Paris Saclay, Univ Paris Sud, Lab Signaux & Syst, CNRS,Cent Supelec, F-91192 Gif Sur Yvette, France
[4] Xi An Jiao Tong Univ, Sch Software, Xian 710049, Shaanxi, Peoples R China
[5] Xi An Jiao Tong Univ, Key Lab Intelligent Networks & Network Secur, Minist Educ, Xian 710049, Shaanxi, Peoples R China
[6] Xi An Jiao Tong Univ, SMILES Lab, Sch Elect & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[7] Zhibian Technol Co Ltd, Taizhou 317000, Peoples R China
[8] Northwestern Polytech Univ, Sch Automat & Informat Engn, Xian 710049, Shaanxi, Peoples R China
[9] Hefei Univ Technol, Hefei 230011, Anhui, Peoples R China
[10] Macau Univ, Taipa 999078, Macau, Peoples R China
基金
国家重点研发计划;
关键词
CBIR; geometric information; GTPH; hashing; SIFT; IMAGE RETRIEVAL; SEARCH;
D O I
10.1109/TMM.2018.2883868
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, content-based image retrieval has been of concern because of practical needs on Internet services, especially methods that can improve retrieving speed and accuracy. The SIFT feature is a well-designed local feature. It has mature applications in feature matching and retrieval, whereas the raw SIFT feature is high dimensional, with high storage cost as well as computational cost in feature similarity measurements. Thus, we propose a hashing scheme for fast SIFT feature-based image matching and retrieval. First, a training process of the hashing function involves geometric and topological information being introduced; second, a geometry-enhanced similarity evaluation that considers both the global and details of images in evaluation is explained. Compared with state-of-the-art methods, our method achieves better performance.
引用
收藏
页码:1563 / 1576
页数:14
相关论文
共 49 条
[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], P ACM INT C INF KNOW
[3]  
[Anonymous], HASHING SIMILARITY S
[4]   SURF: Speeded up robust features [J].
Bay, Herbert ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417
[5]   Robust Spatial Consistency Graph Model for Partial Duplicate Image Retrieval [J].
Chu, Lingyang ;
Jiang, Shuqiang ;
Wang, Shuhui ;
Zhang, Yanyan ;
Huang, Qingming .
IEEE TRANSACTIONS ON MULTIMEDIA, 2013, 15 (08) :1982-1996
[6]   Total recall: Automatic query expansion with a generative feature model for object retrieval [J].
Chum, Ondrej ;
Philbin, James ;
Sivic, Josef ;
Isard, Michael ;
Zisserman, Andrew .
2007 IEEE 11TH INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS 1-6, 2007, :496-+
[7]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[8]   Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval [J].
Gong, Yunchao ;
Lazebnik, Svetlana ;
Gordo, Albert ;
Perronnin, Florent .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (12) :2916-2929
[9]  
Ji Jianqiu, 2012, Advances in Neural Information Processing Systems, P108
[10]   Semi-Supervised Bi-Dictionary Learning for Image Classification With Smooth Representation-Based Label Propagation [J].
Jian, Meng ;
Jung, Cheolkon .
IEEE TRANSACTIONS ON MULTIMEDIA, 2016, 18 (03) :458-473