arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.07091cs.DB
收藏

现有局部敏感散列技术的缺点和实时的处理的解决方案

Drawbacks and Proposed Solutions for Real-time Processing on Existing State-of-the-art Locality Sensitive Hashing Techniques

Omid Jafari, Khandker Mushfiqul Islam, Parth Nagarkar

摘要:

最近邻查询处理是许多图像检索应用的基本操作。通常,图像由特征提取算法生成的高维向量存储和表示。由于基于树的索引结构被证明是无效的高维处理,由于众所周知的“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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑