2014
DOI: 10.1016/j.patrec.2014.02.015
|View full text |Cite
|
Sign up to set email alerts
|

An improved Haar-like feature for efficient object detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 51 publications
(18 citation statements)
references
References 23 publications
0
18
0
Order By: Relevance
“…After finishing the round of iteration, to train the following weak classifier [38], the weight of each sample is updated by Equation (9): Dt+1=Dt(xi)Zt×{eαtif yi=ht(xi)eαtotherwise where Zt is a normalization factor which enables Dt+1 to be distributed and calculated by Equation (10): Zt=j=1NDt(xi)…”
Section: Methodsmentioning
confidence: 99%
“…After finishing the round of iteration, to train the following weak classifier [38], the weight of each sample is updated by Equation (9): Dt+1=Dt(xi)Zt×{eαtif yi=ht(xi)eαtotherwise where Zt is a normalization factor which enables Dt+1 to be distributed and calculated by Equation (10): Zt=j=1NDt(xi)…”
Section: Methodsmentioning
confidence: 99%
“…The proposed result outperformed in terms of low false face detection rate, low in-plane rotation error and speed performance. The author in [15] proposed an improved Haarlike feature so called Haar Contrast Feature, which efficiently for object detection under various illuminations with the Haar Wavelet based. The LoG can be represented by Haar Wavelet which proposed by [16].…”
Section: Related Workmentioning
confidence: 99%
“…Since then Haar-like features have been popularly employed for object recognition due to its efficiency in the domain of face detection. It is illumination invariant because the mutual ordinal relationship of different pixel within the region is not affected by the varying illumination conditions (Park & Hwang, 2014). The three types of basis Haarlike features are presented in Fig.…”
Section: 4mentioning
confidence: 99%
“…In which, H(x) and h t (x) denote the function of strong classifier and weak classifier, T is the number of weak classifiers or features, a is the weight of weak classifier and it updated in each round of iteration (Park & Hwang 2014). The update rule of a is…”
Section: Adaboost Algorithmmentioning
confidence: 99%