Results 61 to 70 of about 70,489 (181)
Algorithm of locality sensitive hashing bit selection based on feature selection
大数据, 2021 Locality sensitive hashing is one of the most popular information retrieval methods, which needs to generate long hashing bits to meet the retrieval requirement.However, a long hashing bits requires huge storage space, and contains plenty of redundant ...
Wenhua ZHOU, Huawen LIU, Enhui LI
doaj
, 2018 Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search.
Arora, Akhil +3 more
core +1 more source
An improved facial image retrieval using hybrid cheetah optimization algorithm [PDF]
Bulletin of the Polish Academy of Sciences: Technical SciencesWith the advent of social media, the volume of photographs uploaded on the internet has increased exponentially. The task of efficiently recognizing and retrieving human facial images is inevitable and essential at this time.
C Balasubramanian, J Raja Sekar
doaj +1 more source
NNG-Based Secure Approximate k-Nearest Neighbor Query for Large Language Models
MathematicsLarge language models (LLMs) have driven transformative progress in artificial intelligence, yet critical challenges persist in data management and privacy protection during model deployment and training.
Heng Zhou +3 more
doaj +1 more source
Deep Hashing Based Fusing Index Method for Large-Scale Image Retrieval
Applied Computational Intelligence and Soft Computing, 2017 Hashing has been widely deployed to perform the Approximate Nearest Neighbor (ANN) search for the large-scale image retrieval to solve the problem of storage and retrieval efficiency.
Lijuan Duan +4 more
doaj +1 more source
Competitive Quantization for Approximate Nearest Neighbor Search
IEEE Transactions on Knowledge and Data Engineering, 2016 In this study, we propose a novel vector quantization algorithm for Approximate Nearest Neighbor (ANN) search, based on a joint competitive learning strategy and hence called as competitive quantization (CompQ). CompQ is a hierarchical algorithm, which iteratively minimizes the quantization error by jointly optimizing the codebooks in each layer, using
Ozan, Ezgi Can +2 more
openaire +3 more sources
Multifeatured Image Retrieval Techniques Based on Partial Differential Equations for Online Shopping
Advances in Mathematical Physics, 2021 In today’s rapid development of network and multimedia technology, the booming of electronic commerce, users in the network shopping species of images and other multimedia information showing geometric growth, in the face of this situation, how to find ...
Jiaohui Yu
doaj +1 more source
Accelerated Approximate Nearest Neighbors Search Through Hierarchical Product Quantization [PDF]
2019 International Conference on Field-Programmable Technology (ICFPT), 2019 A fundamental recurring task in many machine learning applications is the search for the Nearest Neighbor in high dimensional metric spaces. Towards answering queries in large scale problems, state-of-the-art methods employ Approximate Nearest Neighbors (ANN) search, a search that returns the nearest neighbor with high probability, as well as ...
Abdelhadi, A +2 more
openaire +2 more sources
Semi-Paired Asymmetric Deep Cross-Modal Hashing Learning
IEEE Access, 2020 Hashing has been effectively applied in large-scale multimedia retrieval tasks due to the characteristics of fast calculation speed and low storage cost. However, most existing cross-view hashing methods require well paired views, where one sample in one
Yi Wang +4 more
doaj +1 more source
Hashing for Similarity Search: A Survey [PDF]
, 2014 Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database.
Ji, Jianqiu +3 more
core