zxc
Fast finding duplicate pictures in database.
I thought about clastering my descriptors of each picture with k-means to create about 1000 groups. And store every picture with one more field of group which i ll use as an index. Then I when i ll add new picture my algorithms will compute its descriptors and with k-means find its group. I ll take all pictures of this group and compare their descriptors with the descriptors of a new one like how i did in the screen above
12 replies