On Tue, Jun 21, 2011 at 7:09 PM, Alex Flint wrote:
> Is there a fast way to compute an array of sum-of-squared-differences
> between a (small) K x K array and all K x K sub-arrays of a larger array?
> (i.e. each element x,y in the output array is the SSD between the small
> array and the sub-arr
On Tue, Jun 21, 2011 at 5:09 PM, Alex Flint wrote:
> Is there a fast way to compute an array of sum-of-squared-differences
> between a (small) K x K array and all K x K sub-arrays of a larger array?
> (i.e. each element x,y in the output array is the SSD between the small
> array and the sub-arra
Is there a fast way to compute an array of sum-of-squared-differences
between a (small) K x K array and all K x K sub-arrays of a larger array?
(i.e. each element x,y in the output array is the SSD between the small
array and the sub-array (x:x+K, y:y+K)
My current implementation loops over each
