PointcloudutilitiesUtilities for point cloud processing. read ply, write ply, search nearest neighbors using octree ...
Stars: ✭ 17 (-98.15%)
NgtNearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data
Stars: ✭ 636 (-30.79%)
MilvusAn open-source vector database for embedding similarity search and AI applications.
Stars: ✭ 9,015 (+880.96%)
SmileStatistical Machine Intelligence & Learning Engine
Stars: ✭ 5,412 (+488.9%)
SoundfingerprintingOpen source audio fingerprinting in .NET. An efficient algorithm for acoustic fingerprinting written purely in C#.
Stars: ✭ 554 (-39.72%)
LopqTraining of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Python and Spark.
Stars: ✭ 530 (-42.33%)
N2TOROS N2 - lightweight approximate Nearest Neighbor library which runs fast even with large datasets
Stars: ✭ 457 (-50.27%)
PynndescentA Python nearest neighbor descent for approximate nearest neighbors
Stars: ✭ 377 (-58.98%)
Mlpackmlpack: a scalable C++ machine learning library --
Stars: ✭ 3,859 (+319.91%)
lbvhan implementation of parallel linear BVH (LBVH) on GPU
Stars: ✭ 67 (-92.71%)
pgvectorOpen-source vector similarity search for Postgres
Stars: ✭ 482 (-47.55%)
adventures-with-annAll the code for a series of Medium articles on Approximate Nearest Neighbors
Stars: ✭ 40 (-95.65%)
docarrayThe data structure for unstructured data
Stars: ✭ 561 (-38.96%)
graphgroveA framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and nearest neighbor search
Stars: ✭ 29 (-96.84%)
kdtreeA k-d tree implementation in Go.
Stars: ✭ 98 (-89.34%)
ann-benchmarksBenchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.
Stars: ✭ 30 (-96.74%)
knn-cppA header-only C++ library for k nearest neighbor search with Eigen3.
Stars: ✭ 25 (-97.28%)
DolphinnHigh Dimensional Approximate Near(est) Neighbor
Stars: ✭ 32 (-96.52%)
annoy.rbannoy-rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).
Stars: ✭ 23 (-97.5%)
Rayuela.jlCode for my PhD thesis. Library of quantization-based methods for fast similarity search in high dimensions. Presented at ECCV 18.
Stars: ✭ 54 (-94.12%)
kdtree-rsK-dimensional tree in Rust for fast geospatial indexing and lookup
Stars: ✭ 137 (-85.09%)
lshensembleLSH index for approximate set containment search
Stars: ✭ 48 (-94.78%)
awesome-vector-searchCollections of vector search related libraries, service and research papers
Stars: ✭ 460 (-49.95%)
pynanoflannUnofficial python wrapper to the nanoflann k-d tree
Stars: ✭ 24 (-97.39%)
wordvector beWeb服务:使用腾讯 800 万词向量模型和 spotify annoy 引擎得到相似关键词
Stars: ✭ 92 (-89.99%)
pqtableFast search algorithm for product-quantized codes via hash-tables
Stars: ✭ 48 (-94.78%)
scikit-hubnessA Python package for hubness analysis and high-dimensional data mining
Stars: ✭ 41 (-95.54%)
MrptFast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
Stars: ✭ 210 (-77.15%)
ScannsA scalable nearest neighbor search library in Apache Spark
Stars: ✭ 190 (-79.33%)
TarsoslshA 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.
Stars: ✭ 179 (-80.52%)
Faiss tipsSome useful tips for faiss
Stars: ✭ 170 (-81.5%)
ValdVald. A Highly Scalable Distributed Vector Search Engine
Stars: ✭ 158 (-82.81%)
PgannFast Approximate Nearest Neighbor (ANN) searches with a PostgreSQL database.
Stars: ✭ 156 (-83.03%)
NanopqPure python implementation of product quantization for nearest neighbor search
Stars: ✭ 145 (-84.22%)
ElastiknnElasticsearch plugin for nearest neighbor search. Store vectors and run similarity search using exact and approximate algorithms.
Stars: ✭ 139 (-84.87%)
Knn MattingSource Code for KNN Matting, CVPR 2012 / TPAMI 2013. MATLAB code ready to run. Simple and robust implementation under 40 lines.
Stars: ✭ 130 (-85.85%)
NeighborNearest neighbor search for Rails and Postgres
Stars: ✭ 114 (-87.6%)
RiiFast and memory-efficient ANN with a subset-search functionality
Stars: ✭ 96 (-89.55%)
Ganngann(go-approximate-nearest-neighbor) is a library for Approximate Nearest Neighbor Search written in Go
Stars: ✭ 75 (-91.84%)
AnnoyApproximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
Stars: ✭ 9,262 (+907.83%)
GgnnGGNN: State of the Art Graph-based GPU Nearest Neighbor Search
Stars: ✭ 63 (-93.14%)
Deep MihashCode for papers "Hashing with Mutual Information" (TPAMI 2019) and "Hashing with Binary Matrix Pursuit" (ECCV 2018)
Stars: ✭ 13 (-98.59%)