Looking for the source code to this post? Jump Right To The Downloads Section Building an Image Hashing Search Engine with VP-Trees and OpenCV
To learn how to build your first image hashing search engine with OpenCV, just keep reading! Utilize a specialized data structure, called a VP-Tree, that can be used used to scale image hashing search engines to millions of images.Build an image hashing search engine to find both identical and near-identical images in a dataset.In the remainder of this tutorial you will learn how to: Using a VP-Tree we can reduce our search complexity from O(n) to O(log n), enabling us to obtain our sub-linear goal! The answer is a specialized data structure called a VP-Tree. In a practical, real-world application that’s far too slow - we need to find a way to reduce that search to sub-linear time complexity.īut how can we reduce search time so dramatically? To find near-duplicate images, our original image hashing method would require us to perform a linear search, comparing the query hash to each individual image hash in our dataset.
However, there was a scalability problem with that original tutorial - namely that it did not scale! That guide showed you how to find identical/duplicate images in a given dataset.