Optimal Frequency SSD Matching Using Cosine Kernel

Fast robust correlation is a recently published correlation which makes use of the cosine function. It works by expressing any robust matching criteria in terms of cosine series. In this paper we show the high relationship between the principle of the fast robust correlation approach and the SSD metric. We demonstrate that using Taylor Lagrange approximation of cosine function we can express the well known sum square difference in terms of one cross correlation operation using the same principle of the fast robust correlation. Speed is obtained from computing the correlation in the frequency domain.

[1]  Steven G. Johnson,et al.  A Modified Split-Radix FFT With Fewer Arithmetic Operations , 2007, IEEE Transactions on Signal Processing.

[2]  Driss Aboutajdine,et al.  A new fast full search block matching algorithm using frequency domain , 2005, Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005..

[3]  Peter J. Huber,et al.  Robust Statistics , 2005, Wiley Series in Probability and Statistics.

[4]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.

[5]  William J. Christmas,et al.  Fast robust correlation , 2005, IEEE Transactions on Image Processing.

[6]  B. Ripley,et al.  Robust Statistics , 2018, Encyclopedia of Mathematical Geosciences.

[7]  C. Sidney Burrus,et al.  On computing the split-radix FFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[8]  Driss Aboutajdine,et al.  An Optimal and Statistically Robust Correlation Technique for Block Based Motion Estimation , 2006, 2006 IEEE International Conference on Multimedia and Expo.

[9]  Nicu Sebe,et al.  Toward Improved Ranking Metrics , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Mark S. Drew,et al.  Full search content independent block matching based on the fast Fourier transform , 2002, Proceedings. International Conference on Image Processing.