Approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels
Summary: 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.
- A unifying framework in vector-valued reproducing kernel Hilbert spaces for manifold regularization and co-regularized multi-view learning
- An efficient primal dual prox method for non-smooth optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Kernel ICA: An alternative formulation and its application to face recognition
This page was built for publication: Approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1649549)
