-#define ASORT_ELT(i) items[i]
-#define ASORT_EXTRA_ARGS , uns *items
-#include "lib/arraysort.h"
-
-static uns
-image_signatures_dist_2(struct image_signature *sig1, struct image_signature *sig2)
-{
- DBG("image_signatures_dist_2()");
-
- uns dist[IMAGE_REG_MAX * IMAGE_REG_MAX], p[IMAGE_REG_MAX], q[IMAGE_REG_MAX];
- uns n, i, j, k, l, s, d;
- struct image_region *reg1, *reg2;
-
- /* Compute distance matrix */
- n = 0;
- /* ... for non-textured images */
- if (!((sig1->flags | sig2->flags) & IMAGE_SIG_TEXTURED))
- for (j = 0, reg2 = sig2->reg; j < sig2->len; j++, reg2++)
- for (i = 0, reg1 = sig1->reg; i < sig1->len; i++, reg1++)
- {
- uns ds =
- isqr((int)reg1->h[0] - (int)reg2->h[0]) +
- isqr((int)reg1->h[1] - (int)reg2->h[1]) +
- isqr((int)reg1->h[2] - (int)reg2->h[2]);
- uns dt =
- isqr((int)reg1->f[0] - (int)reg2->f[0]) +
- isqr((int)reg1->f[1] - (int)reg2->f[1]) +
- isqr((int)reg1->f[2] - (int)reg2->f[2]) +
- isqr((int)reg1->f[3] - (int)reg2->f[3]) +
- isqr((int)reg1->f[4] - (int)reg2->f[4]) +
- isqr((int)reg1->f[5] - (int)reg2->f[5]);
- if (ds < 1000)
- dt *= 8;
- else if (ds < 10000)
- dt *= 12;
- else
- dt *= 16;
- DBG("[%u][%u] ... ds=%u dt=%u", i, j, ds, dt);
- dist[n++] = (dt << 8) + i + (j << 4) ;
- }
- /* ... for textured images (ignore shape properties) */
- else
- for (j = 0, reg2 = sig2->reg; j < sig2->len; j++, reg2++)
- for (i = 0, reg1 = sig1->reg; i < sig1->len; i++, reg1++)
- {
- uns dt =
- isqr((int)reg1->f[0] - (int)reg2->f[0]) +
- isqr((int)reg1->f[1] - (int)reg2->f[1]) +
- isqr((int)reg1->f[2] - (int)reg2->f[2]) +
- isqr((int)reg1->f[3] - (int)reg2->f[3]) +
- isqr((int)reg1->f[4] - (int)reg2->f[4]) +
- isqr((int)reg1->f[5] - (int)reg2->f[5]);
- dist[n++] = (dt << 12) + i + (j << 4) ;
- }
-
- /* One or both signatures have no regions */
- if (!n)
- return 1 << IMAGE_SIG_DIST_SCALE;
-
- /* Get percentages */
- for (i = 0, reg1 = sig1->reg; i < sig1->len; i++, reg1++)
- p[i] = reg1->wb;
- for (i = 0, reg2 = sig2->reg; i < sig2->len; i++, reg2++)
- q[i] = reg2->wb;
-
- /* Sort entries in distance matrix */
- image_signatures_dist_2_sort(n, dist);
-
- /* Compute significance matrix and resulting distance */
- uns sum = 0;
- for (k = 0, l = 128; l; k++)
- {
- i = dist[k] & 15;
- j = (dist[k] >> 4) & 15;
- d = dist[k] >> 8;
- if (p[i] <= q[j])
- {
- s = p[i];
- q[j] -= p[i];
- p[i] = 0;
- }
- else
- {
- s = q[j];
- p[i] -= q[j];
- q[j] = 0;
- }
- l -= s;
- sum += s * d;
- DBG("s[%u][%u]=%u d=%u", i, j, s, d);
- }
-
- return sum;
-}
-
-uns
-image_signatures_dist(struct image_signature *sig1, struct image_signature *sig2)
-{
- switch (image_sig_compare_method)
- {
- case 1:
- return image_signatures_dist_1(sig1, sig2);
- case 2:
- return image_signatures_dist_2(sig1, sig2);
- default:
- die("Invalid image signatures compare method.");
- }
-}