This repository was archived by the owner on Sep 20, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPTracker.cpp
More file actions
executable file
·155 lines (130 loc) · 3.53 KB
/
Copy pathPTracker.cpp
File metadata and controls
executable file
·155 lines (130 loc) · 3.53 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
#include "stdafx.h"
#include "PTracker.h"
size_t PTrack::NextTrackID=0;
PTrack::PTrack(Point2f p, float dt, float Accel_noise_mag)
{
track_id=NextTrackID;
NextTrackID++;
KF = new kalmanTracker(p,dt,Accel_noise_mag);
predictedPedestrian.center=p;
skipped_frames=0;
}
PTrack::~PTrack()
{
delete KF;
}
PTracker::PTracker(float _dt, float _Accel_noise_mag, double _dist_thres, int _maximum_allowed_skipped_frames,int _max_trace_length)
{
dt=_dt;
Accel_noise_mag=_Accel_noise_mag;
dist_thres=_dist_thres;
maximum_allowed_skipped_frames=_maximum_allowed_skipped_frames;
max_trace_length=_max_trace_length;
agreementTracking = new MAT();
}
/**
Method that updates all teh trackers from detection in every frame
@param img: MAT object of the current frame
@param detectedPedestrians: Vector containing the pedestrians from detector
**/
void PTracker::Update(const Mat img,vector<pedestrian>& detectedPedestrians)
{
if(tracks.size()==0)
{
for(size_t i=0;i<detectedPedestrians.size();i++)
{
PTrack* tr=new PTrack(detectedPedestrians[i].center,dt,Accel_noise_mag);
tracks.push_back(tr);
}
}
int N=tracks.size();
int M=detectedPedestrians.size();
vector< vector<double> > Cost(N,vector<double>(M));
vector<int> assignment;
double dist;
Point2f v;
for(size_t i=0;i<tracks.size();i++)
{
v = tracks[i]->KF->GetCenterVelocity();
for(size_t j=0;j<detectedPedestrians.size();j++)
{
dist = agreementTracking->calculateCost(img,tracks[i]->predictedPedestrian,detectedPedestrians[j],v);
//cout<<"Dist: "<<dist;
Cost[i][j]=dist;
}
//cout<<"\n";
}
AssignmentProblemSolver APS;
APS.Solve(Cost,assignment,AssignmentProblemSolver::optimal);
vector<int> not_assigned_tracks;
for(size_t i=0;i<assignment.size();i++)
{
if(assignment[i]!=-1)
{
if(Cost[i][assignment[i]]>dist_thres)
{
assignment[i]=-1;
not_assigned_tracks.push_back(i);
}
}
else
{
tracks[i]->skipped_frames++;
}
}
for(size_t i=0;i<tracks.size();i++)
{
if(tracks[i]->skipped_frames>(unsigned)maximum_allowed_skipped_frames)
{
delete tracks[i];
tracks.erase(tracks.begin()+i);
assignment.erase(assignment.begin()+i);
i--;
}
}
vector<int> not_assigned_detections;
vector<int>::iterator it;
for(size_t i=0;i<detectedPedestrians.size();i++)
{
it=find(assignment.begin(), assignment.end(), i);
if(it==assignment.end())
{
not_assigned_detections.push_back(i);
}
}
if(not_assigned_detections.size()!=0)
{
for(size_t i=0;i<not_assigned_detections.size();i++)
{
PTrack* tr=new PTrack(detectedPedestrians[not_assigned_detections[i]].center,dt,Accel_noise_mag);
tracks.push_back(tr);
}
}
for(size_t i=0;i<assignment.size();i++)
{
tracks[i]->KF->GetPrediction();
if(assignment[i]!=-1)
{
tracks[i]->skipped_frames=0;
tracks[i]->predictedPedestrian.center=tracks[i]->KF->Update(detectedPedestrians[assignment[i]].center,1);
}
else
{
tracks[i]->predictedPedestrian.center=tracks[i]->KF->Update(Point2f(0,0),0);
}
if(tracks[i]->trace.size()>(unsigned)max_trace_length)
{
tracks[i]->trace.erase(tracks[i]->trace.begin(),tracks[i]->trace.end()-max_trace_length);
}
tracks[i]->trace.push_back(tracks[i]->predictedPedestrian.center);
tracks[i]->KF->LastResult=tracks[i]->predictedPedestrian.center;
}
}
PTracker::~PTracker(void)
{
for(size_t i=0;i<tracks.size();i++)
{
delete tracks[i];
}
tracks.clear();
}