最近邻查询处理是许多图像检索应用的基本操作。通常,图像由特征提取算法生成的高维向量存储和表示。由于基于树的索引结构被证明是无效的高维处理,由于众所周知的“Curse of Precisionality”,近似最近邻技术被用于更快的查询处理。局部敏感哈希(LSH)是一种非常流行和有效的近似最近邻技术,以其次线性查询处理复杂度和理论保证而闻名。如今,随着技术的出现,多个不同的应用领域都需要实时的【形】高维数据存储和处理能力。现有的LSH技术不适合处理实时的【形】数据和查询。在本文中,我们讨论了现有的LSH技术处理实时的【形】高维图像数据的挑战和缺点。此外,通过实验分析,我们提出了改进现有的国家的最先进的LSH技术,有效地处理高维图像数据。
英文摘要:
Nearest-neighbor query processing is a fundamental operation for many image retrieval applications. Often, images are stored and represented by high-dimensional vectors that are generated by feature-extraction algorithms. Since tree-based index structures are shown to be ineffective for high dimensional processing due to the well-known "Curse of Dimensionality", approximate nearest neighbor techniques are used for faster query processing. Locality Sensitive Hashing (LSH) is a very popular and efficient approximate nearest neighbor technique that is known for its sublinear query processing complexity and theoretical guarantees. Nowadays, with the emergence of technology, several diverse application domains require real-time high-dimensional data storing and processing capacity. Existing LSH techniques are not suitable to handle real-time data and queries. In this paper, we discuss the challenges and drawbacks of existing LSH techniques for processing real-time high-dimensional image data. Additionally, through experimental analysis, we propose improvements for existing state-of-the-art LSH techniques for efficient processing of high-dimensional image data.
DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);LIPADE, Université Paris Cité(巴黎西岱大学 LIPADE 实验室)
Microsoft Research(微软研究院);The University of Queensland(昆士兰大学);Tsinghua University(清华大学)
相似性搜索(最近邻搜索)是从大型数据库中寻找与查询项距离最小的数据项的问题。已经开发了各种方法来解决这个问题,最近已经投入了大量的努力近似搜索。在本文中,我们提出了一个调查的主要解决方案之一,哈希,这已经被广泛研究,因为开拓性的工作局部敏感哈希。本文将散列算法分为两大类:局部敏感散列算法(locality sensitive hashing)和学习散列算法(learning to hash),局部敏感散列算法是根据数据分布来学习散列函数,本文从散列函数的设计、散列编码空间中的距离度量和搜索机制等方面对散列算法进行了综述。
Locality Sensitive Hashing with Extended Differential Privacy
Macquarie University(麦考瑞大学);Inria(法国国家信息与自动化研究所);École Polytechnique(巴黎综合理工学院);National Institute of Advanced Industrial Science and Technology (AIST)(日本产业技术综合研究所)