|
This is completely possible.
Say the search engine crawler saved the images it came across as a 0-9 number hash, where the numbers represent the approximate color of the pixel in question (it would first have to greyscale + increase the contrast of the image because each pixel only has 10 variations for its representation). Then the search query would generate another hash of the inputted image, and use the levenshtein principle (distance between two strings) to find its closest matches in the database.
|