article thumbnail

Implementing Approximate Nearest Neighbor Search with KD-Trees

PyImageSearch

This lesson is the 1st in a 2-part series on Mastering Approximate Nearest Neighbor Search : Implementing Approximate Nearest Neighbor Search with KD-Trees (this tutorial) Approximate Nearest Neighbor with Locality Sensitive Hashing (LSH) To learn how to implement an approximate nearest neighbor search using KD-Tree , just keep reading.

article thumbnail

Build a reverse image search engine with Amazon Titan Multimodal Embeddings in Amazon Bedrock and AWS managed services

AWS Machine Learning Blog

To upload the dataset Download the dataset : Go to the Shoe Dataset page on Kaggle.com and download the dataset file (350.79MB) that contains the images. To search against the database, you can use a vector search, which is performed using the k-nearest neighbors (k-NN) algorithm.

AWS 111
professionals

Sign Up for our Newsletter

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

article thumbnail

Build a contextual text and image search engine for product recommendations using Amazon Bedrock and Amazon OpenSearch Serverless

AWS Machine Learning Blog

We detail the steps to use an Amazon Titan Multimodal Embeddings model to encode images and text into embeddings, ingest embeddings into an OpenSearch Service index, and query the index using the OpenSearch Service k-nearest neighbors (k-NN) functionality. You then display the top similar results.

article thumbnail

Build a crop segmentation machine learning model with Planet data and Amazon SageMaker geospatial capabilities

AWS Machine Learning Blog

In this analysis, we use a K-nearest neighbors (KNN) model to conduct crop segmentation, and we compare these results with ground truth imagery on an agricultural region. This example uses the Python client to identify and download imagery needed for the analysis.

article thumbnail

Approximate Nearest Neighbor with Locality Sensitive Hashing (LSH)

PyImageSearch

This lesson is the last in a 2-part series on Mastering Approximate Nearest Neighbor Search : Implementing Approximate Nearest Neighbor Search with KD-Trees Approximate Nearest Neighbor with Locality Sensitive Hashing (LSH) (this tutorial) To learn how to implement LSH for approximate nearest neighbor search, just keep reading.

article thumbnail

Fundamentals of Recommendation Systems

PyImageSearch

K-Nearest Neighbor K-nearest neighbor (KNN) ( Figure 8 ) is an algorithm that can be used to find the closest points for a data point based on a distance measure (e.g., The item ratings of these -closest neighbors are then used to recommend items to the given user. Step into the future with Roboflow.

article thumbnail

Talk to your slide deck using multimodal foundation models hosted on Amazon Bedrock and Amazon SageMaker – Part 1

AWS Machine Learning Blog

We perform a k-nearest neighbor (k=1) search to retrieve the most relevant embedding matching the user query. Setting k=1 retrieves the most relevant slide to the user question. In this notebook, we download the LLaVA-v1.5-7B An OpenSearch vector search is performed using these embeddings. The model.tar.gz

AWS 122