scholarly journals Unsupervised deep hashing for large-scale visual search

2016 ◽  
Author(s):  
Zhaoqiang Xia ◽  
Xiaoyi Feng ◽  
Jinye Peng ◽  
Abdenour Hadid
Keyword(s):  
Visual Search ◽  
Large Scale ◽  
Deep Hashing

Data-Driven Lightweight Interest Point Selection for Large-Scale Visual Search

2018 ◽  
Vol 20 (10) ◽  
pp. 2774-2787 ◽  
Author(s):  
Feng Gao ◽  
Xinfeng Zhang ◽  
Yicheng Huang ◽  
Yong Luo ◽  
Xiaoming Li ◽  
...  
Keyword(s):  
Visual Search ◽  
Large Scale ◽  
Data Driven ◽  
Interest Point ◽  
Point Selection ◽  
Selection For

A New Mobile Visual Search System Based on the Human Visual System

2013 ◽  
Vol 461 ◽  
pp. 792-800
Author(s):  
Bo Zhao ◽  
Hong Wei Zhao ◽  
Ping Ping Liu ◽  
Gui He Qin
Keyword(s):  
Visual Search ◽  
Visual System ◽  
Human Visual System ◽  
Large Scale ◽  
Scale Invariant ◽  
Search System ◽  
Mobile Visual Search ◽  
Extraction Algorithm ◽  
Retrieval Scheme ◽  
Scale Invariant Feature

We describe a novel mobile visual search system based on the saliencymechanism and sparse coding principle of the human visual system (HVS). In the featureextraction step, we first divide an image into different regions using thesaliency extraction algorithm. Then scale-invariant feature transform (SIFT)descriptors in all regions are extracted while regional identities arepreserved based on their various saliency levels. According to the sparsecoding principle in the HVS, we adopt a local neighbor preserving Hash functionto establish the binary sparse expression of the SIFT features. In the searchingstep, the nearest neighbors matched to the hashing codes are processed accordingto different saliency levels. Matching scores of images in the database arederived from the matching of hashing codes. Subsequently, the matching scoresof all levels are weighed by degrees of saliency to obtain the initial set of results. In order to further ensure matching accuracy, we propose an optimized retrieval scheme based on global texture information. We conduct extensive experiments on an actual mobile platform in large-scale datasets by using Corel-1000. The resultsshow that the proposed method outperforms the state-of-the-art algorithms on accuracyrate, and no significant increase in the running time of the feature extractionand retrieval can be observed.

scholarly journals Spatial pyramid deep hashing for large-scale image retrieval

2017 ◽  
Vol 243 ◽  
pp. 166-173 ◽  
Author(s):  
Wanqing Zhao ◽  
Hangzai Luo ◽  
Jinye Peng ◽  
Jianping Fan
Keyword(s):  
Image Retrieval ◽  
Large Scale ◽  
Deep Hashing ◽  
Large Scale Image Retrieval ◽  
Spatial Pyramid

scholarly journals Discriminative Deep Hashing for Scalable Face Image Retrieval

2017 ◽  
Author(s):  
Jie Lin ◽  
Zechao Li ◽  
Jinhui Tang
Keyword(s):  
Image Retrieval ◽  
Large Scale ◽  
State Of The Art ◽  
Face Image ◽  
Superior Performance ◽  
Prediction Errors ◽  
Unified Framework ◽  
Multi Scale ◽  
Deep Hashing ◽  
Hash Codes

With the explosive growth of images containing faces, scalable face image retrieval has attracted increasing attention. Due to the amazing effectiveness, deep hashing has become a popular hashing method recently. In this work, we propose a new Discriminative Deep Hashing (DDH) network to learn discriminative and compact hash codes for large-scale face image retrieval. The proposed network incorporates the end-to-end learning, the divide-and-encode module and the desired discrete code learning into a unified framework. Specifically, a network with a stack of convolution-pooling layers is proposed to extract multi-scale and robust features by merging the outputs of the third max pooling layer and the fourth convolutional layer. To reduce the redundancy among hash codes and the network parameters simultaneously, a divide-and-encode module to generate compact hash codes. Moreover, a loss function is introduced to minimize the prediction errors of the learned hash codes, which can lead to discriminative hash codes. Extensive experiments on two datasets demonstrate that the proposed method achieves superior performance compared with some state-of-the-art hashing methods.

Sign in / Sign up

Export Citation Format

Share Document