144cd8c4
 Hu Chunming
v6.0.0 替换模型
|
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
|
#pragma once
#include <vector>
#include <algorithm>
#include "../CD.h"
#include "KalmanBoxTracker.h"
#include "tempTrafficStatisticsHeader.h"
#include "../header.h"
using namespace std;
enum StatisticsMethod
{
LINE_RECT_INTERSECTION,
LINE_LINE_INTERSECTION,
LINE_AND_RECT_INTERSECTION
};
struct POINT
{
int x;
int y;
POINT(int mx, int my){ x = mx; y = my; }
};
class TrafficStatistics
{
public:
TrafficStatistics(StatisticsMethod method);
~TrafficStatistics();
void SetLineArray(VPT_Line *m_line, int m_linecount);
void GetTrafficArray(CD_ObjInfo *result, int resSize, vector<KalmanBoxTracker> &trackers, vector <VPT_TrafficResult> &trafficArray);
void LineRectMethod(CD_ObjInfo *result, vector<KalmanBoxTracker> &trackers, int resSize, vector <VPT_TrafficResult> &trafficArray);
void LineLineMethod(CD_ObjInfo *result, vector<KalmanBoxTracker> &trackers, int resSize, vector <VPT_TrafficResult> &trafficArray);
void LineAndRectMethod(CD_ObjInfo *result, vector<KalmanBoxTracker> &trackers, int resSize, vector <VPT_TrafficResult> &trafficArray);
//辅助判断函数
bool line_line_intersection(POINT aa, POINT bb, POINT cc, POINT dd); //判断两个线条是否相交 暂时未用到
bool line_rect_intersection(POINT start_p, POINT end_p, int left, int top, int right, int bottom); //判断矩形框与线条是否相交
private:
StatisticsMethod statisticsMethod;
vector <VPT_Line> lineArray;
int mLineCounter;
};
|
