regions.cpp
12 KB
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
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright 2012 The MITRE Corporation *
* *
* Licensed under the Apache License, Version 2.0 (the "License"); *
* you may not use this file except in compliance with the License. *
* You may obtain a copy of the License at *
* *
* http://www.apache.org/licenses/LICENSE-2.0 *
* *
* Unless required by applicable law or agreed to in writing, software *
* distributed under the License is distributed on an "AS IS" BASIS, *
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *
* See the License for the specific language governing permissions and *
* limitations under the License. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#include <opencv2/imgproc/imgproc.hpp>
#include "openbr/core/qtutils.h"
#include "openbr_internal.h"
#include "openbr/core/opencvutils.h"
using namespace cv;
namespace br
{
/*!
* \ingroup transforms
* \brief Subdivide matrix into rectangular subregions.
* \author Josh Klontz \cite jklontz
*/
class RectRegionsTransform : public UntrainableTransform
{
Q_OBJECT
Q_PROPERTY(int width READ get_width WRITE set_width RESET reset_width STORED false)
Q_PROPERTY(int height READ get_height WRITE set_height RESET reset_height STORED false)
Q_PROPERTY(int widthStep READ get_widthStep WRITE set_widthStep RESET reset_widthStep STORED false)
Q_PROPERTY(int heightStep READ get_heightStep WRITE set_heightStep RESET reset_heightStep STORED false)
BR_PROPERTY(int, width, 8)
BR_PROPERTY(int, height, 8)
BR_PROPERTY(int, widthStep, -1)
BR_PROPERTY(int, heightStep, -1)
void project(const Template &src, Template &dst) const
{
const int widthStep = this->widthStep == -1 ? width : this->widthStep;
const int heightStep = this->heightStep == -1 ? height : this->heightStep;
const Mat &m = src;
const int xMax = m.cols - width;
const int yMax = m.rows - height;
for (int x=0; x <= xMax; x += widthStep)
for (int y=0; y <= yMax; y += heightStep)
dst += m(Rect(x, y, width, height));
}
};
BR_REGISTER(Transform, RectRegionsTransform)
/*!
* \ingroup transforms
* \brief Turns each row into its own matrix.
* \author Josh Klontz \cite jklontz
*/
class ByRowTransform : public UntrainableTransform
{
Q_OBJECT
void project(const Template &src, Template &dst) const
{
for (int i=0; i<src.m().rows; i++)
dst += src.m().row(i);
}
};
BR_REGISTER(Transform, ByRowTransform)
/*!
* \ingroup transforms
* \brief Concatenates all input matrices into a single matrix.
* \author Josh Klontz \cite jklontz
*/
class CatTransform : public UntrainableMetaTransform
{
Q_OBJECT
Q_PROPERTY(int partitions READ get_partitions WRITE set_partitions RESET reset_partitions)
BR_PROPERTY(int, partitions, 1)
void project(const Template &src, Template &dst) const
{
dst.file = src.file;
if (src.size() % partitions != 0)
qFatal("%d partitions does not evenly divide %d matrices.", partitions, src.size());
QVector<int> sizes(partitions, 0);
for (int i=0; i<src.size(); i++)
sizes[i%partitions] += src[i].total();
if (!src.empty())
foreach (int size, sizes)
dst.append(Mat(1, size, src.m().type()));
QVector<int> offsets(partitions, 0);
for (int i=0; i<src.size(); i++) {
size_t size = src[i].total() * src[i].elemSize();
int j = i % partitions;
memcpy(&dst[j].data[offsets[j]], src[i].ptr(), size);
offsets[j] += size;
}
}
};
BR_REGISTER(Transform, CatTransform)
/*!
* \ingroup transforms
* \brief Concatenates all input matrices by row into a single matrix.
* All matricies must have the same column counts.
* \author Josh Klontz \cite jklontz
*/
class CatRowsTransform : public UntrainableMetaTransform
{
Q_OBJECT
void project(const Template &src, Template &dst) const
{
dst = Template(src.file, OpenCVUtils::toMatByRow(src));
}
};
BR_REGISTER(Transform, CatRowsTransform)
/*!
* \ingroup transforms
* \brief Concatenates all input matrices by column into a single matrix.
* Use after a fork to concatenate two feature matrices by column.
* \author Austin Blanton \cite imaus10
*/
class CatColsTransform : public UntrainableMetaTransform
{
Q_OBJECT
void project(const Template &src, Template &dst) const
{
int half = src.size()/2;
for (int i=0; i<half; i++) {
Mat first = src[i];
Mat second = src[half+i];
Mat both;
hconcat(first, second, both);
dst.append(both);
}
dst.file = src.file;
}
};
BR_REGISTER(Transform, CatColsTransform)
/*!
* \ingroup transforms
* \brief Reshape the each matrix to the specified number of rows.
* \author Josh Klontz \cite jklontz
*/
class ReshapeTransform : public UntrainableTransform
{
Q_OBJECT
Q_PROPERTY(int rows READ get_rows WRITE set_rows RESET reset_rows STORED false)
BR_PROPERTY(int, rows, 1)
void project(const Template &src, Template &dst) const
{
dst = src.m().reshape(src.m().channels(), rows);
}
};
BR_REGISTER(Transform, ReshapeTransform)
/*!
* \ingroup transforms
* \brief Wraps OpenCV merge
* \author Josh Klontz \cite jklontz
*/
class MergeTransform : public UntrainableMetaTransform
{
Q_OBJECT
void project(const Template &src, Template &dst) const
{
dst.file = src.file;
std::vector<Mat> mv;
foreach (const Mat &m, src)
mv.push_back(m);
merge(mv, dst);
}
};
BR_REGISTER(Transform, MergeTransform)
/*!
* \ingroup transforms
* \brief Duplicates the template data.
* \author Josh Klontz \cite jklontz
*/
class DupTransform : public UntrainableMetaTransform
{
Q_OBJECT
Q_PROPERTY(int n READ get_n WRITE set_n RESET reset_n STORED false)
BR_PROPERTY(int, n, 1)
void project(const Template &src, Template &dst) const
{
for (int i=0; i<n; i++)
dst.merge(src);
}
};
BR_REGISTER(Transform, DupTransform)
/*!
* \ingroup transforms
* \brief Expand the width and height of a template's rects by input width and height factors.
* \author Charles Otto \cite caotto
*/
class ExpandRectTransform : public UntrainableTransform
{
Q_OBJECT
Q_PROPERTY(float widthExpand READ get_widthExpand WRITE set_widthExpand RESET reset_widthExpand STORED false)
Q_PROPERTY(float heightExpand READ get_heightExpand WRITE set_heightExpand RESET reset_heightExpand STORED false)
BR_PROPERTY(float, widthExpand, .5)
BR_PROPERTY(float, heightExpand, .5)
void project(const Template &src, Template &dst) const
{
dst = src;
QList<QRectF> rects = dst.file.rects();
for (int i=0;i < rects.size(); i++) {
QRectF rect = rects[i];
qreal width = rect.width();
qreal height = rect.height();
float half_w_expansion = widthExpand / 2;
float half_h_expansion = heightExpand / 2;
qreal half_width = width * widthExpand;
qreal quarter_width = width * half_w_expansion;
qreal half_height = height * heightExpand;
qreal quarter_height = height * half_h_expansion;
rect.setX(std::max(qreal(0),(rect.x() - quarter_width)));
rect.setY(std::max(qreal(0),(rect.y() - quarter_height)));
qreal x2 = std::min(rect.width() + half_width + rect.x(), qreal(src.m().cols) - 1);
qreal y2 = std::min(rect.height() + half_height + rect.y(), qreal(src.m().rows) - 1);
rect.setWidth(x2 - rect.x());
rect.setHeight(y2 - rect.y());
rects[i] = rect;
}
dst.file.setRects(rects);
}
};
BR_REGISTER(Transform, ExpandRectTransform)
/*!
* \ingroup transforms
* \brief Crops the width and height of a template's rects by input width and height factors.
* \author Scott Klum \cite sklum
*/
class CropRectTransform : public UntrainableTransform
{
Q_OBJECT
Q_PROPERTY(QString widthCrop READ get_widthCrop WRITE set_widthCrop RESET reset_widthCrop STORED false)
Q_PROPERTY(QString heightCrop READ get_heightCrop WRITE set_heightCrop RESET reset_heightCrop STORED false)
BR_PROPERTY(QString, widthCrop, QString())
BR_PROPERTY(QString, heightCrop, QString())
void project(const Template &src, Template &dst) const
{
dst = src;
QList<QRectF> rects = src.file.rects();
for (int i=0;i < rects.size(); i++) {
rects[i].setX(rects[i].x() + rects[i].width() * QtUtils::toPoint(widthCrop).x());
rects[i].setY(rects[i].y() + rects[i].height() * QtUtils::toPoint(heightCrop).x());
rects[i].setWidth(rects[i].width() * (1-QtUtils::toPoint(widthCrop).y()));
rects[i].setHeight(rects[i].height() * (1-QtUtils::toPoint(heightCrop).y()));
}
dst.file.setRects(rects);
}
};
BR_REGISTER(Transform, CropRectTransform)
/*!
* \ingroup transforms
* \brief Create matrix from landmarks.
* \author Scott Klum \cite sklum
* \todo Padding should be a percent of total image size
*/
class RectFromPointsTransform : public UntrainableTransform
{
Q_OBJECT
Q_PROPERTY(QList<int> indices READ get_indices WRITE set_indices RESET reset_indices STORED false)
Q_PROPERTY(double padding READ get_padding WRITE set_padding RESET reset_padding STORED false)
Q_PROPERTY(double aspectRatio READ get_aspectRatio WRITE set_aspectRatio RESET reset_aspectRatio STORED false)
Q_PROPERTY(bool crop READ get_crop WRITE set_crop RESET reset_crop STORED false)
BR_PROPERTY(QList<int>, indices, QList<int>())
BR_PROPERTY(double, padding, 0)
BR_PROPERTY(double, aspectRatio, 1.0)
BR_PROPERTY(bool, crop, true)
void project(const Template &src, Template &dst) const
{
if (src.file.points().isEmpty()) {
qWarning("No landmarks");
dst = src;
return;
}
int minX, minY;
minX = minY = std::numeric_limits<int>::max();
int maxX, maxY;
maxX = maxY = -std::numeric_limits<int>::max();
QList<QPointF> points;
foreach(int index, indices) {
if (src.file.points().size() > index) {
if (src.file.points()[index].x() < minX) minX = src.file.points()[index].x();
if (src.file.points()[index].x() > maxX) maxX = src.file.points()[index].x();
if (src.file.points()[index].y() < minY) minY = src.file.points()[index].y();
if (src.file.points()[index].y() > maxY) maxY = src.file.points()[index].y();
points.append(src.file.points()[index]);
}
else qFatal("Incorrect indices");
}
double width = maxX-minX;
double deltaWidth = width*padding;
width += deltaWidth;
double height = maxY-minY;
double deltaHeight = width/aspectRatio - height;
height += deltaHeight;
dst.file.setPoints(points);
if (crop) dst.m() = src.m()(Rect(std::max(0.0, minX - deltaWidth/2.0), std::max(0.0, minY - deltaHeight/2.0), std::min((double)src.m().cols, width), std::min((double)src.m().rows, height)));
else {
dst.file.appendRect(QRectF(std::max(0.0, minX - deltaWidth/2.0), std::max(0.0, minY - deltaHeight/2.0), std::min((double)src.m().cols, width), std::min((double)src.m().rows, height)));
dst.m() = src.m();
}
}
};
BR_REGISTER(Transform, RectFromPointsTransform)
} // namespace br
#include "regions.moc"