1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
#include <stdio.h>
#include <stdint.h>
#include "math.h"
#include "pHash.h"
using namespace cimg_library;
void sort_names(char **names, int L1){
for (int i=0;i<L1;i++){
int min = i;
for (int j=i+1;j<L1;j++){
if (strcmp(names[j], names[min]) <= 0)
min = j;
}
if (i != min){
char *swap = names[i];
names[i] = names[min];
names[min] = swap;
}
}
}
int main(int argc, char **argv){
if (argc < 3){
printf(" not enough input args\n");
exit(1);
}
const char *dirname1 = argv[1];
const char *dirname2 = argv[2];
int alpha = 2;
int level = 1;
int nbfiles1;
char **files1 = ph_readfilenames(dirname1, nbfiles1);
sort_names(files1,nbfiles1);
int nbfiles2;
char **files2 = ph_readfilenames(dirname2, nbfiles2);
sort_names(files2,nbfiles2);
if (nbfiles1 != nbfiles2){
printf("number files in both directories not equal\n");
exit(1);
}
uint8_t **hash1 = (uint8_t**)malloc(nbfiles1*sizeof(uint8_t*));
uint8_t *hash2 = NULL;
int hashlen1=0, hashlen2=0;
double dist = 0;
printf("intra distances\n");
printf("***************\n");
for (int i=0;i<nbfiles1;i++){
printf("file1: %s\n", files1[i]);
hash1[i] = ph_mh_imagehash(files1[i], hashlen1, alpha, level);
if (hash1 == NULL)
continue;
printf("file2: %s\n", files2[i]);
hash2 = ph_mh_imagehash(files2[i], hashlen2, alpha, level);
if (hash2 == NULL)
continue;
dist = ph_hammingdistance2(hash1[i], hashlen1, hash2, hashlen2);
printf("distance = %f\n", dist);
printf("-------------\n");
free(hash2);
}
printf("\n\n");
printf("--hit any key--\n");
getchar();
printf("inter distances\n");
for (int i=0;i<nbfiles1;i++){
for (int j=i+1;j<nbfiles1;j++){
dist = ph_hammingdistance2(hash1[i], hashlen1, hash1[j], hashlen1);
printf(" %d %d dist = %f\n", i, j, dist);
printf("----------------\n");
}
}
printf("done\n");
for(int i = 0; i < nbfiles1; ++i)
{
free(files1[i]);
free(files2[i]);
free(hash1[i]);
}
free(files1);
free(files2);
free(hash1);
return 0;
}
|
