You are not logged in.
Pages: 1
I was wanting to find a way to search for similar images and came across this library www.phash.org
It creates a perceptual hash of an image. It also builds an MVP tree for queries but is there a way mORMot can do this ?
The queries are done using a hamming distance comparison which I initially thought could be done with an rtree but it doesn't look so easy nor that suitable for SQL. Also found a similar question here
Offline
As far as I understand the problem, you need to find distances between points, whereas RTREE is about finding intersections between points and regions.
So you will need a dedicated memory structure, with dedicated algorithms.
Using an existing library like phash is a good idea - not to reinvent such a sophisticated wheel may save time!
You can use mORMot to store your structures, including pictures and hashes. Use a dynamic array of bytes if you want to store the hash, and a regular blob field to store the picture.
Offline
Pages: 1