| Literature DB >> 35505902 |
Liping Zhu1,2, Bingyao Wang1,2, Yihan Yan3, Shuang Guo4, Gangyi Tian1,2.
Abstract
With the rapidly increasing of automobiles, traffic accidents are gradually becoming more frequent. This creates a great need for effective traffic anomaly detection algorithms. Existing methods shed light on directly inferring the abnormalities from traffic flow, which is short in features extraction and representation of traffic flows. In this paper, we propose three new traffic flow features, namely the road congestion, the traffic intensity, and the traffic state instability, for more comprehensive traffic status representation and anomaly detection. Residual analysis, quadratic discrimination, multi-resolution wavelet analysis are integrated for the extraction of the aforementioned features, which will be applied for the downstream tasks of traffic anomaly detection. Experimental results reveal that accident identification based on the proposed features is more effective than the raw traffic flow, which is supposed to provide an alternative approach for further applications and studies.Entities:
Keywords: Feature extraction; Machine learning; Traffic accident detection; Traffic flow features
Year: 2022 PMID: 35505902 PMCID: PMC9048618 DOI: 10.1007/s11760-022-02233-z
Source DB: PubMed Journal: Signal Image Video Process ISSN: 1863-1703 Impact factor: 1.583
Fig. 1A visual statement of the vehicle collision accident, the normal condition (top) vs abnormal condition (bottom) after accident
Fig. 2Flowchart of traffic accident detection with the proposed feature extraction method
Fig. 3Scatter plot of the traffic flow data
Fig. 4Histogram of and for partial detectors
Kolmogorov–Smirnov normality test result of D occ and D speed for partial detectors
| Detector | The normal confidence coefficient of | The normal confidence coefficient of |
|---|---|---|
| S400027 | 0.656 | 0.683 |
| S400430 | 0.772 | 0.705 |
| S401895 | 0.719 | 0.715 |
| S400770 | 0.703 | 0.658 |
| S401195 | 0.801 | 0.794 |
| S401892 | 0.693 | 0.644 |
| S408632 | 0.614 | 0.696 |
| S401269 | 0.678 | 0.712 |
Fig. 5Flowchart for negative sample collection workflow
Features based on the mean of upstream and downstream states
| Traffic flow data | A | B | C | D |
|---|---|---|---|---|
| flow | FLOW.MBF1 | FLOW.MAF1 | FLOW.MBF2 | FLOW.MAF2 |
| occupancy | OCC.MBF1 | OCC.MAF1 | OCC.MBF2 | OCC.MAF2 |
| speed | SPEED.MBF1 | SPEED.MAF1 | SPEED.MBF2 | SPEED.MAF2 |
|
| MORE.MBF1 | MORE.MAF1 | MORE.MBF2 | MORE.MAF2 |
|
| LESS.MBF1 | LESS.MAF1 | LESS.MBF2 | LESS.MAF2 |
| congestion | SATU.MBF1 | SATU.MAF1 | SATU.MBF2 | SATU.MAF2 |
| flt.flow | FLT.FLOW.MBF1 | FLT.FLOW.MAF1 | FLT.FLOW.MBF2 | FLT.FLOW.MAF2 |
| flt.occ | FLT.OCC.MBF1 | FLT.OCC.MAF1 | FLT.OCC.MBF2 | FLT.OCC.MAF2 |
| flt.speed | FLT.SPEED.MBF1 | FLT.SPEED.MAF1 | FLT.SPEED.MBF2 | FLT.SPEED.MAF2 |
| act.flow | ACT.FLOW.MBF1 | ACT.FLOW.MAF1 | ACT.FLOW.MBF2 | ACT.FLOW.MAF2 |
| act.occ | ACT.OCC.MBF1 | ACT.OCC.MAF1 | ACT.OCC.MBF2 | ACT.OCC.MAF2 |
| act.speed | ACT.SPEED.MBF1 | ACT.SPEED.MAF1 | ACT.SPEED.MBF2 | ACT.SPEED.MAF2 |
A: Mean value of the upstream detector before accidents occur. B: Mean value of the upstream detector after accidents occur. C: Mean value of the downstream detector before accidents occur. D: Mean value of the downstream detector after accidents occur.
Features based on generalized California algorithm
| Traffic flow data | R1 | R2 | R3 |
|---|---|---|---|
| flow | FLOW.CLF1 | FLOW.CLF2 | FLOW.CLF3 |
| occupancy | OCC.CLF1 | OCC.CLF2 | OCC.CLF3 |
| speed | SPEED.CLF1 | SPEED.CLF2 | SPEED.CLF3 |
R1: California algorithm features referred to Eq (13). R2: California algorithm features referred to Eq (14). R3: California algorithm features referred to Eq (15)
The result of hyper-parameter tuning
| algorithm | Optimal parameter | Accuracy estimate |
|---|---|---|
| NNET | size = 1 , decay = 0.1 | 0.888 |
| CSVM | cost = 3.0, sigma = 0.2 | 0.886 |
| CART | maxdepth = 15, minsplit = 20 | 0.901 |
| CRF | ntry= 7, minsplit = 3 |
The best results are highlighted in bold
Performances of Candidate Algorithms
| Algorithm | Accuracy | Precision | Recall Rate |
|---|---|---|---|
| LDA | 0.858 | 0.876 | 0.452 |
| QDA | 0.873 | 0.894 | 0.540 |
| NNET | 0.889 | 0.888 | 0.496 |
| CSVM | 0.885 | 0.883 | 0.472 |
| CART | 0.904 | 0.912 | 0.618 |
| CRF |
The best results are highlighted in bold
Detection Performances of Compared Algorithms
| Algorithm | Accuracy | Precision | Recall Rate |
|---|---|---|---|
|
|
|
|
|
|
| 0.604 | 0.622 | 0.602 |
|
|
|
|
|
|
| 0.601 | 0.607 | 0.617 |
|
|
|
|
|
|
| 0.750 | 0.741 | 0.488 |
|
|
|
| 0.657 |
|
| 0.850 | 0.844 |
|
|
|
|
|
|
|
| 0.867 | 0.865 | 0.688 |
The best results in each pair are highlighted in bold