Example 31 with SumFilter
use of gdsc.smlm.filters.SumFilter in project GDSC-SMLM by aherbert.
the class SumFilterTest method floatRollingBlockSumNxNIsFasterThanBlockSumNxN.
@Test
public void floatRollingBlockSumNxNIsFasterThanBlockSumNxN() {
org.junit.Assume.assumeTrue(TestSettings.RUN_SPEED_TESTS);
rand = new gdsc.core.utils.Random(-300519);
SumFilter filter = new SumFilter();
ArrayList<float[]> dataSet = floatCreateSpeedData(ITER);
ArrayList<Long> fastTimes = new ArrayList<Long>();
// Initialise
filter.blockSumNxN(floatClone(dataSet.get(0)), primes[0], primes[0], boxSizes[0]);
filter.rollingBlockSumNxN(floatClone(dataSet.get(0)), primes[0], primes[0], boxSizes[0]);
for (int boxSize : boxSizes) for (int width : primes) for (int height : primes) {
ArrayList<float[]> dataSet2 = new ArrayList<float[]>(dataSet.size());
for (float[] data : dataSet) dataSet2.add(floatClone(data));
long time = System.nanoTime();
for (float[] data : dataSet2) filter.rollingBlockSumNxN(data, width, height, boxSize);
time = System.nanoTime() - time;
fastTimes.add(time);
}
long slowTotal = 0, fastTotal = 0;
int index = 0;
for (int boxSize : boxSizes) {
long boxSlowTotal = 0, boxFastTotal = 0;
for (int width : primes) for (int height : primes) {
ArrayList<float[]> dataSet2 = new ArrayList<float[]>(dataSet.size());
for (float[] data : dataSet) dataSet2.add(floatClone(data));
long time = System.nanoTime();
for (float[] data : dataSet2) filter.blockSumNxN(data, width, height, boxSize);
time = System.nanoTime() - time;
long fastTime = fastTimes.get(index++);
slowTotal += time;
fastTotal += fastTime;
boxSlowTotal += time;
boxFastTotal += fastTime;
if (debug)
System.out.printf("float blockSumNxN [%dx%d] @ %d : %d => rollingBlockSumNxN %d = %.2fx\n", width, height, boxSize, time, fastTime, speedUpFactor(time, fastTime));
//if (TestSettings.ASSERT_SPEED_TESTS) Assert.assertTrue(String.format("Not faster: [%dx%d] @ %d : %d > %d", width, height, boxSize,
// blockTime, time), blockTime < time);
}
//if (debug)
System.out.printf("float blockSumNxN %d : %d => rollingBlockSumNxN %d = %.2fx\n", boxSize, boxSlowTotal, boxFastTotal, speedUpFactor(boxSlowTotal, boxFastTotal));
if (TestSettings.ASSERT_SPEED_TESTS)
Assert.assertTrue(String.format("Not faster: Block %d : %d > %d", boxSize, boxFastTotal, boxSlowTotal), boxFastTotal < boxSlowTotal);
}
System.out.printf("float blockSumNxN %d => rollingBlockSumNxN %d = %.2fx\n", slowTotal, fastTotal, speedUpFactor(slowTotal, fastTotal));
if (TestSettings.ASSERT_SPEED_TESTS)
Assert.assertTrue(String.format("Not faster: %d > %d", fastTotal, slowTotal), fastTotal < slowTotal);
}Example 32 with SumFilter
use of gdsc.smlm.filters.SumFilter in project GDSC-SMLM by aherbert.
the class SumFilterTest method intRollingBlockSumNxNInternalIsFasterThanBlockSumNxNInternal.
@Test
public void intRollingBlockSumNxNInternalIsFasterThanBlockSumNxNInternal() {
org.junit.Assume.assumeTrue(TestSettings.RUN_SPEED_TESTS);
rand = new gdsc.core.utils.Random(-300519);
SumFilter filter = new SumFilter();
ArrayList<int[]> dataSet = intCreateSpeedData(InternalITER);
ArrayList<Long> fastTimes = new ArrayList<Long>();
// Initialise
filter.blockSumNxNInternal(intClone(dataSet.get(0)), primes[0], primes[0], boxSizes[0]);
filter.rollingBlockSumNxNInternal(intClone(dataSet.get(0)), primes[0], primes[0], boxSizes[0]);
for (int boxSize : boxSizes) for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.rollingBlockSumNxNInternal(data, width, height, boxSize);
time = System.nanoTime() - time;
fastTimes.add(time);
}
long slowTotal = 0, fastTotal = 0;
int index = 0;
for (int boxSize : boxSizes) {
long boxSlowTotal = 0, boxFastTotal = 0;
for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.blockSumNxNInternal(data, width, height, boxSize);
time = System.nanoTime() - time;
long fastTime = fastTimes.get(index++);
slowTotal += time;
fastTotal += fastTime;
boxSlowTotal += time;
boxFastTotal += fastTime;
if (debug)
System.out.printf("int blockSumNxNInternal [%dx%d] @ %d : %d => rollingBlockSumNxNInternal %d = %.2fx\n", width, height, boxSize, time, fastTime, speedUpFactor(time, fastTime));
//if (TestSettings.ASSERT_SPEED_TESTS) Assert.assertTrue(String.format("Not faster: [%dx%d] @ %d : %d > %d", width, height, boxSize,
// blockTime, time), blockTime < time);
}
//if (debug)
System.out.printf("int blockSumNxNInternal %d : %d => rollingBlockSumNxNInternal %d = %.2fx\n", boxSize, boxSlowTotal, boxFastTotal, speedUpFactor(boxSlowTotal, boxFastTotal));
if (TestSettings.ASSERT_SPEED_TESTS)
Assert.assertTrue(String.format("Not faster: Block %d : %d > %d", boxSize, boxFastTotal, boxSlowTotal), boxFastTotal < boxSlowTotal);
}
System.out.printf("int blockSumNxNInternal %d => rollingBlockSumNxNInternal %d = %.2fx\n", slowTotal, fastTotal, speedUpFactor(slowTotal, fastTotal));
if (TestSettings.ASSERT_SPEED_TESTS)
Assert.assertTrue(String.format("Not faster: %d > %d", fastTotal, slowTotal), fastTotal < slowTotal);
}Example 33 with SumFilter
use of gdsc.smlm.filters.SumFilter in project GDSC-SMLM by aherbert.
the class SumFilterTest method intBlockSum3x3InternalIsFasterThanBlockSumNxNInternal.
@Test
public void intBlockSum3x3InternalIsFasterThanBlockSumNxNInternal() {
org.junit.Assume.assumeTrue(TestSettings.RUN_SPEED_TESTS);
rand = new gdsc.core.utils.Random(-30051977);
SumFilter filter = new SumFilter();
ArrayList<int[]> dataSet = intCreateSpeedData(InternalITER3);
ArrayList<Long> fastTimes = new ArrayList<Long>();
// Initialise
filter.blockSumNxNInternal(intClone(dataSet.get(0)), primes[0], primes[0], 1);
filter.blockSum3x3Internal(intClone(dataSet.get(0)), primes[0], primes[0]);
for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.blockSum3x3Internal(data, width, height);
time = System.nanoTime() - time;
fastTimes.add(time);
}
long slowTotal = 0, fastTotal = 0;
int index = 0;
@SuppressWarnings("unused") long boxSlowTotal = 0, boxFastTotal = 0;
for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.blockSumNxNInternal(data, width, height, 1);
time = System.nanoTime() - time;
long fastTime = fastTimes.get(index++);
slowTotal += time;
fastTotal += fastTime;
boxSlowTotal += time;
boxFastTotal += fastTime;
if (debug)
System.out.printf("int blockSumNxNInternal [%dx%d] %d => blockSum3x3Internal %d = %.2fx\n", width, height, time, fastTime, speedUpFactor(time, fastTime));
//if (TestSettings.ASSERT_SPEED_TESTS) Assert.assertTrue(String.format("Not faster: [%dx%d] %d > %d", width, height,
// blockTime, time), blockTime < time);
}
System.out.printf("int blockSumNxNInternal %d => blockSum3x3Internal %d = %.2fx\n", slowTotal, fastTotal, speedUpFactor(slowTotal, fastTotal));
if (TestSettings.ASSERT_SPEED_TESTS)
Assert.assertTrue(String.format("Not faster: %d > %d", fastTotal, slowTotal), fastTotal < slowTotal);
}Example 34 with SumFilter
use of gdsc.smlm.filters.SumFilter in project GDSC-SMLM by aherbert.
the class SumFilterTest method intStripedBlockSum3x3InternalIsFasterThanStripedBlockSumNxNInternal.
@Test
public void intStripedBlockSum3x3InternalIsFasterThanStripedBlockSumNxNInternal() {
org.junit.Assume.assumeTrue(TestSettings.RUN_SPEED_TESTS);
rand = new gdsc.core.utils.Random(-30051977);
SumFilter filter = new SumFilter();
ArrayList<int[]> dataSet = intCreateSpeedData(InternalITER3);
ArrayList<Long> fastTimes = new ArrayList<Long>();
// Initialise
filter.stripedBlockSumNxNInternal(intClone(dataSet.get(0)), primes[0], primes[0], 1);
filter.stripedBlockSum3x3Internal(intClone(dataSet.get(0)), primes[0], primes[0]);
for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.stripedBlockSum3x3Internal(data, width, height);
time = System.nanoTime() - time;
fastTimes.add(time);
}
long slowTotal = 0, fastTotal = 0;
int index = 0;
@SuppressWarnings("unused") long boxSlowTotal = 0, boxFastTotal = 0;
for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.stripedBlockSumNxNInternal(data, width, height, 1);
time = System.nanoTime() - time;
long fastTime = fastTimes.get(index++);
slowTotal += time;
fastTotal += fastTime;
boxSlowTotal += time;
boxFastTotal += fastTime;
if (debug)
System.out.printf("int stripedBlockSumNxNInternal [%dx%d] %d => stripedBlockSum3x3Internal %d = %.2fx\n", width, height, time, fastTime, speedUpFactor(time, fastTime));
//if (TestSettings.ASSERT_SPEED_TESTS) Assert.assertTrue(String.format("Not faster: [%dx%d] %d > %d", width, height,
// blockTime, time), blockTime < time);
}
System.out.printf("int stripedBlockSumNxNInternal %d => stripedBlockSum3x3Internal %d = %.2fx\n", slowTotal, fastTotal, speedUpFactor(slowTotal, fastTotal));
if (TestSettings.ASSERT_SPEED_TESTS)
Assert.assertTrue(String.format("Not faster: %d > %d", fastTotal, slowTotal), fastTotal < slowTotal);
}Example 35 with SumFilter
use of gdsc.smlm.filters.SumFilter in project GDSC-SMLM by aherbert.
the class SumFilterTest method intStripedBlockSum3x3IsFasterThanBlockSum3x3.
@Test
public void intStripedBlockSum3x3IsFasterThanBlockSum3x3() {
org.junit.Assume.assumeTrue(TestSettings.RUN_SPEED_TESTS);
rand = new gdsc.core.utils.Random(-30051977);
SumFilter filter = new SumFilter();
ArrayList<int[]> dataSet = intCreateSpeedData(ITER3);
ArrayList<Long> fastTimes = new ArrayList<Long>();
// Initialise
filter.stripedBlockSum3x3(intClone(dataSet.get(0)), primes[0], primes[0]);
filter.blockSum3x3(intClone(dataSet.get(0)), primes[0], primes[0]);
for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.stripedBlockSum3x3(data, width, height);
time = System.nanoTime() - time;
fastTimes.add(time);
}
long slowTotal = 0, fastTotal = 0;
int index = 0;
@SuppressWarnings("unused") long boxSlowTotal = 0, boxFastTotal = 0;
for (int width : primes) for (int height : primes) {
ArrayList<int[]> dataSet2 = new ArrayList<int[]>(dataSet.size());
for (int[] data : dataSet) dataSet2.add(intClone(data));
long time = System.nanoTime();
for (int[] data : dataSet2) filter.blockSum3x3(data, width, height);
time = System.nanoTime() - time;
long fastTime = fastTimes.get(index++);
slowTotal += time;
fastTotal += fastTime;
boxSlowTotal += time;
boxFastTotal += fastTime;
if (debug)
System.out.printf("int blockSum3x3 [%dx%d] %d => stripedBlockSum3x3 %d = %.2fx\n", width, height, time, fastTime, speedUpFactor(time, fastTime));
//if (TestSettings.ASSERT_SPEED_TESTS) Assert.assertTrue(String.format("Not faster: [%dx%d] %d > %d", width, height,
// blockTime, time), blockTime < time);
}
System.out.printf("int blockSum3x3 %d => stripedBlockSum3x3 %d = %.2fx\n", slowTotal, fastTotal, speedUpFactor(slowTotal, fastTotal));
if (TestSettings.ASSERT_SPEED_TESTS)
Assert.assertTrue(String.format("Not faster: %d > %d", fastTotal, slowTotal), fastTotal < slowTotal);
}Aggregations
SumFilter (gdsc.smlm.filters.SumFilter)44
ArrayList (java.util.ArrayList)44
Test (org.junit.Test)44
AverageFilter (gdsc.smlm.filters.AverageFilter)1
