A dilated temporal convolution with factor d = 1, 2, 4 and filter size k = 3.</p
Abstract. In the present paper we shall first introduce the time-width of a signal, and then we shal...
Suboptimality of using the multiresolution map, with different values of the parameter D.</p
<p><i>k</i>-means clustering: Reduction time measure for different <i>k</i> values.</p
A dilated casual convolution with dilated factors d = 1,2,4 and filter kernel size k = 3.</p
In all examples the kernel size is 3x3, but the rate differs. The rate defines by which factor the f...
<p>The TAC’s peakwidth is mostly given by a single basis function. Taking into account different reg...
The left, middle, and right sides represent standard convolution, deformable convolution, and T-defo...
<p>Quantitative results by different super-resolution algorithms (factor = 3).</p
Comparison of m and d between different reconstructions and levels of temporal averaging.</p
One of the most effective image processing techniques is the use of convolutional neural networks th...
The curve of the relationship between the filter threshold and the processing time.</p
<p>Timing statistics of the original SDF algorithm and our SDF algorithm, where the time cost is mea...
Visual performance of images with 4× enlargement factor of image 039 from BSD100 dataset.</p
<p>Quantitative results by different super-resolution algorithms (factor = 2).</p
The analysis of the discrete Mellin convolution is given. A generalization of rezults from [4,5] is ...
Abstract. In the present paper we shall first introduce the time-width of a signal, and then we shal...
Suboptimality of using the multiresolution map, with different values of the parameter D.</p
<p><i>k</i>-means clustering: Reduction time measure for different <i>k</i> values.</p
A dilated casual convolution with dilated factors d = 1,2,4 and filter kernel size k = 3.</p
In all examples the kernel size is 3x3, but the rate differs. The rate defines by which factor the f...
<p>The TAC’s peakwidth is mostly given by a single basis function. Taking into account different reg...
The left, middle, and right sides represent standard convolution, deformable convolution, and T-defo...
<p>Quantitative results by different super-resolution algorithms (factor = 3).</p
Comparison of m and d between different reconstructions and levels of temporal averaging.</p
One of the most effective image processing techniques is the use of convolutional neural networks th...
The curve of the relationship between the filter threshold and the processing time.</p
<p>Timing statistics of the original SDF algorithm and our SDF algorithm, where the time cost is mea...
Visual performance of images with 4× enlargement factor of image 039 from BSD100 dataset.</p
<p>Quantitative results by different super-resolution algorithms (factor = 2).</p
The analysis of the discrete Mellin convolution is given. A generalization of rezults from [4,5] is ...
Abstract. In the present paper we shall first introduce the time-width of a signal, and then we shal...
Suboptimality of using the multiresolution map, with different values of the parameter D.</p
<p><i>k</i>-means clustering: Reduction time measure for different <i>k</i> values.</p
DOI
Add to ORKG