forked from HPCL/pedestrian-counting
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtrackers.cpp
93 lines (75 loc) · 2.99 KB
/
trackers.cpp
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
/* trackers.cpp
* a class that defines tracking functions for the pedestrian couter
* note that all methods in this class will be static
* Brian J Gravelle
* ix.cs.uoregon.edu/~gravelle
* Apparently this is something I'm supposed to do:
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
* If by some miracle you find this software useful, thanks are accepted in
* the form of chocolate or introductions to potential employers.
*/
#include "trackers.h"
double Trackers::max_dist_sqd = 1000;
char Trackers::algo = 'D';
Object* Trackers::find_previous_object(vector<Object> &old_objs, Object &curr_obj) {
switch(algo) {
case 'O':
return find_previous_object_overlap(old_objs, curr_obj);
break;
case 'D':
default:
return find_previous_object_dist(old_objs, curr_obj);
}
return NULL;
}
Object* Trackers::find_previous_object_dist(vector<Object> &old_objs, Object &curr_obj) {
double dist, min_dist = -1.0;
Object *prev_obj = NULL;
for(vector<Object>::iterator it_old_obj = old_objs.begin(); it_old_obj != old_objs.end(); it_old_obj++) {
dist = it_old_obj->find_distance_sqd(curr_obj);
if( (dist <= max_dist_sqd) && ((min_dist < 0) || (dist < min_dist)) ) {
min_dist = dist;
prev_obj = &(*it_old_obj);
}
}
return prev_obj;
}
Object* Trackers::find_previous_object_overlap(vector<Object> &old_objs, Object &curr_obj) {
double area, max_area = 0.0;
Object *prev_obj = NULL;
for(vector<Object>::iterator it_old_obj = old_objs.begin(); it_old_obj != old_objs.end(); it_old_obj++) {
area = it_old_obj->find_overlap_area(curr_obj);
if( area > max_area ) {
max_area = area;
prev_obj = &(*it_old_obj);
}
}
return prev_obj;
}
char Trackers::get_algo(){
return algo;
}
void Trackers::set_algo(char new_algo){
algo = new_algo;
}
double Trackers::get_max_dist_sqd(){
return max_dist_sqd;
}
void Trackers::set_max_dist_sqd(double new_max_dist_sqd){
max_dist_sqd = new_max_dist_sqd;
}