An interesting problem

[Dave Hodgkinson]

On 3 Jan 2007, at 22:56, McGlinchy, Alistair wrote:

>> I think that the previous mention of a 2D autocorrelation will be
>> good to explore, but you can use the "moving average" trick to avoid
>> lots of extra cycles while summing neighborhoods.  I've implemented
>> this in C before and gotten speedups of 1x to 50x, depending on the
>> neighborhood size.
>
> Aye, That's the trick. Run time from 10 mins to 16secs for the 30x100
> case. Great fun!

Now parallelise the work and distribute it round all those lovely  
machines
you have at work :)

-- 
Dave Hodgkinson - Music photography
http://www.davehodgkinson.com/