4 * Copyright (C) 2008 - 2012 The Geeqie Team
8 * This software is released under the GNU General Public License (GNU GPL).
9 * Please read the included file COPYING for more information.
10 * This software comes with no warranty of any kind, use at your own risk!
18 * These functions are intended to find images with similar color content. For
19 * example when an image was saved at different compression levels or dimensions
20 * (scaled down/up) the contents are similar, but these files do not match by file
21 * size, dimensions, or checksum.
23 * These functions create a 32 x 32 array for each color channel (red, green, blue).
24 * The array represents the average color of each corresponding part of the
25 * image. (imagine the image cut into 1024 rectangles, or a 32 x 32 grid.
26 * Each grid is then processed for the average color value, this is what
27 * is stored in the array)
29 * To compare two images, generate a ImageSimilarityData for each image, then
30 * pass them to the compare function. The return value is the percent match
31 * of the two images. (for this, simple comparisons are used, basically the return
32 * is an average of the corresponding array differences)
34 * for image_sim_compare(), the return is 0.0 to 1.0:
35 * 1.0 for exact matches (an image is compared to itself)
36 * 0.0 for exact opposite images (compare an all black to an all white image)
37 * generally only a match of > 0.85 are significant at all, and >.95 is useful to
38 * find images that have been re-saved to other formats, dimensions, or compression.
43 * The experimental (alternate) algorithm is only for testing of new techniques to
44 * improve the result, and hopes to reduce false positives.
47 static gboolean alternate_enabled = FALSE;
49 void image_sim_alternate_set(gboolean enable)
51 alternate_enabled = enable;
54 gboolean image_sim_alternate_enabled(void)
56 return alternate_enabled;
59 ImageSimilarityData *image_sim_new(void)
61 ImageSimilarityData *sd = g_new0(ImageSimilarityData, 1);
66 void image_sim_free(ImageSimilarityData *sd)
71 static gint image_sim_channel_eq_sort_cb(gconstpointer a, gconstpointer b)
73 gint *pa = (gpointer)a;
74 gint *pb = (gpointer)b;
75 if (pa[1] < pb[1]) return -1;
76 if (pa[1] > pb[1]) return 1;
80 static void image_sim_channel_equal(guint8 *pix, gint len)
86 buf = g_new0(gint, len * 2);
89 for (i = 0; i < len; i++)
93 buf[p] = (gint)pix[i];
97 qsort(buf, len, sizeof(gint) * 2, image_sim_channel_eq_sort_cb);
100 for (i = 0; i < len; i++)
106 pix[n] = (guint8)(255 * i / len);
112 static void image_sim_channel_norm(guint8 *pix, gint len)
120 for (i = 0; i < len; i++)
122 if (pix[i] < l) l = pix[i];
123 if (pix[i] > h) h = pix[i];
127 scale = (delta != 0) ? 255.0 / (gdouble)(delta) : 1.0;
129 for (i = 0; i < len; i++)
131 pix[i] = (guint8)((gdouble)(pix[i] - l) * scale);
136 * define these to enable various components of the experimental compare functions
138 * Convert the thumbprint to greyscale (ignore all color information when comparing)
139 * #define ALTERNATE_USES_GREYSCALE 1
141 * Take into account the difference in change from one pixel to the next
142 * #define ALTERNATE_INCLUDE_COMPARE_CHANGE 1
145 void image_sim_alternate_processing(ImageSimilarityData *sd)
147 #ifdef ALTERNATE_USES_GREYSCALE
151 if (!alternate_enabled) return;
153 image_sim_channel_norm(sd->avg_r, sizeof(sd->avg_r));
154 image_sim_channel_norm(sd->avg_g, sizeof(sd->avg_g));
155 image_sim_channel_norm(sd->avg_b, sizeof(sd->avg_b));
157 image_sim_channel_equal(sd->avg_r, sizeof(sd->avg_r));
158 image_sim_channel_equal(sd->avg_g, sizeof(sd->avg_g));
159 image_sim_channel_equal(sd->avg_b, sizeof(sd->avg_b));
161 #ifdef ALTERNATE_USES_GREYSCALE
162 for (i = 0; i < sizeof(sd->avg_r); i++)
166 n = (guint8)((gint)(sd->avg_r[i] + sd->avg_g[i] + sd->avg_b[i]) / 3);
167 sd->avg_r[i] = sd->avg_g[i] = sd->avg_b[i] = n;
172 void image_sim_fill_data(ImageSimilarityData *sd, GdkPixbuf *pixbuf)
183 gint x_inc, y_inc, xy_inc;
186 gboolean x_small = FALSE; /* if less than 32 w or h, set TRUE */
187 gboolean y_small = FALSE;
189 if (!sd || !pixbuf) return;
191 w = gdk_pixbuf_get_width(pixbuf);
192 h = gdk_pixbuf_get_height(pixbuf);
193 rs = gdk_pixbuf_get_rowstride(pixbuf);
194 pix = gdk_pixbuf_get_pixels(pixbuf);
195 has_alpha = gdk_pixbuf_get_has_alpha(pixbuf);
197 p_step = has_alpha ? 4 : 3;
212 xy_inc = x_inc * y_inc;
216 for (ys = 0; ys < 32; ys++)
218 if (y_small) j = (gdouble)h / 32 * ys;
222 for (xs = 0; xs < 32; xs++)
229 if (x_small) i = (gdouble)w / 32 * xs;
232 xpos = pix + (i * p_step);
234 for (y = j; y < j + y_inc; y++)
237 for (x = i; x < i + x_inc; x++)
264 ImageSimilarityData *image_sim_new_from_pixbuf(GdkPixbuf *pixbuf)
266 ImageSimilarityData *sd;
268 sd = image_sim_new();
269 image_sim_fill_data(sd, pixbuf);
274 #ifdef ALTERNATE_INCLUDE_COMPARE_CHANGE
275 static gdouble alternate_image_sim_compare_fast(ImageSimilarityData *a, ImageSimilarityData *b, gdouble min)
282 if (!a || !b || !a->filled || !b->filled) return 0.0;
288 for (j = 0; j < 1024; j += 32)
290 for (i = j; i < j + 32; i++)
295 cr = abs(a->avg_r[i] - b->avg_r[i]);
296 cg = abs(a->avg_g[i] - b->avg_g[i]);
297 cb = abs(a->avg_b[i] - b->avg_b[i]);
300 sim += cd + abs(cd - ld);
303 /* check for abort, if so return 0.0 */
304 if ((gdouble)sim / (255.0 * 1024.0 * 4.0) > min) return 0.0;
307 return (1.0 - ((gdouble)sim / (255.0 * 1024.0 * 4.0)) );
311 gdouble image_sim_compare(ImageSimilarityData *a, ImageSimilarityData *b)
316 if (!a || !b || !a->filled || !b->filled) return 0.0;
320 for (i = 0; i < 1024; i++)
322 sim += abs(a->avg_r[i] - b->avg_r[i]);
323 sim += abs(a->avg_g[i] - b->avg_g[i]);
324 sim += abs(a->avg_b[i] - b->avg_b[i]);
327 return 1.0 - ((gdouble)sim / (255.0 * 1024.0 * 3.0));
330 /* this uses a cutoff point so that it can abort early when it gets to
331 * a point that can simply no longer make the cut-off point.
333 gdouble image_sim_compare_fast(ImageSimilarityData *a, ImageSimilarityData *b, gdouble min)
339 #ifdef ALTERNATE_INCLUDE_COMPARE_CHANGE
340 if (alternate_enabled) return alternate_image_sim_compare_fast(a, b, min);
343 if (!a || !b || !a->filled || !b->filled) return 0.0;
348 for (j = 0; j < 1024; j += 32)
350 for (i = j; i < j + 32; i++)
352 sim += abs(a->avg_r[i] - b->avg_r[i]);
353 sim += abs(a->avg_g[i] - b->avg_g[i]);
354 sim += abs(a->avg_b[i] - b->avg_b[i]);
356 /* check for abort, if so return 0.0 */
357 if ((gdouble)sim / (255.0 * 1024.0 * 3.0) > min) return 0.0;
360 return (1.0 - ((gdouble)sim / (255.0 * 1024.0 * 3.0)) );
362 /* vim: set shiftwidth=8 softtabstop=0 cindent cinoptions={1s: */