The generalized Hosoya triangle is an arrangement of numbers where each entry is a product of two generalized Fibonacci numbers. We define a discrete convolution 1 C based on the entries of the generalized Hosoya triangle. We use C and generating functions to prove that the sum of every k-th entry in the n-th row or diagonal of generalized Hosoya triangle, beginning on the left with the first e...

This thesis studies theoretical and practical aspects of the computation of planar polygonal Minkowski sums via convolution methods. In particular we prove the “Convolution Theorem”, which is fundamental to convolution based methods, for the case of simple polygons. To the best of our knowledge this is the first complete proof for this case. Moreover, we describe a complete, exact and efficient...

In this paper, we present a simple and modularized neural network architecture, named primal-dual group convolutional neural networks (PDGCNets). The main point lies in a novel building block, a pair of two successive group convolutions: primal group convolution and dual group convolution. The two group convolutions are complementary: (i) the convolution on each primal partition in primal group...

In this paper we describe and analyze Krylov subspace techniques for accelerating the convergence of waveform relaxation for solving time dependent problems. A new class of accelerated waveform methods, convolution Krylov subspace methods, is presented. In particular, we give convolution variants of the conjugate gradient algorithm and two convolution variants of the GMRES algorithm and analyze...

Convolution Neural Network (CNN) has gained tremendous success in computer vision tasks with its outstanding ability to capture the local latent features. Recently, there has been an increasing interest in extending CNNs to the general spatial domain. Although various types of graph and geometric convolution methods have been proposed, their connections to traditional 2D-convolution are not wel...

semilinear stochastic evolution equations with multiplicative l'evy noise are considered‎. ‎the drift term is assumed to be monotone nonlinear and with linear growth‎. ‎unlike other similar works‎, ‎we do not impose coercivity conditions on coefficients‎. ‎we establish the continuous dependence of the mild solution with respect to initial conditions and also on coefficients. ‎as corollaries of ...

This note discusses the basic image operations of correlation and convolution, and some aspects of one of the applications of convolution, image filtering. Image correlation and convolution differ from each other by two mere minus signs, but are used for different purposes. Correlation is more immediate to understand, and the discussion of convolution in section 2 clarifies the source of the mi...

Convolution and correlation are very basic image processing operations with numerous applications ranging from image restoration to target detection to image resampling and geometrical transformation. In real time applications, the crucial issue is the processing speed, which implies mandatory use of algorithms with the lowest possible computational complexity. Fast image convolution and correl...