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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
|
// Copyright (C) 2013 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#undef DLIB_LSH_HAShES_ABSTRACT_Hh_
#ifdef DLIB_LSH_HAShES_ABSTRACT_Hh_
#include "../matrix.h"
namespace dlib
{
// ----------------------------------------------------------------------------------------
class hash_similar_angles_64
{
/*!
WHAT THIS OBJECT REPRESENTS
This object is a tool for computing locality sensitive hashes that give
vectors with small angles between each other similar hash values. In
particular, this object creates 64 random planes which pass though the
origin and uses them to create a 64bit hash. To compute the hash for a new
vector, this object checks which side of each plane the vector falls on and
records this information into a 64bit integer.
!*/
public:
hash_similar_angles_64 (
);
/*!
ensures
- #get_seed() == 0
!*/
hash_similar_angles_64 (
const uint64 seed
);
/*!
ensures
- #get_seed() == seed
!*/
uint64 get_seed (
) const;
/*!
ensures
- returns the random seed used to generate the random planes used for
hashing.
!*/
typedef uint64 result_type;
template <typename vector_type>
result_type perator() (
const vector_type& v
) const;
/*!
requires
- v is an unsorted sparse vector or a dlib matrix representing either a
column or row vector.
ensures
- returns a 64 bit hash of the input vector v. The bits in the hash record
which side of each random plane v falls on.
!*/
unsigned int distance (
const result_type& a,
const result_type& b
) const;
/*!
ensures
- returns the Hamming distance between the two hashes given to this
function. That is, we return the number of bits in a and b which differ.
!*/
};
// ----------------------------------------------------------------------------------------
struct hash_similar_angles_128
{
/*!
WHAT THIS OBJECT REPRESENTS
This object is a tool for computing locality sensitive hashes that give
vectors with small angles between each other similar hash values. In
particular, this object creates 128 random planes which pass though the
origin and uses them to create a 128bit hash. To compute the hash for a new
vector, this object checks which side of each plane the vector falls on and
records this information into a 128bit integer.
!*/
public:
hash_similar_angles_128 (
);
/*!
ensures
- #get_seed() == 0
!*/
hash_similar_angles_128 (
const uint64 seed
);
/*!
ensures
- #get_seed() == seed
!*/
uint64 get_seed (
) const;
/*!
ensures
- returns the random seed used to generate the random planes used for
hashing.
!*/
typedef std::pair<uint64,uint64> result_type;
template <typename vector_type>
result_type perator() (
const vector_type& v
) const;
/*!
requires
- v is an unsorted sparse vector or a dlib matrix representing either a
column or row vector.
ensures
- returns a 128 bit hash of the input vector v. The bits in the hash record
which side of each random plane v falls on.
!*/
unsigned int distance (
const result_type& a,
const result_type& b
) const;
/*!
ensures
- returns the Hamming distance between the two hashes given to this
function. That is, we return the number of bits in a and b which differ.
!*/
};
// ----------------------------------------------------------------------------------------
struct hash_similar_angles_256
{
/*!
WHAT THIS OBJECT REPRESENTS
This object is a tool for computing locality sensitive hashes that give
vectors with small angles between each other similar hash values. In
particular, this object creates 256 random planes which pass though the
origin and uses them to create a 256bit hash. To compute the hash for a new
vector, this object checks which side of each plane the vector falls on and
records this information into a 256bit integer.
!*/
public:
hash_similar_angles_256 (
);
/*!
ensures
- #get_seed() == 0
!*/
hash_similar_angles_256 (
const uint64 seed
);
/*!
ensures
- #get_seed() == seed
!*/
uint64 get_seed (
) const;
/*!
ensures
- returns the random seed used to generate the random planes used for
hashing.
!*/
typedef std::pair<uint64,uint64> hash128_type;
typedef std::pair<hash128_type,hash128_type> result_type;
template <typename vector_type>
result_type perator() (
const vector_type& v
) const;
/*!
requires
- v is an unsorted sparse vector or a dlib matrix representing either a
column or row vector.
ensures
- returns a 256 bit hash of the input vector v. The bits in the hash record
which side of each random plane v falls on.
!*/
unsigned int distance (
const result_type& a,
const result_type& b
) const;
/*!
ensures
- returns the Hamming distance between the two hashes given to this
function. That is, we return the number of bits in a and b which differ.
!*/
};
// ----------------------------------------------------------------------------------------
struct hash_similar_angles_512
{
/*!
WHAT THIS OBJECT REPRESENTS
This object is a tool for computing locality sensitive hashes that give
vectors with small angles between each other similar hash values. In
particular, this object creates 512 random planes which pass though the
origin and uses them to create a 512bit hash. To compute the hash for a new
vector, this object checks which side of each plane the vector falls on and
records this information into a 512bit integer.
!*/
public:
hash_similar_angles_512 (
);
/*!
ensures
- #get_seed() == 0
!*/
hash_similar_angles_512 (
const uint64 seed
);
/*!
ensures
- #get_seed() == seed
!*/
uint64 get_seed (
) const;
/*!
ensures
- returns the random seed used to generate the random planes used for
hashing.
!*/
typedef hash_similar_angles_256::result_type hash256_type;
typedef std::pair<hash256_type,hash256_type> result_type;
template <typename vector_type>
result_type perator() (
const vector_type& v
) const;
/*!
requires
- v is an unsorted sparse vector or a dlib matrix representing either a
column or row vector.
ensures
- returns a 512 bit hash of the input vector v. The bits in the hash record
which side of each random plane v falls on.
!*/
unsigned int distance (
const result_type& a,
const result_type& b
) const;
/*!
ensures
- returns the Hamming distance between the two hashes given to this
function. That is, we return the number of bits in a and b which differ.
!*/
};
// ----------------------------------------------------------------------------------------
}
#endif // DLIB_LSH_HAShES_ABSTRACT_Hh_
|
