45 Open source projects that are alternatives of or similar to Nanopq

Elasticsearch plugin for nearest neighbor search. Store vectors and run similarity search using exact and approximate algorithms.

Source Code for KNN Matting, CVPR 2012 / TPAMI 2013. MATLAB code ready to run. Simple and robust implementation under 40 lines.

Nearest neighbor search for Rails and Postgres

Fast and memory-efficient ANN with a subset-search functionality

gann(go-approximate-nearest-neighbor) is a library for Approximate Nearest Neighbor Search written in Go

Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk

GGNN: State of the Art Graph-based GPU Nearest Neighbor Search

📝Awesome and classical image retrieval papers

Fast Near-Duplicate Image Search and Delete using pHash, t-SNE and KDTree.

Code for papers "Hashing with Mutual Information" (TPAMI 2019) and "Hashing with Binary Matrix Pursuit" (ECCV 2018)

FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)

Utilities for point cloud processing. read ply, write ply, search nearest neighbors using octree ...

Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data

An open-source vector database for embedding similarity search and AI applications.

Statistical Machine Intelligence & Learning Engine

Open source audio fingerprinting in .NET. An efficient algorithm for acoustic fingerprinting written purely in C#.

Training of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Python and Spark.

TOROS N2 - lightweight approximate Nearest Neighbor library which runs fast even with large datasets

A Python nearest neighbor descent for approximate nearest neighbors

mlpack: a scalable C++ machine learning library --

an implementation of parallel linear BVH (LBVH) on GPU

Open-source vector similarity search for Postgres

All the code for a series of Medium articles on Approximate Nearest Neighbors

The data structure for unstructured data

A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and nearest neighbor search

A k-d tree implementation in Go.

Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.

A header-only C++ library for k nearest neighbor search with Eigen3.

High Dimensional Approximate Near(est) Neighbor

annoy-rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).

Code for my PhD thesis. Library of quantization-based methods for fast similarity search in high dimensions. Presented at ECCV 18.

K-dimensional tree in Rust for fast geospatial indexing and lookup

LSH index for approximate set containment search

Collections of vector search related libraries, service and research papers

Unofficial python wrapper to the nanoflann k-d tree

Web服务：使用腾讯 800 万词向量模型和 spotify annoy 引擎得到相似关键词

Fast search algorithm for product-quantized codes via hash-tables

A Python package for hubness analysis and high-dimensional data mining

Quick ADC

Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search

A scalable nearest neighbor search library in Apache Spark

A Java library implementing practical nearest neighbour search algorithm for multidimensional vectors that operates in sublinear time. It implements Locality-sensitive Hashing (LSH) and multi index hashing for hamming space.

Some useful tips for faiss

Vald. A Highly Scalable Distributed Vector Search Engine

Fast Approximate Nearest Neighbor (ANN) searches with a PostgreSQL database.