New faster normalized neural networks for sub-matrix detection using cross correlation in the frequency domain and matrix decomposition
Neural networks have shown good results for detecting a certain pattern in a given image. In this paper, faster neural networks for pattern detection are presented. Such processors 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 faster neural networks for the detection process. The principle of divide and conquer strategy is applied through matrix decomposition. Each matrix is divided into smaller in size submatrices and then each one is tested separately by using a single faster neural processor. Furthermore, faster pattern detection is obtained by using parallel processing techniques to test the resulting submatrices at the same time using the same number of faster neural networks. In contrast to faster neural networks, the speed up ratio is increased with the size of the input matrix when using faster neural networks and matrix decomposition. Moreover, the problem of local submatrix normalization in the frequency domain is solved. The effect of matrix normalization on the speed up ratio of pattern detection is discussed. Simulation results show that local submatrix normalization through weight normalization is faster than submatrix 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.
neural networks cross correlation parallel processing matrix normalization fast pattern detection