2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC) 2019
DOI: 10.1109/icnsc.2019.8743246
|View full text |Cite
|
Sign up to set email alerts
|

Helmet Detection Based On Improved YOLO V3 Deep Model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(21 citation statements)
references
References 11 publications
0
20
0
1
Order By: Relevance
“…YOLO (You Look Once), algorithm proposed by RedMon and Grishick [52], has the ability to detect objects by regression and location exclusion and classification of the object from one end to the other by a single parsing. This makes it position itself at the top for speed algorithms, but with a low degree of accuracy in the case of small objects and an error rate in the case of pedestrian scenes with a high degree of complexity [53,54].…”
Section: Description Pedestrian Setup and Practical Scenariosmentioning
confidence: 99%
“…YOLO (You Look Once), algorithm proposed by RedMon and Grishick [52], has the ability to detect objects by regression and location exclusion and classification of the object from one end to the other by a single parsing. This makes it position itself at the top for speed algorithms, but with a low degree of accuracy in the case of small objects and an error rate in the case of pedestrian scenes with a high degree of complexity [53,54].…”
Section: Description Pedestrian Setup and Practical Scenariosmentioning
confidence: 99%
“…It can be seen from Tables 6 and 7 that the tracker algorithm is computationally heavier than all other components in the system. The UKF algorithm consists of many approximations and iterations, because of which it is expected to be computationally heavy [49][50][51][52][53].…”
Section: Frame Rate For the Execution Of Ebamentioning
confidence: 99%
“…It can be seen from Table 6 and Table 7 that the tracker algorithm is computationally heavier than all other components in the system. The UKF algorithm consists of many approximations and iterations, because of which it is expected to be computationally heavy [ 49 , 50 , 51 , 52 , 53 ]. Other alternatives, such as the extended Kalman filter, might be computationally lighter but are prone to more errors [ 54 ].…”
Section: Emergency Brake Assist (Eba) Using Ocsf and Odsfmentioning
confidence: 99%
“…Each grid outputs B bounding prediction boxes, including bounding box location data that consist of coordinates of the middle point (x, y), width (w), height (h), and confidence prediction. The Yolo loss function of the boundary box consists of four sections [37], and the formula could be seen on Equation (1) [38][39][40].…”
Section: Traffic Sign Recognition With You Only Look Once (Yolo) V3mentioning
confidence: 99%
“…(2) The Yolo loss function of the boundary box consists of four sections [37], and the formula could be seen on Equation (1) [38][39][40].…”
Section: Traffic Sign Recognition With You Only Look Once (Yolo) V3mentioning
confidence: 99%