Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous Kernels

We propose an approximation search algorithm that uses additive homogeneous kernel mapping to search for an image approximation based on kernelized locality-sensitive hashing. To address problems related to the unstable search accuracy of an unsupervised image hashing function and degradation of the...

Full description

Bibliographic Details
Main Authors: Jun-Yi Li, Jian-Hua Li
Format: Article
Language:English
Published: Hindawi-Wiley 2018-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2018/9671630
id doaj-c6fddb278a3c4a45a8f40c0c19c81d55
record_format Article
spelling doaj-c6fddb278a3c4a45a8f40c0c19c81d552020-11-24T22:14:52ZengHindawi-WileyComplexity1076-27871099-05262018-01-01201810.1155/2018/96716309671630Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous KernelsJun-Yi Li0Jian-Hua Li1Shanghai Jiaotong University Electrical and Electronic Engineering College, Shanghai, ChinaShanghai Jiaotong University Electrical and Electronic Engineering College, Shanghai, ChinaWe propose an approximation search algorithm that uses additive homogeneous kernel mapping to search for an image approximation based on kernelized locality-sensitive hashing. To address problems related to the unstable search accuracy of an unsupervised image hashing function and degradation of the search-time performance with increases in the number of hashing bits, we propose a method that combines additive explicit homogeneous kernel mapping and image feature histograms to construct a search algorithm based on a locality-sensitive hashing function. Moreover, to address the problem of semantic gaps caused by using image data that lack type information in semantic modeling, we describe an approximation searching algorithm based on the homogeneous kernel mapping of similarities between pairs of images and dissimilar constraint relationships. Our image search experiments confirmed that the proposed algorithm can construct a locality-sensitive hash function more accurately, thereby effectively improving the similarity search performance.http://dx.doi.org/10.1155/2018/9671630
collection DOAJ
language English
format Article
sources DOAJ
author Jun-Yi Li
Jian-Hua Li
spellingShingle Jun-Yi Li
Jian-Hua Li
Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous Kernels
Complexity
author_facet Jun-Yi Li
Jian-Hua Li
author_sort Jun-Yi Li
title Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous Kernels
title_short Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous Kernels
title_full Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous Kernels
title_fullStr Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous Kernels
title_full_unstemmed Approximately Nearest Neighborhood Image Search Using Unsupervised Hashing via Homogeneous Kernels
title_sort approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels
publisher Hindawi-Wiley
series Complexity
issn 1076-2787
1099-0526
publishDate 2018-01-01
description We propose an approximation search algorithm that uses additive homogeneous kernel mapping to search for an image approximation based on kernelized locality-sensitive hashing. To address problems related to the unstable search accuracy of an unsupervised image hashing function and degradation of the search-time performance with increases in the number of hashing bits, we propose a method that combines additive explicit homogeneous kernel mapping and image feature histograms to construct a search algorithm based on a locality-sensitive hashing function. Moreover, to address the problem of semantic gaps caused by using image data that lack type information in semantic modeling, we describe an approximation searching algorithm based on the homogeneous kernel mapping of similarities between pairs of images and dissimilar constraint relationships. Our image search experiments confirmed that the proposed algorithm can construct a locality-sensitive hash function more accurately, thereby effectively improving the similarity search performance.
url http://dx.doi.org/10.1155/2018/9671630
work_keys_str_mv AT junyili approximatelynearestneighborhoodimagesearchusingunsupervisedhashingviahomogeneouskernels
AT jianhuali approximatelynearestneighborhoodimagesearchusingunsupervisedhashingviahomogeneouskernels
_version_ 1725796651721818112