An efficient algorithm for pattern detection using combined classifiers and data fusion

  • Authors:
  • Hazem M. El-Bakry

  • Affiliations:
  • Faculty of Computer Science and Information Systems, Mansoura University, Egypt

  • Venue:
  • Information Fusion
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Neural networks have shown good results for detecting a certain pattern in a given image. In this paper, efficient neural networks (ENNs) for face detection are presented. Such classifiers are designed based on cross-correlation in the frequency domain between the input matrix and the input weights of neural networks. This approach is developed to reduce the computation steps required by these ENNs for the searching process. The principle of divide and conquer strategy is applied through matrix decomposition. Each matrix is divided into smaller in size sub-matrices and then each one is tested separately by using a single efficient neural classifier. Then, the final result is achieved by fusing results from the combined classifiers. Furthermore, faster face detection is obtained by using parallel processing techniques to test the resulting sub-matrices at the same time using the same number of ENNs. Another advantage is that the speed up ratio is increased with the size of the input matrix when using ENNs and matrix decomposition. In addition, for many reasons presented here, it is proved that the equations given in previous work [S. Ben-Yacoub, B. Fasel, J. Luettin, Fast face detection using MLP and FFT, in: Proceedings of the Second International Conference on Audio and Video-based Biometric Person Authentication (AVBPA'99), 1999; B. Fasel, Fast multi-scale face detection, IDIAP-Com 98-04, 1998; S. Ben-Yacoub, Fast object detection using MLP and FFT, IDIAP-RR 11, IDIAP, 1997] for conventional and fast neural networks are not valid. Correct equations for the number of computation steps required by cross-correlation in the spatial and frequency domains are given. Moreover, the problem of local sub-matrix normalization in the frequency domain is solved. The effect of matrix normalization on the speed up ratio of face detection is discussed. Simulation results show that local sub-matrix normalization through weight normalization is faster than sub-matrix normalization in the spatial domain. The overall speed up ratio of the detection process is increased as the normalization of weights is done off line.