Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

bitmap data likeness algorithm

I'd like to compare two bitmaps or parts of bitmap and see how alike they are.

I've came across some likeness algorithms for string data, like Levenshtein distance, and Jaro–Winkler distance. these, obviously, do not help when it comes to bitmap data.

Can anyone suggest an algorithm for comparing how alike bitmaps are?


EDIT

Thanks for the ideas,links etc.

While all information is helpful in familiarizing with this topic, I'm wondering how to generate images, something more along the lines of this:

enter image description here

like image 336
Daniel Avatar asked Jul 11 '11 01:07

Daniel


1 Answers

You could use Hausdorff image comparison, but be aware that this expects binary images.

Of note, visually similar images may have vastly different underlying pixel representations. Human perception makes computing visual similarity quite difficult. Hausdorff deals well with this by allowing two different images to score highly when the general similarity is the same.

If you want to compute data distances, you can use any distance metric you like and do so directly on the pixels. I'm particularly fond of Mahalanobis distance for these kind of comparisons.

like image 156
Mark Elliot Avatar answered Sep 22 '22 13:09

Mark Elliot