/
brief_7_128.hpp
188 lines (185 loc) · 9.96 KB
/
brief_7_128.hpp
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
// Copyright 2011 Ethan Eade. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above
// copyright notice, this list of conditions and the following
// disclaimer.
//
// 2. Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following
// disclaimer in the documentation and/or other materials
// provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY ETHAN EADE ``AS IS'' AND ANY EXPRESS
// OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL ETHAN EADE OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
// OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
// BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
// USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
//
// The views and conclusions contained in the software and
// documentation are those of the authors and should not be
// interpreted as representing official policies, either expressed or
// implied, of Ethan Eade.
#ifndef ECV_BRIEF_7_128_HPP
#define ECV_BRIEF_7_128_HPP
#include "stdint.h"
template <class T>
void BRIEF_7_128_extract(const T* p, int stride, uint32_t d[4])
{
uint32_t b;
{ // word 0
b = 0;
if (p[-7*stride + -2] < p[-5*stride + 0]) b |= (1 << 0);
if (p[7*stride + 6] < p[0*stride + 1]) b |= (1 << 1);
if (p[0*stride + -6] < p[5*stride + 0]) b |= (1 << 2);
if (p[1*stride + -5] < p[2*stride + 2]) b |= (1 << 3);
if (p[-2*stride + -4] < p[0*stride + -1]) b |= (1 << 4);
if (p[6*stride + 3] < p[1*stride + 0]) b |= (1 << 5);
if (p[5*stride + -3] < p[3*stride + -3]) b |= (1 << 6);
if (p[4*stride + 5] < p[-6*stride + -2]) b |= (1 << 7);
if (p[-3*stride + -1] < p[3*stride + 6]) b |= (1 << 8);
if (p[6*stride + 3] < p[5*stride + 0]) b |= (1 << 9);
if (p[3*stride + 3] < p[-4*stride + 4]) b |= (1 << 10);
if (p[-3*stride + 0] < p[7*stride + -4]) b |= (1 << 11);
if (p[-7*stride + 2] < p[-4*stride + -1]) b |= (1 << 12);
if (p[6*stride + -1] < p[2*stride + 3]) b |= (1 << 13);
if (p[-1*stride + 1] < p[-1*stride + 5]) b |= (1 << 14);
if (p[0*stride + -2] < p[5*stride + -5]) b |= (1 << 15);
if (p[6*stride + 1] < p[6*stride + -3]) b |= (1 << 16);
if (p[4*stride + -1] < p[-7*stride + 7]) b |= (1 << 17);
if (p[1*stride + -3] < p[1*stride + 0]) b |= (1 << 18);
if (p[0*stride + -5] < p[-5*stride + 0]) b |= (1 << 19);
if (p[5*stride + -5] < p[6*stride + 5]) b |= (1 << 20);
if (p[3*stride + 5] < p[-3*stride + 4]) b |= (1 << 21);
if (p[-5*stride + 3] < p[7*stride + 4]) b |= (1 << 22);
if (p[-5*stride + 1] < p[-6*stride + -6]) b |= (1 << 23);
if (p[0*stride + 1] < p[-2*stride + -4]) b |= (1 << 24);
if (p[-1*stride + -5] < p[1*stride + 7]) b |= (1 << 25);
if (p[0*stride + 4] < p[-1*stride + 0]) b |= (1 << 26);
if (p[6*stride + 0] < p[-4*stride + 2]) b |= (1 << 27);
if (p[0*stride + -6] < p[-7*stride + -6]) b |= (1 << 28);
if (p[5*stride + 0] < p[-6*stride + -3]) b |= (1 << 29);
if (p[2*stride + 3] < p[0*stride + 7]) b |= (1 << 30);
if (p[-6*stride + -2] < p[3*stride + -1]) b |= (1 << 31);
}
d[0] = b;
{ // word 1
b = 0;
if (p[0*stride + 2] < p[2*stride + 3]) b |= (1 << 0);
if (p[2*stride + 2] < p[0*stride + -1]) b |= (1 << 1);
if (p[6*stride + -1] < p[-3*stride + -2]) b |= (1 << 2);
if (p[0*stride + 3] < p[-7*stride + -2]) b |= (1 << 3);
if (p[5*stride + 5] < p[-4*stride + 3]) b |= (1 << 4);
if (p[0*stride + -2] < p[0*stride + 3]) b |= (1 << 5);
if (p[0*stride + -3] < p[1*stride + -1]) b |= (1 << 6);
if (p[1*stride + 5] < p[5*stride + 1]) b |= (1 << 7);
if (p[6*stride + 3] < p[-5*stride + 2]) b |= (1 << 8);
if (p[0*stride + 0] < p[-3*stride + 2]) b |= (1 << 9);
if (p[5*stride + 7] < p[-1*stride + -2]) b |= (1 << 10);
if (p[2*stride + 0] < p[-1*stride + -5]) b |= (1 << 11);
if (p[0*stride + 0] < p[-1*stride + -3]) b |= (1 << 12);
if (p[-2*stride + 0] < p[-4*stride + 2]) b |= (1 << 13);
if (p[6*stride + 4] < p[-6*stride + 0]) b |= (1 << 14);
if (p[1*stride + 1] < p[0*stride + 0]) b |= (1 << 15);
if (p[-2*stride + -5] < p[-5*stride + 7]) b |= (1 << 16);
if (p[-4*stride + -6] < p[-4*stride + 2]) b |= (1 << 17);
if (p[2*stride + -7] < p[7*stride + 4]) b |= (1 << 18);
if (p[5*stride + 0] < p[1*stride + 2]) b |= (1 << 19);
if (p[0*stride + -2] < p[-7*stride + 7]) b |= (1 << 20);
if (p[-5*stride + 2] < p[-7*stride + 1]) b |= (1 << 21);
if (p[3*stride + -6] < p[-5*stride + -5]) b |= (1 << 22);
if (p[-3*stride + 1] < p[-1*stride + 6]) b |= (1 << 23);
if (p[4*stride + 1] < p[0*stride + 1]) b |= (1 << 24);
if (p[6*stride + 5] < p[-4*stride + 7]) b |= (1 << 25);
if (p[-4*stride + -1] < p[0*stride + 0]) b |= (1 << 26);
if (p[0*stride + 1] < p[7*stride + -7]) b |= (1 << 27);
if (p[-1*stride + -1] < p[-6*stride + -5]) b |= (1 << 28);
if (p[-5*stride + -6] < p[3*stride + -3]) b |= (1 << 29);
if (p[-6*stride + -2] < p[7*stride + 7]) b |= (1 << 30);
if (p[0*stride + -1] < p[-1*stride + -3]) b |= (1 << 31);
}
d[1] = b;
{ // word 2
b = 0;
if (p[6*stride + 3] < p[4*stride + -2]) b |= (1 << 0);
if (p[5*stride + 0] < p[3*stride + -6]) b |= (1 << 1);
if (p[0*stride + -4] < p[1*stride + 5]) b |= (1 << 2);
if (p[0*stride + -7] < p[0*stride + 4]) b |= (1 << 3);
if (p[-3*stride + 1] < p[4*stride + 3]) b |= (1 << 4);
if (p[-5*stride + -2] < p[-7*stride + 0]) b |= (1 << 5);
if (p[-2*stride + -4] < p[-2*stride + -6]) b |= (1 << 6);
if (p[-4*stride + 4] < p[-4*stride + -5]) b |= (1 << 7);
if (p[0*stride + 0] < p[5*stride + -1]) b |= (1 << 8);
if (p[6*stride + 4] < p[-7*stride + -3]) b |= (1 << 9);
if (p[7*stride + 1] < p[5*stride + -6]) b |= (1 << 10);
if (p[2*stride + 3] < p[0*stride + -1]) b |= (1 << 11);
if (p[5*stride + 0] < p[-2*stride + 7]) b |= (1 << 12);
if (p[6*stride + 5] < p[-3*stride + 2]) b |= (1 << 13);
if (p[2*stride + 3] < p[-7*stride + 0]) b |= (1 << 14);
if (p[-2*stride + -6] < p[0*stride + -4]) b |= (1 << 15);
if (p[0*stride + 6] < p[-7*stride + 5]) b |= (1 << 16);
if (p[0*stride + -2] < p[3*stride + -3]) b |= (1 << 17);
if (p[3*stride + 5] < p[-6*stride + -3]) b |= (1 << 18);
if (p[6*stride + -4] < p[-3*stride + 0]) b |= (1 << 19);
if (p[7*stride + 7] < p[-5*stride + -7]) b |= (1 << 20);
if (p[6*stride + 6] < p[7*stride + -1]) b |= (1 << 21);
if (p[5*stride + 7] < p[-4*stride + 2]) b |= (1 << 22);
if (p[3*stride + -1] < p[-3*stride + -1]) b |= (1 << 23);
if (p[2*stride + 0] < p[-5*stride + 0]) b |= (1 << 24);
if (p[6*stride + 3] < p[-7*stride + 3]) b |= (1 << 25);
if (p[6*stride + 5] < p[-7*stride + -6]) b |= (1 << 26);
if (p[0*stride + -2] < p[-6*stride + 0]) b |= (1 << 27);
if (p[-7*stride + -1] < p[-3*stride + -3]) b |= (1 << 28);
if (p[1*stride + 6] < p[1*stride + -3]) b |= (1 << 29);
if (p[7*stride + 4] < p[-4*stride + 2]) b |= (1 << 30);
if (p[3*stride + 2] < p[0*stride + 3]) b |= (1 << 31);
}
d[2] = b;
{ // word 3
b = 0;
if (p[-3*stride + -3] < p[7*stride + 5]) b |= (1 << 0);
if (p[2*stride + -3] < p[4*stride + 0]) b |= (1 << 1);
if (p[-1*stride + -2] < p[-7*stride + 0]) b |= (1 << 2);
if (p[1*stride + 1] < p[-1*stride + -5]) b |= (1 << 3);
if (p[4*stride + 0] < p[-6*stride + 7]) b |= (1 << 4);
if (p[7*stride + 5] < p[6*stride + -3]) b |= (1 << 5);
if (p[7*stride + -1] < p[1*stride + 4]) b |= (1 << 6);
if (p[1*stride + -6] < p[-3*stride + -3]) b |= (1 << 7);
if (p[1*stride + 0] < p[6*stride + -3]) b |= (1 << 8);
if (p[0*stride + -1] < p[6*stride + -2]) b |= (1 << 9);
if (p[5*stride + 2] < p[0*stride + 5]) b |= (1 << 10);
if (p[0*stride + 0] < p[-7*stride + 2]) b |= (1 << 11);
if (p[-7*stride + -3] < p[5*stride + 0]) b |= (1 << 12);
if (p[5*stride + 0] < p[0*stride + 1]) b |= (1 << 13);
if (p[-2*stride + -6] < p[-2*stride + -3]) b |= (1 << 14);
if (p[7*stride + 3] < p[0*stride + 2]) b |= (1 << 15);
if (p[3*stride + 4] < p[5*stride + 7]) b |= (1 << 16);
if (p[-3*stride + 7] < p[6*stride + 0]) b |= (1 << 17);
if (p[-5*stride + -2] < p[0*stride + -1]) b |= (1 << 18);
if (p[0*stride + 2] < p[4*stride + 5]) b |= (1 << 19);
if (p[0*stride + 0] < p[4*stride + -4]) b |= (1 << 20);
if (p[6*stride + -2] < p[0*stride + 3]) b |= (1 << 21);
if (p[-2*stride + 3] < p[1*stride + 3]) b |= (1 << 22);
if (p[1*stride + -5] < p[-4*stride + -3]) b |= (1 << 23);
if (p[7*stride + 2] < p[-1*stride + 0]) b |= (1 << 24);
if (p[1*stride + -3] < p[-4*stride + 7]) b |= (1 << 25);
if (p[-4*stride + 1] < p[2*stride + 0]) b |= (1 << 26);
if (p[-6*stride + -2] < p[2*stride + 4]) b |= (1 << 27);
if (p[5*stride + 6] < p[2*stride + 5]) b |= (1 << 28);
if (p[2*stride + -3] < p[5*stride + -1]) b |= (1 << 29);
if (p[2*stride + 5] < p[-3*stride + 5]) b |= (1 << 30);
if (p[3*stride + 1] < p[-2*stride + 1]) b |= (1 << 31);
}
d[3] = b;
}
#endif