This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The "Invaders' Algorithm: Range of Values Modulation for Accelerated Correlation
November 2006 (vol. 28 no. 11)
pp. 1882-1886
In this paper, we present an algorithm that allows the simultaneous calculation of several cross correlations. The algorithm works by shifting the range of values of different images/signals to occupy different orders of magnitude and then combining them to form a single composite image/signal. Because additional signals are placed in the space usually occupied by a single signal, we call this the "invaders algorithm,” to imply that extra signals invade the space that normally belongs to a single signal. After correlation is performed, the individual results are recovered by performing the inverse operation. The limitations of the algorithm are imposed by the finite length of the mantissa of the hardware used, the precision of the algorithm that performs the cross correlation (e.g., the precision of the fast Fourier transform (FFT)) and by the actual values of the images/signals that are to be combined. The algorithm does not require any special hardware or special FFT algorithm. For typical 256\times 256 images, an acceleration by a factor of at least two in the calculation of their cross correlations is guaranteed using an ordinary PC or a laptop. As for smaller sized templates, tenfold accelerations may be achieved.

[1] http://www.hetp.u-net.com/public/Math_constants faq.html, 2006.
[2] A.J. Fitch, A. Kadyrov, W.J. Christmas, and J. Kittler, “Orientation Correlation,” Proc. British Machine Vision Conf., vol. 1, pp. 133-142, 2002.
[3] A. Gupta and V. Kumar, “The Scalability of FFT on Parallel Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 8, pp. 922-932, Aug. 1993.
[4] A.J. Fitch, A. Kadyrov, W.J. Christmas, and J. Kittler, “Fast Robust Correlation,” IEEE Trans. Image Processing, vol. 14, no. 8, pp. 1063-1073, Aug. 2005.
[5] D.H. Bailey, “High-Precision Arithmetic in Scientific Computation,” IEEE Computing in Science and Eng., pp. 54-61, May-June 2005.
[6] A. Kadyrov and M. Petrou, “Object Signatures Invariant to Affine Distortions Derived from the Trace Transform,” Image and Vision Computing, vol. 21, no. 13, pp. 1135-1143, 2003.
[7] A. Kadyrov, M. Petrou, and J. Park, “Sequential Recogniser Combination,” IEE Electronics Letters, vol. 40, pp. 663-664, 2004.
[8] M.C. Vanwormhoudt, “Rings of Hypercomplex Numbers for NT Fourier Transforms,” Signal Processing, vol. 67, pp. 189-198, 1998.
[9] M. Chicheva, M. Aliev, and A. Yershov, “Fast Algorithms of Hypercomplex Calculations: Parallel Approach,” Proc. Fourth Int'l Symp. Image and Signal Processing and Analysis, pp. 15-17, Sept. 2005.

Index Terms:
Image correlation, image filtering, template matching, accelerated correlation.
Citation:
Alexander Kadyrov, Maria Petrou, "The "Invaders' Algorithm: Range of Values Modulation for Accelerated Correlation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1882-1886, Nov. 2006, doi:10.1109/TPAMI.2006.234
Usage of this product signifies your acceptance of the Terms of Use.