Issue No. 03 - March (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.910811
<p><b>Abstract</b>—We give a Monte Carlo algorithm that computes an unbiased estimate of the convolution of two vectors. The variance of our estimate is small for entries of the convolution that are large; this corresponds to the situation in which convolution is used in pattern matching or template matching, where one is only interested in the largest entries of the resulting convolution vector. Experiments performed with our algorithm confirm the theory and suggest that, in contexts where one cares about only the large entries in the convolution, the algorithm can be a faster alternative to performing an FFT-based convolution.</p>
Algorithms, convolution, image processing, template matching.
Mikhail J. Atallah, "On Estimating the Large Entries of a Convolution", IEEE Transactions on Computers, vol. 50, no. , pp. 193-196, March 2001, doi:10.1109/12.910811