Algorithms, data structures and utilities around computingdescriptor k-nearest-neighbors.
Project description
SMQTK - Indexing
This package provides interfaces and implementations around the k-nearest-neighbor algorithm.
This package defines interfaces and implementations around efficient, large-scale indexing of descriptor vectors. The sources of such descriptor vectors may come from a multitude of sources, such as hours of video archives. Some provided implementation plugins include Locality-sensitive Hashing (LSH) and FAIR's [FAISS] library.
Documentation
You can build the sphinx documentation locally for the most up-to-date reference:
# Install dependencies
poetry install
# Navigate to the documentation root.
cd docs
# Build the docs.
poetry run make html
# Open in your favorite browser!
firefox _build/html/index.html
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
smqtk_indexing-0.17.0.tar.gz
(44.0 kB
view hashes)
Built Distribution
Close
Hashes for smqtk_indexing-0.17.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d343bd61c1fbcf32fa6aaca54f2de536c40eece6dff80d67895f799b6791176e |
|
MD5 | 1252690c077fcc8a023afa41d7a5e32e |
|
BLAKE2b-256 | d93396c912dfddbfcc7d13dde5befa0da34e4f736f25a733d35a32697aff2115 |