10 #include "fft_cufft.h"
13 #include "fft_opencv.h"
21 #define DEBUG_PRINT(obj) \
23 std::cout << #obj << " @" << __LINE__ << std::endl << (obj) << std::endl; \
25 #define DEBUG_PRINTM(obj) \
27 std::cout << #obj << " @" << __LINE__ << " " << (obj).size() << " CH: " << (obj).channels() << std::endl \
28 << (obj) << std::endl; \
32 T clamp(const T& n, const T& lower, const T& upper)
34 return std::max(lower, std::min(n, upper));
38 void clamp2(T& n, const T& lower, const T& upper)
40 n = std::max(lower, std::min(n, upper));
43 KCF_Tracker::KCF_Tracker(double padding, double kernel_sigma, double lambda, double interp_factor,
44 double output_sigma_factor, int cell_size)
45 : fft(*new FFT()), p_padding(padding), p_output_sigma_factor(output_sigma_factor), p_kernel_sigma(kernel_sigma),
46 p_lambda(lambda), p_interp_factor(interp_factor), p_cell_size(cell_size)
50 KCF_Tracker::KCF_Tracker() : fft(*new FFT()) {}
52 KCF_Tracker::~KCF_Tracker()
57 void KCF_Tracker::init(cv::Mat &img, const cv::Rect &bbox, int fit_size_x, int fit_size_y)
59 // check boundary, enforce min size
60 double x1 = bbox.x, x2 = bbox.x + bbox.width, y1 = bbox.y, y2 = bbox.y + bbox.height;
62 if (x2 > img.cols - 1) x2 = img.cols - 1;
64 if (y2 > img.rows - 1) y2 = img.rows - 1;
66 if (x2 - x1 < 2 * p_cell_size) {
67 double diff = (2 * p_cell_size - x2 + x1) / 2.;
68 if (x1 - diff >= 0 && x2 + diff < img.cols) {
71 } else if (x1 - 2 * diff >= 0) {
77 if (y2 - y1 < 2 * p_cell_size) {
78 double diff = (2 * p_cell_size - y2 + y1) / 2.;
79 if (y1 - diff >= 0 && y2 + diff < img.rows) {
82 } else if (y1 - 2 * diff >= 0) {
91 p_pose.cx = x1 + p_pose.w / 2.;
92 p_pose.cy = y1 + p_pose.h / 2.;
94 cv::Mat input_gray, input_rgb = img.clone();
95 if (img.channels() == 3) {
96 cv::cvtColor(img, input_gray, CV_BGR2GRAY);
97 input_gray.convertTo(input_gray, CV_32FC1);
99 img.convertTo(input_gray, CV_32FC1);
101 // don't need too large image
102 if (p_pose.w * p_pose.h > 100. * 100. && (fit_size_x == -1 || fit_size_y == -1)) {
103 std::cout << "resizing image by factor of " << 1 / p_downscale_factor << std::endl;
104 p_resize_image = true;
105 p_pose.scale(p_downscale_factor);
106 cv::resize(input_gray, input_gray, cv::Size(0, 0), p_downscale_factor, p_downscale_factor, cv::INTER_AREA);
107 cv::resize(input_rgb, input_rgb, cv::Size(0, 0), p_downscale_factor, p_downscale_factor, cv::INTER_AREA);
108 } else if (!(fit_size_x == -1 && fit_size_y == -1)) {
109 if (fit_size_x % p_cell_size != 0 || fit_size_y % p_cell_size != 0) {
110 std::cerr << "Error: Fit size is not multiple of HOG cell size (" << p_cell_size << ")" << std::endl;
111 std::exit(EXIT_FAILURE);
113 p_scale_factor_x = (double)fit_size_x / round(p_pose.w * (1. + p_padding));
114 p_scale_factor_y = (double)fit_size_y / round(p_pose.h * (1. + p_padding));
115 std::cout << "resizing image horizontaly by factor of " << p_scale_factor_x << " and verticaly by factor of "
116 << p_scale_factor_y << std::endl;
118 p_pose.scale_x(p_scale_factor_x);
119 p_pose.scale_y(p_scale_factor_y);
120 if (fabs(p_scale_factor_x - 1) > p_floating_error || fabs(p_scale_factor_y - 1) > p_floating_error) {
121 if (p_scale_factor_x < 1 && p_scale_factor_y < 1) {
122 cv::resize(input_gray, input_gray, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_AREA);
123 cv::resize(input_rgb, input_rgb, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_AREA);
125 cv::resize(input_gray, input_gray, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_LINEAR);
126 cv::resize(input_rgb, input_rgb, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_LINEAR);
131 // compute win size + fit to fhog cell size
132 p_windows_size.width = round(p_pose.w * (1. + p_padding) / p_cell_size) * p_cell_size;
133 p_windows_size.height = round(p_pose.h * (1. + p_padding) / p_cell_size) * p_cell_size;
134 p_roi.width = p_windows_size.width / p_cell_size;
135 p_roi.height = p_windows_size.height / p_cell_size;
138 if (m_use_color) p_num_of_feats += 3;
139 if (m_use_cnfeat) p_num_of_feats += 10;
143 for (int i = -int(p_num_scales) / 2; i <= int(p_num_scales) / 2; ++i)
144 p_scales.push_back(std::pow(p_scale_step, i));
146 p_scales.push_back(1.);
149 if (p_roi.height * (p_roi.width / 2 + 1) > 1024) {
150 std::cerr << "Window after forward FFT is too big for CUDA kernels. Plese use -f to set "
151 "the window dimensions so its size is less or equal to "
152 << 1024 * p_cell_size * p_cell_size * 2 + 1
153 << " pixels . Currently the size of the window is: " << p_windows_size.width << "x" << p_windows_size.height
154 << " which is " << p_windows_size.width * p_windows_size.height << " pixels. " << std::endl;
155 std::exit(EXIT_FAILURE);
158 if (m_use_linearkernel) {
159 std::cerr << "cuFFT supports only Gaussian kernel." << std::endl;
160 std::exit(EXIT_FAILURE);
162 CudaSafeCall(cudaSetDeviceFlags(cudaDeviceMapHost));
163 p_rot_labels_data = DynMem(p_roi.width * p_roi.height * sizeof(float));
164 p_rot_labels = cv::Mat(p_roi, CV_32FC1, p_rot_labels_data.hostMem());
166 p_xf.create(p_roi.height, p_roi.height / 2 + 1, p_num_of_feats);
169 #if defined(CUFFT) || defined(FFTW)
170 uint width = p_roi.width / 2 + 1;
172 uint width = p_roi.width;
174 p_model_xf.create(p_roi.height, width, p_num_of_feats);
175 p_yf.create(p_roi.height, width, 1);
176 p_xf.create(p_roi.height, width, p_num_of_feats);
178 int max = BIG_BATCH_MODE ? 2 : p_num_scales;
179 for (int i = 0; i < max; ++i) {
180 if (BIG_BATCH_MODE && i == 1)
181 p_threadctxs.emplace_back(p_roi, p_num_of_feats * p_num_scales, 1, p_num_scales);
183 p_threadctxs.emplace_back(p_roi, p_num_of_feats, p_scales[i], 1);
186 p_current_scale = 1.;
188 double min_size_ratio = std::max(5. * p_cell_size / p_windows_size.width, 5. * p_cell_size / p_windows_size.height);
189 double max_size_ratio =
190 std::min(floor((img.cols + p_windows_size.width / 3) / p_cell_size) * p_cell_size / p_windows_size.width,
191 floor((img.rows + p_windows_size.height / 3) / p_cell_size) * p_cell_size / p_windows_size.height);
192 p_min_max_scale[0] = std::pow(p_scale_step, std::ceil(std::log(min_size_ratio) / log(p_scale_step)));
193 p_min_max_scale[1] = std::pow(p_scale_step, std::floor(std::log(max_size_ratio) / log(p_scale_step)));
195 std::cout << "init: img size " << img.cols << "x" << img.rows << std::endl;
196 std::cout << "init: win size " << p_windows_size.width << "x" << p_windows_size.height << std::endl;
197 std::cout << "init: FFT size " << p_roi.width << "x" << p_roi.height << std::endl;
198 std::cout << "init: min max scales factors: " << p_min_max_scale[0] << " " << p_min_max_scale[1] << std::endl;
200 p_output_sigma = std::sqrt(p_pose.w * p_pose.h) * p_output_sigma_factor / p_cell_size;
202 fft.init(p_roi.width, p_roi.height, p_num_of_feats, p_num_scales);
203 fft.set_window(cosine_window_function(p_roi.width, p_roi.height));
205 // window weights, i.e. labels
207 gaussian_shaped_labels(p_output_sigma, p_roi.width, p_roi.height), p_yf,
208 m_use_cuda ? p_rot_labels_data.deviceMem() : nullptr, p_threadctxs.front().stream);
211 // obtain a sub-window for training initial model
212 std::vector<cv::Mat> patch_feats = get_features(input_rgb, input_gray, p_pose.cx, p_pose.cy,
213 p_windows_size.width, p_windows_size.height);
214 fft.forward_window(patch_feats, p_model_xf, p_threadctxs.front().fw_all,
215 m_use_cuda ? p_threadctxs.front().data_features.deviceMem() : nullptr,
216 p_threadctxs.front().stream);
217 DEBUG_PRINTM(p_model_xf);
218 #if !defined(BIG_BATCH) && defined(CUFFT) && (defined(ASYNC) || defined(OPENMP))
219 p_threadctxs.front().model_xf = p_model_xf;
220 p_threadctxs.front().model_xf.set_stream(p_threadctxs.front().stream);
221 p_yf.set_stream(p_threadctxs.front().stream);
222 p_model_xf.set_stream(p_threadctxs.front().stream);
223 p_xf.set_stream(p_threadctxs.front().stream);
226 if (m_use_linearkernel) {
227 ComplexMat xfconj = p_model_xf.conj();
228 p_model_alphaf_num = xfconj.mul(p_yf);
229 p_model_alphaf_den = (p_model_xf * xfconj);
231 // Kernel Ridge Regression, calculate alphas (in Fourier domain)
232 #if !defined(BIG_BATCH) && defined(CUFFT) && (defined(ASYNC) || defined(OPENMP))
233 gaussian_correlation(p_threadctxs.front(), p_threadctxs.front().model_xf, p_threadctxs.front().model_xf,
234 p_kernel_sigma, true);
236 gaussian_correlation(p_threadctxs.front(), p_model_xf, p_model_xf, p_kernel_sigma, true);
238 DEBUG_PRINTM(p_threadctxs.front().kf);
239 p_model_alphaf_num = p_yf * p_threadctxs.front().kf;
240 DEBUG_PRINTM(p_model_alphaf_num);
241 p_model_alphaf_den = p_threadctxs.front().kf * (p_threadctxs.front().kf + float(p_lambda));
242 DEBUG_PRINTM(p_model_alphaf_den);
244 p_model_alphaf = p_model_alphaf_num / p_model_alphaf_den;
245 DEBUG_PRINTM(p_model_alphaf);
246 // p_model_alphaf = p_yf / (kf + p_lambda); //equation for fast training
248 #if !defined(BIG_BATCH) && defined(CUFFT) && (defined(ASYNC) || defined(OPENMP))
249 for (auto it = p_threadctxs.begin(); it != p_threadctxs.end(); ++it) {
250 it->model_xf = p_model_xf;
251 it->model_xf.set_stream(it->stream);
252 it->model_alphaf = p_model_alphaf;
253 it->model_alphaf.set_stream(it->stream);
258 void KCF_Tracker::setTrackerPose(BBox_c &bbox, cv::Mat &img, int fit_size_x, int fit_size_y)
260 init(img, bbox.get_rect(), fit_size_x, fit_size_y);
263 void KCF_Tracker::updateTrackerPosition(BBox_c &bbox)
265 if (p_resize_image) {
267 tmp.scale(p_downscale_factor);
270 } else if (p_fit_to_pw2) {
272 tmp.scale_x(p_scale_factor_x);
273 tmp.scale_y(p_scale_factor_y);
282 BBox_c KCF_Tracker::getBBox()
285 tmp.w *= p_current_scale;
286 tmp.h *= p_current_scale;
288 if (p_resize_image) tmp.scale(1 / p_downscale_factor);
290 tmp.scale_x(1 / p_scale_factor_x);
291 tmp.scale_y(1 / p_scale_factor_y);
297 double KCF_Tracker::getFilterResponse() const
299 return this->max_response;
302 void KCF_Tracker::track(cv::Mat &img)
304 if (m_debug) std::cout << "NEW FRAME" << '\n';
305 cv::Mat input_gray, input_rgb = img.clone();
306 if (img.channels() == 3) {
307 cv::cvtColor(img, input_gray, CV_BGR2GRAY);
308 input_gray.convertTo(input_gray, CV_32FC1);
310 img.convertTo(input_gray, CV_32FC1);
312 // don't need too large image
313 if (p_resize_image) {
314 cv::resize(input_gray, input_gray, cv::Size(0, 0), p_downscale_factor, p_downscale_factor, cv::INTER_AREA);
315 cv::resize(input_rgb, input_rgb, cv::Size(0, 0), p_downscale_factor, p_downscale_factor, cv::INTER_AREA);
316 } else if (p_fit_to_pw2 && fabs(p_scale_factor_x - 1) > p_floating_error &&
317 fabs(p_scale_factor_y - 1) > p_floating_error) {
318 if (p_scale_factor_x < 1 && p_scale_factor_y < 1) {
319 cv::resize(input_gray, input_gray, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_AREA);
320 cv::resize(input_rgb, input_rgb, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_AREA);
322 cv::resize(input_gray, input_gray, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_LINEAR);
323 cv::resize(input_rgb, input_rgb, cv::Size(0, 0), p_scale_factor_x, p_scale_factor_y, cv::INTER_LINEAR);
328 ThreadCtx *max = nullptr;
329 cv::Point2i *max_response_pt = nullptr;
330 cv::Mat *max_response_map = nullptr;
333 for (auto &it : p_threadctxs)
334 it.async_res = std::async(std::launch::async, [this, &input_gray, &input_rgb, &it]() -> void {
335 scale_track(it, input_rgb, input_gray);
337 for (auto const &it : p_threadctxs)
341 // FIXME: Iterate correctly in big batch mode - perhaps have only one element in the list
342 NORMAL_OMP_PARALLEL_FOR
343 for (uint i = 0; i < p_threadctxs.size(); ++i)
344 scale_track(p_threadctxs[i], input_rgb, input_gray);
348 for (auto &it : p_threadctxs) {
349 if (it.max_response > max_response) {
350 max_response = it.max_response;
351 max_response_pt = &it.max_loc;
352 max_response_map = &it.response;
357 // FIXME: Iterate correctly in big batch mode - perhaps have only one element in the list
358 for (uint j = 0; j < p_scales.size(); ++j) {
359 if (p_threadctxs[0].max_responses[j] > max_response) {
360 max_response = p_threadctxs[0].max_responses[j];
361 max_response_pt = &p_threadctxs[0].max_locs[j];
362 max_response_map = &p_threadctxs[0].response_maps[j];
363 max = &p_threadctxs[0];
368 DEBUG_PRINTM(*max_response_map);
369 DEBUG_PRINT(*max_response_pt);
371 // sub pixel quadratic interpolation from neighbours
372 if (max_response_pt->y > max_response_map->rows / 2) // wrap around to negative half-space of vertical axis
373 max_response_pt->y = max_response_pt->y - max_response_map->rows;
374 if (max_response_pt->x > max_response_map->cols / 2) // same for horizontal axis
375 max_response_pt->x = max_response_pt->x - max_response_map->cols;
377 cv::Point2f new_location(max_response_pt->x, max_response_pt->y);
378 DEBUG_PRINT(new_location);
380 if (m_use_subpixel_localization)
381 new_location = sub_pixel_peak(*max_response_pt, *max_response_map);
382 DEBUG_PRINT(new_location);
384 p_pose.cx += p_current_scale * p_cell_size * double(new_location.x);
385 p_pose.cy += p_current_scale * p_cell_size * double(new_location.y);
387 clamp2(p_pose.cx, 0.0, (img.cols * p_scale_factor_x) - 1);
388 clamp2(p_pose.cy, 0.0, (img.rows * p_scale_factor_y) - 1);
390 clamp2(p_pose.cx, 0.0, img.cols - 1.0);
391 clamp2(p_pose.cy, 0.0, img.rows - 1.0);
394 // sub grid scale interpolation
395 if (m_use_subgrid_scale) {
396 auto it = std::find_if(p_threadctxs.begin(), p_threadctxs.end(), [max](ThreadCtx &ctx) { return &ctx == max; });
397 p_current_scale *= sub_grid_scale(std::distance(p_threadctxs.begin(), it));
399 p_current_scale *= max->scale;
402 clamp2(p_current_scale, p_min_max_scale[0], p_min_max_scale[1]);
404 ThreadCtx &ctx = p_threadctxs.front();
405 // obtain a subwindow for training at newly estimated target position
406 std::vector<cv::Mat> patch_feats = get_features(input_rgb, input_gray, p_pose.cx, p_pose.cy,
407 p_windows_size.width, p_windows_size.height,
409 fft.forward_window(patch_feats, p_xf, ctx.fw_all,
410 m_use_cuda ? ctx.data_features.deviceMem() : nullptr, ctx.stream);
412 // subsequent frames, interpolate model
413 p_model_xf = p_model_xf * float((1. - p_interp_factor)) + p_xf * float(p_interp_factor);
415 ComplexMat alphaf_num, alphaf_den;
417 if (m_use_linearkernel) {
418 ComplexMat xfconj = p_xf.conj();
419 alphaf_num = xfconj.mul(p_yf);
420 alphaf_den = (p_xf * xfconj);
422 // Kernel Ridge Regression, calculate alphas (in Fourier domain)
423 gaussian_correlation(ctx, p_xf, p_xf, p_kernel_sigma,
425 // ComplexMat alphaf = p_yf / (kf + p_lambda); //equation for fast training
426 // p_model_alphaf = p_model_alphaf * (1. - p_interp_factor) + alphaf * p_interp_factor;
427 alphaf_num = p_yf * ctx.kf;
428 alphaf_den = ctx.kf * (ctx.kf + float(p_lambda));
431 p_model_alphaf_num = p_model_alphaf_num * float((1. - p_interp_factor)) + alphaf_num * float(p_interp_factor);
432 p_model_alphaf_den = p_model_alphaf_den * float((1. - p_interp_factor)) + alphaf_den * float(p_interp_factor);
433 p_model_alphaf = p_model_alphaf_num / p_model_alphaf_den;
435 #if !defined(BIG_BATCH) && defined(CUFFT) && (defined(ASYNC) || defined(OPENMP))
436 for (auto it = p_threadctxs.begin(); it != p_threadctxs.end(); ++it) {
437 it->model_xf = p_model_xf;
438 it->model_xf.set_stream(it->stream);
439 it->model_alphaf = p_model_alphaf;
440 it->model_alphaf.set_stream(it->stream);
445 void KCF_Tracker::scale_track(ThreadCtx &vars, cv::Mat &input_rgb, cv::Mat &input_gray)
447 std::vector<cv::Mat> patch_feats;
448 if (BIG_BATCH_MODE) {
449 BIG_BATCH_OMP_PARALLEL_FOR
450 for (uint i = 0; i < p_num_scales; ++i) {
451 patch_feats = get_features(input_rgb, input_gray, this->p_pose.cx, this->p_pose.cy,
452 this->p_windows_size.width, this->p_windows_size.height,
453 this->p_current_scale * this->p_scales[i]);
456 patch_feats = get_features(input_rgb, input_gray, this->p_pose.cx, this->p_pose.cy,
457 this->p_windows_size.width, this->p_windows_size.height,
458 this->p_current_scale * vars.scale);
461 fft.forward_window(patch_feats, vars.zf, vars.fw_all, m_use_cuda ? vars.data_features.deviceMem() : nullptr,
463 DEBUG_PRINTM(vars.zf);
465 if (m_use_linearkernel) {
466 vars.kzf = BIG_BATCH_MODE ? (vars.zf.mul2(this->p_model_alphaf)).sum_over_channels()
467 : (p_model_alphaf * vars.zf).sum_over_channels();
468 fft.inverse(vars.kzf, vars.response, m_use_cuda ? vars.data_i_1ch.deviceMem() : nullptr, vars.stream);
470 #if !defined(BIG_BATCH) && defined(CUFFT) && (defined(ASYNC) || defined(OPENMP))
471 gaussian_correlation(vars, vars.zf, vars.model_xf, this->p_kernel_sigma);
472 vars.kzf = vars.model_alphaf * vars.kzf;
474 gaussian_correlation(vars, vars.zf, this->p_model_xf, this->p_kernel_sigma);
475 DEBUG_PRINTM(this->p_model_alphaf);
476 DEBUG_PRINTM(vars.kzf);
477 vars.kzf = BIG_BATCH_MODE ? vars.kzf.mul(this->p_model_alphaf) : this->p_model_alphaf * vars.kzf;
479 fft.inverse(vars.kzf, vars.response, m_use_cuda ? vars.data_i_1ch.deviceMem() : nullptr, vars.stream);
482 DEBUG_PRINTM(vars.response);
484 /* target location is at the maximum response. we must take into
485 account the fact that, if the target doesn't move, the peak
486 will appear at the top-left corner, not at the center (this is
487 discussed in the paper). the responses wrap around cyclically. */
488 if (BIG_BATCH_MODE) {
489 cv::split(vars.response, vars.response_maps);
491 for (size_t i = 0; i < p_scales.size(); ++i) {
492 double min_val, max_val;
493 cv::Point2i min_loc, max_loc;
494 cv::minMaxLoc(vars.response_maps[i], &min_val, &max_val, &min_loc, &max_loc);
495 DEBUG_PRINT(max_loc);
496 double weight = p_scales[i] < 1. ? p_scales[i] : 1. / p_scales[i];
497 vars.max_responses[i] = max_val * weight;
498 vars.max_locs[i] = max_loc;
503 cv::minMaxLoc(vars.response, &min_val, &vars.max_val, &min_loc, &vars.max_loc);
505 DEBUG_PRINT(vars.max_loc);
507 double weight = vars.scale < 1. ? vars.scale : 1. / vars.scale;
508 vars.max_response = vars.max_val * weight;
513 // ****************************************************************************
515 std::vector<cv::Mat> KCF_Tracker::get_features(cv::Mat & input_rgb, cv::Mat & input_gray, int cx, int cy, int size_x, int size_y, double scale)
517 int size_x_scaled = floor(size_x * scale);
518 int size_y_scaled = floor(size_y * scale);
520 cv::Mat patch_gray = get_subwindow(input_gray, cx, cy, size_x_scaled, size_y_scaled);
521 cv::Mat patch_rgb = get_subwindow(input_rgb, cx, cy, size_x_scaled, size_y_scaled);
523 // resize to default size
525 // if we downsample use INTER_AREA interpolation
526 cv::resize(patch_gray, patch_gray, cv::Size(size_x, size_y), 0., 0., cv::INTER_AREA);
528 cv::resize(patch_gray, patch_gray, cv::Size(size_x, size_y), 0., 0., cv::INTER_LINEAR);
531 // get hog(Histogram of Oriented Gradients) features
532 std::vector<cv::Mat> hog_feat = FHoG::extract(patch_gray, 2, p_cell_size, 9);
534 // get color rgb features (simple r,g,b channels)
535 std::vector<cv::Mat> color_feat;
536 if ((m_use_color || m_use_cnfeat) && input_rgb.channels() == 3) {
537 // resize to default size
539 // if we downsample use INTER_AREA interpolation
540 cv::resize(patch_rgb, patch_rgb, cv::Size(size_x / p_cell_size, size_y / p_cell_size), 0., 0., cv::INTER_AREA);
542 cv::resize(patch_rgb, patch_rgb, cv::Size(size_x / p_cell_size, size_y / p_cell_size), 0., 0., cv::INTER_LINEAR);
546 if (m_use_color && input_rgb.channels() == 3) {
547 // use rgb color space
548 cv::Mat patch_rgb_norm;
549 patch_rgb.convertTo(patch_rgb_norm, CV_32F, 1. / 255., -0.5);
550 cv::Mat ch1(patch_rgb_norm.size(), CV_32FC1);
551 cv::Mat ch2(patch_rgb_norm.size(), CV_32FC1);
552 cv::Mat ch3(patch_rgb_norm.size(), CV_32FC1);
553 std::vector<cv::Mat> rgb = {ch1, ch2, ch3};
554 cv::split(patch_rgb_norm, rgb);
555 color_feat.insert(color_feat.end(), rgb.begin(), rgb.end());
558 if (m_use_cnfeat && input_rgb.channels() == 3) {
559 std::vector<cv::Mat> cn_feat = CNFeat::extract(patch_rgb);
560 color_feat.insert(color_feat.end(), cn_feat.begin(), cn_feat.end());
563 hog_feat.insert(hog_feat.end(), color_feat.begin(), color_feat.end());
567 cv::Mat KCF_Tracker::gaussian_shaped_labels(double sigma, int dim1, int dim2)
569 cv::Mat labels(dim2, dim1, CV_32FC1);
570 int range_y[2] = {-dim2 / 2, dim2 - dim2 / 2};
571 int range_x[2] = {-dim1 / 2, dim1 - dim1 / 2};
573 double sigma_s = sigma * sigma;
575 for (int y = range_y[0], j = 0; y < range_y[1]; ++y, ++j) {
576 float *row_ptr = labels.ptr<float>(j);
578 for (int x = range_x[0], i = 0; x < range_x[1]; ++x, ++i) {
579 row_ptr[i] = std::exp(-0.5 * (y_s + x * x) / sigma_s); //-1/2*e^((y^2+x^2)/sigma^2)
583 // rotate so that 1 is at top-left corner (see KCF paper for explanation)
585 cv::Mat tmp = circshift(labels, range_x[0], range_y[0]);
586 tmp.copyTo(p_rot_labels);
588 assert(p_rot_labels.at<float>(0, 0) >= 1.f - 1e-10f);
591 cv::Mat rot_labels = circshift(labels, range_x[0], range_y[0]);
592 // sanity check, 1 at top left corner
593 assert(rot_labels.at<float>(0, 0) >= 1.f - 1e-10f);
599 cv::Mat KCF_Tracker::circshift(const cv::Mat &patch, int x_rot, int y_rot)
601 cv::Mat rot_patch(patch.size(), CV_32FC1);
602 cv::Mat tmp_x_rot(patch.size(), CV_32FC1);
604 // circular rotate x-axis
606 // move part that does not rotate over the edge
607 cv::Range orig_range(-x_rot, patch.cols);
608 cv::Range rot_range(0, patch.cols - (-x_rot));
609 patch(cv::Range::all(), orig_range).copyTo(tmp_x_rot(cv::Range::all(), rot_range));
612 orig_range = cv::Range(0, -x_rot);
613 rot_range = cv::Range(patch.cols - (-x_rot), patch.cols);
614 patch(cv::Range::all(), orig_range).copyTo(tmp_x_rot(cv::Range::all(), rot_range));
615 } else if (x_rot > 0) {
616 // move part that does not rotate over the edge
617 cv::Range orig_range(0, patch.cols - x_rot);
618 cv::Range rot_range(x_rot, patch.cols);
619 patch(cv::Range::all(), orig_range).copyTo(tmp_x_rot(cv::Range::all(), rot_range));
622 orig_range = cv::Range(patch.cols - x_rot, patch.cols);
623 rot_range = cv::Range(0, x_rot);
624 patch(cv::Range::all(), orig_range).copyTo(tmp_x_rot(cv::Range::all(), rot_range));
625 } else { // zero rotation
626 // move part that does not rotate over the edge
627 cv::Range orig_range(0, patch.cols);
628 cv::Range rot_range(0, patch.cols);
629 patch(cv::Range::all(), orig_range).copyTo(tmp_x_rot(cv::Range::all(), rot_range));
632 // circular rotate y-axis
634 // move part that does not rotate over the edge
635 cv::Range orig_range(-y_rot, patch.rows);
636 cv::Range rot_range(0, patch.rows - (-y_rot));
637 tmp_x_rot(orig_range, cv::Range::all()).copyTo(rot_patch(rot_range, cv::Range::all()));
640 orig_range = cv::Range(0, -y_rot);
641 rot_range = cv::Range(patch.rows - (-y_rot), patch.rows);
642 tmp_x_rot(orig_range, cv::Range::all()).copyTo(rot_patch(rot_range, cv::Range::all()));
643 } else if (y_rot > 0) {
644 // move part that does not rotate over the edge
645 cv::Range orig_range(0, patch.rows - y_rot);
646 cv::Range rot_range(y_rot, patch.rows);
647 tmp_x_rot(orig_range, cv::Range::all()).copyTo(rot_patch(rot_range, cv::Range::all()));
650 orig_range = cv::Range(patch.rows - y_rot, patch.rows);
651 rot_range = cv::Range(0, y_rot);
652 tmp_x_rot(orig_range, cv::Range::all()).copyTo(rot_patch(rot_range, cv::Range::all()));
653 } else { // zero rotation
654 // move part that does not rotate over the edge
655 cv::Range orig_range(0, patch.rows);
656 cv::Range rot_range(0, patch.rows);
657 tmp_x_rot(orig_range, cv::Range::all()).copyTo(rot_patch(rot_range, cv::Range::all()));
663 // hann window actually (Power-of-cosine windows)
664 cv::Mat KCF_Tracker::cosine_window_function(int dim1, int dim2)
666 cv::Mat m1(1, dim1, CV_32FC1), m2(dim2, 1, CV_32FC1);
667 double N_inv = 1. / (static_cast<double>(dim1) - 1.);
668 for (int i = 0; i < dim1; ++i)
669 m1.at<float>(i) = float(0.5 * (1. - std::cos(2. * CV_PI * static_cast<double>(i) * N_inv)));
670 N_inv = 1. / (static_cast<double>(dim2) - 1.);
671 for (int i = 0; i < dim2; ++i)
672 m2.at<float>(i) = float(0.5 * (1. - std::cos(2. * CV_PI * static_cast<double>(i) * N_inv)));
673 cv::Mat ret = m2 * m1;
677 // Returns sub-window of image input centered at [cx, cy] coordinates),
678 // with size [width, height]. If any pixels are outside of the image,
679 // they will replicate the values at the borders.
680 cv::Mat KCF_Tracker::get_subwindow(const cv::Mat &input, int cx, int cy, int width, int height)
684 int x1 = cx - width / 2;
685 int y1 = cy - height / 2;
686 int x2 = cx + width / 2;
687 int y2 = cy + height / 2;
690 if (x1 >= input.cols || y1 >= input.rows || x2 < 0 || y2 < 0) {
691 patch.create(height, width, input.type());
692 patch.setTo(double(0.f));
696 int top = 0, bottom = 0, left = 0, right = 0;
698 // fit to image coordinates, set border extensions;
707 if (x2 >= input.cols) {
708 right = x2 - input.cols + width % 2;
713 if (y2 >= input.rows) {
714 bottom = y2 - input.rows + height % 2;
719 if (x2 - x1 == 0 || y2 - y1 == 0)
720 patch = cv::Mat::zeros(height, width, CV_32FC1);
722 cv::copyMakeBorder(input(cv::Range(y1, y2), cv::Range(x1, x2)), patch, top, bottom, left, right,
723 cv::BORDER_REPLICATE);
724 // imshow( "copyMakeBorder", patch);
729 assert(patch.cols == width && patch.rows == height);
734 void KCF_Tracker::gaussian_correlation(struct ThreadCtx &vars, const ComplexMat &xf, const ComplexMat &yf,
735 double sigma, bool auto_correlation)
737 xf.sqr_norm(vars.xf_sqr_norm);
738 if (auto_correlation) {
739 vars.yf_sqr_norm.hostMem()[0] = vars.xf_sqr_norm.hostMem()[0];
741 yf.sqr_norm(vars.yf_sqr_norm);
743 vars.xyf = auto_correlation ? xf.sqr_mag() : xf.mul2(yf.conj());
744 DEBUG_PRINTM(vars.xyf);
745 fft.inverse(vars.xyf, vars.ifft2_res, m_use_cuda ? vars.data_i_features.deviceMem() : nullptr, vars.stream);
747 cuda_gaussian_correlation(vars.data_i_features.deviceMem(), vars.gauss_corr_res.deviceMem(),
748 vars.xf_sqr_norm.deviceMem(), vars.xf_sqr_norm.deviceMem(), sigma, xf.n_channels,
749 xf.n_scales, p_roi.height, p_roi.width, vars.stream);
751 // ifft2 and sum over 3rd dimension, we dont care about individual channels
752 DEBUG_PRINTM(vars.ifft2_res);
754 if (xf.channels() != p_num_scales * p_num_of_feats)
755 xy_sum.create(vars.ifft2_res.size(), CV_32FC1);
757 xy_sum.create(vars.ifft2_res.size(), CV_32FC(p_scales.size()));
759 for (int y = 0; y < vars.ifft2_res.rows; ++y) {
760 float *row_ptr = vars.ifft2_res.ptr<float>(y);
761 float *row_ptr_sum = xy_sum.ptr<float>(y);
762 for (int x = 0; x < vars.ifft2_res.cols; ++x) {
763 for (int sum_ch = 0; sum_ch < xy_sum.channels(); ++sum_ch) {
764 row_ptr_sum[(x * xy_sum.channels()) + sum_ch] += std::accumulate(
765 row_ptr + x * vars.ifft2_res.channels() + sum_ch * (vars.ifft2_res.channels() / xy_sum.channels()),
766 (row_ptr + x * vars.ifft2_res.channels() +
767 (sum_ch + 1) * (vars.ifft2_res.channels() / xy_sum.channels())),
772 DEBUG_PRINTM(xy_sum);
774 std::vector<cv::Mat> scales;
775 cv::split(xy_sum, scales);
777 float numel_xf_inv = 1.f / (xf.cols * xf.rows * (xf.channels() / xf.n_scales));
778 for (uint i = 0; i < xf.n_scales; ++i) {
779 cv::Mat in_roi(vars.in_all, cv::Rect(0, i * scales[0].rows, scales[0].cols, scales[0].rows));
781 -1. / (sigma * sigma) *
782 cv::max((double(vars.xf_sqr_norm.hostMem()[i] + vars.yf_sqr_norm.hostMem()[0]) - 2 * scales[i]) * double(numel_xf_inv), 0),
784 DEBUG_PRINTM(in_roi);
787 DEBUG_PRINTM(vars.in_all);
788 fft.forward(vars.in_all, auto_correlation ? vars.kf : vars.kzf, m_use_cuda ? vars.gauss_corr_res.deviceMem() : nullptr,
793 float get_response_circular(cv::Point2i &pt, cv::Mat &response)
797 if (x < 0) x = response.cols + x;
798 if (y < 0) y = response.rows + y;
799 if (x >= response.cols) x = x - response.cols;
800 if (y >= response.rows) y = y - response.rows;
802 return response.at<float>(y, x);
805 cv::Point2f KCF_Tracker::sub_pixel_peak(cv::Point &max_loc, cv::Mat &response)
807 // find neighbourhood of max_loc (response is circular)
811 cv::Point2i p1(max_loc.x - 1, max_loc.y - 1), p2(max_loc.x, max_loc.y - 1), p3(max_loc.x + 1, max_loc.y - 1);
812 cv::Point2i p4(max_loc.x - 1, max_loc.y), p5(max_loc.x + 1, max_loc.y);
813 cv::Point2i p6(max_loc.x - 1, max_loc.y + 1), p7(max_loc.x, max_loc.y + 1), p8(max_loc.x + 1, max_loc.y + 1);
816 // fit 2d quadratic function f(x, y) = a*x^2 + b*x*y + c*y^2 + d*x + e*y + f
817 cv::Mat A = (cv::Mat_<float>(9, 6) <<
818 p1.x*p1.x, p1.x*p1.y, p1.y*p1.y, p1.x, p1.y, 1.f,
819 p2.x*p2.x, p2.x*p2.y, p2.y*p2.y, p2.x, p2.y, 1.f,
820 p3.x*p3.x, p3.x*p3.y, p3.y*p3.y, p3.x, p3.y, 1.f,
821 p4.x*p4.x, p4.x*p4.y, p4.y*p4.y, p4.x, p4.y, 1.f,
822 p5.x*p5.x, p5.x*p5.y, p5.y*p5.y, p5.x, p5.y, 1.f,
823 p6.x*p6.x, p6.x*p6.y, p6.y*p6.y, p6.x, p6.y, 1.f,
824 p7.x*p7.x, p7.x*p7.y, p7.y*p7.y, p7.x, p7.y, 1.f,
825 p8.x*p8.x, p8.x*p8.y, p8.y*p8.y, p8.x, p8.y, 1.f,
826 max_loc.x*max_loc.x, max_loc.x*max_loc.y, max_loc.y*max_loc.y, max_loc.x, max_loc.y, 1.f);
827 cv::Mat fval = (cv::Mat_<float>(9, 1) <<
828 get_response_circular(p1, response),
829 get_response_circular(p2, response),
830 get_response_circular(p3, response),
831 get_response_circular(p4, response),
832 get_response_circular(p5, response),
833 get_response_circular(p6, response),
834 get_response_circular(p7, response),
835 get_response_circular(p8, response),
836 get_response_circular(max_loc, response));
839 cv::solve(A, fval, x, cv::DECOMP_SVD);
841 float a = x.at<float>(0), b = x.at<float>(1), c = x.at<float>(2), d = x.at<float>(3), e = x.at<float>(4);
843 cv::Point2f sub_peak(max_loc.x, max_loc.y);
844 if (b > 0 || b < 0) {
845 sub_peak.y = ((2.f * a * e) / b - d) / (b - (4 * a * c) / b);
846 sub_peak.x = (-2 * c * sub_peak.y - e) / b;
852 double KCF_Tracker::sub_grid_scale(uint index)
855 if (index >= p_scales.size()) {
856 // interpolate from all values
857 // fit 1d quadratic function f(x) = a*x^2 + b*x + c
858 A.create(p_scales.size(), 3, CV_32FC1);
859 fval.create(p_scales.size(), 1, CV_32FC1);
860 for (size_t i = 0; i < p_scales.size(); ++i) {
861 A.at<float>(i, 0) = float(p_scales[i] * p_scales[i]);
862 A.at<float>(i, 1) = float(p_scales[i]);
863 A.at<float>(i, 2) = 1;
864 fval.at<float>(i) = BIG_BATCH_MODE ? p_threadctxs.back().max_responses[i] : p_threadctxs[i].max_response;
867 // only from neighbours
868 if (index == 0 || index == p_scales.size() - 1)
869 return p_scales[index];
871 A = (cv::Mat_<float>(3, 3) <<
872 p_scales[index - 1] * p_scales[index - 1], p_scales[index - 1], 1,
873 p_scales[index + 0] * p_scales[index + 0], p_scales[index + 0], 1,
874 p_scales[index + 1] * p_scales[index + 1], p_scales[index + 1], 1);
875 fval = (cv::Mat_<float>(3, 1) <<
876 (BIG_BATCH_MODE ? p_threadctxs.back().max_responses[index - 1] : p_threadctxs[index - 1].max_response),
877 (BIG_BATCH_MODE ? p_threadctxs.back().max_responses[index + 0] : p_threadctxs[index + 0].max_response),
878 (BIG_BATCH_MODE ? p_threadctxs.back().max_responses[index + 1] : p_threadctxs[index + 1].max_response));
882 cv::solve(A, fval, x, cv::DECOMP_SVD);
883 float a = x.at<float>(0), b = x.at<float>(1);
884 double scale = p_scales[index];
886 scale = -b / (2 * a);