Fast algorithms for binary cross-correlation

Cross-correlation is widely used to match images. Cross-correlation of windows where pixels have binary values is necessary when thresholded sign-of-Laplacian images are matched. Nishihara proposed that the sign of the Laplacian of an image be used as a characteristic (that is robust to illumination changes and noise) to match images. We have reduced the number of multiplications required in the computation of the Laplacian by half by making use of the symmetry of the convolution masks. Thresholding the sign of the Laplacian of an image results in a binary image and image matching can then be done by matching corresponding windows of the binary images using cross-correlation. Leberl proposed fast algorithms for computing binary cross-correlation. We propose a fast implementation of his best algorithm. We also propose, in this paper, a bit-based algorithm which makes use of the fact that the binary data in the windows can be represented by bits. The algorithm packs the bits into integer variables and then uses the logical operations to identify matching bits in the windows. This very packing of bits into integer variables (that enables us to use the logical operations, hence speeding up the process) renders the step of counting the number of matching pixels difficult. This step, then, is the bottleneck in the algorithm. We solve this problem of counting the number of matching pixels by an algebraic property. The bit-method is exceedingly simple and is most efficient when the number of bits is close to multiples of 32. Binary cross-correlation can also be computed and, hence, speeded up by the FFT. We conclude the paper by comparing the bit-based method, Leberl´s algorithm and the FFT-based method for computing binary cross-correlation.