Re: Computing a neighborhood window efficiently

Posted by Serafino on Jan 17, 2011; 6:57pm
URL: http://imagej.273.s1.nabble.com/Computing-a-neighborhood-window-efficiently-tp3685960p3685965.html

That plugin is supernice ^^ thank you for sharing it.
I had to tweak your formula for my purposes since it did not computed the precise square window sum since I have odd square sides.
Once I implemented it , it results the fastest approach when the window 'radius' is growing, but at small level the column cached array approach is better (it is always better for memory saving purposes).
I guess that I'm not that good at comparing algorithm in Java (I still need to find a good profiler), in the meantime I will attach the java code showing all the methods I wrote as a proof of concept
Main.java