CPC G06T 3/40 (2013.01) [G06T 1/60 (2013.01)] | 4 Claims |
1. A maximum throughput method for computing 2D convolutions, comprising the steps of finding the optimal value for N that maximizes throughput:
receiving an image of arbitrarily large size, and a convolution kernel of size Q×Q;
decomposing the image into block sizes P×P;
computing fast convolutions of each image block with the convolution kernel;
storing an output in N×N blocks wherein N≥P+Q−1;
calculating the throughput as a function of a number of output pixels N×N over the execution time of each block to obtain a result;
combining results using an overlap-and-add method to compute a final output image; and
determining an optimal size N that provides the maximum throughput among all considered block sizes.
|