2011
DOI: 10.1109/lsp.2011.2146772
|View full text |Cite
|
Sign up to set email alerts
|

Complexity Reduced Face Detection Using Probability-Based Face Mask Prefiltering and Pixel-Based Hierarchical-Feature Adaboosting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 7 publications
0
13
0
Order By: Relevance
“…However, the practical training time is approximately 1,500 times that of the PBH features. The reason is that the large number of Haar-like features causes data swapping between the memory and the hard drive, whereas that of the proposed PBH features can be completely stored in the memory, which results in the large difference in the training time [15]. Because the number of features in the proposed system only added four crucial JEER features to the PBH features, its training time is slightly longer than that of the hybrid Adaboost-based face detection system but is significantly shorter than that of the traditional Adaboost face detection system.…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…However, the practical training time is approximately 1,500 times that of the PBH features. The reason is that the large number of Haar-like features causes data swapping between the memory and the hard drive, whereas that of the proposed PBH features can be completely stored in the memory, which results in the large difference in the training time [15]. Because the number of features in the proposed system only added four crucial JEER features to the PBH features, its training time is slightly longer than that of the hybrid Adaboost-based face detection system but is significantly shorter than that of the traditional Adaboost face detection system.…”
Section: Resultsmentioning
confidence: 99%
“…Thereafter, the integral image uses seven operations to add the feature values for the weak classifier when the weak classifier is a two-rectangle feature, which entails the least number of operations. Therefore, the best scenario for the integral image to sum up the feature values of the K weak classifiers is 7 × K [15]. The lower part of Table 2 shows that the best scenario is 3 × N × N + 7 × K = 3 × 24 × 24 + 7 × 17 = 1,847 when all 17 weak classifiers are two-rectangle features.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations