Fig. 7From: Cascade of Boolean detector combinationsSymmetrical BOA cascade for laughter detection. Symmetrical BOA cascade, which is capable of making early classification to both classes, realizing of BOA (15) for laughter detection. The conjunction set z2={lA,lV} and the threshold \(\theta _{A}^{min}\) is \(\theta _{A}^{min}=\min \left (\theta _{A}^{1},\theta _{A}^{2,1},\theta _{A}^{2,2},\ldots,\theta _{A}^{2,N}\right)\). \(B_{2}^{0}\) contains K=2N conjunctions, where the first threshold comparison is always \(\left (l_{A}\geq \theta _{A}^{1}\right)\). The comparisons indexed by n = 1…N operate either on lA or lV according to binary (M2-ary) N-digit representation of the conjunction index k = 1…K, bin(k). If the n:th digit of bin(k) is 0, lA is used, and lV is used if the n:th digit of bin(k) is 1Back to article page