An interesting problem

[McGlinchy, Alistair]

> 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!

Code available if anyone else was interested.

Cheers

Alistair

**********************************************************************
Registered Office:
Marks and Spencer plc
Waterside House
35 North Wharf Road
London
W2 1NW

Registered No. 214436 in England and Wales.

Telephone (020) 7935 4422
Facsimile (020) 7487 2670

<<www.marksandspencer.com>>

Please note that electronic mail may be monitored.

This e-mail is confidential. If you received it by mistake, please let us know and then delete it from your system; you should not copy, disclose, or distribute its contents to anyone nor act in reliance on this e-mail, as this is prohibited and may be unlawful.
2005