A robust algorithm for estimating 3D–motion of small surface patches of a 3D–object is described. The robustness is measured by the probability of convergency to correct parameters. The 3D motion is estimated by a gradient method, which uses a local luminance error model, a motion compensated Kalman Filter and a selected neighboring surface around the patch. This technique can be used for autom...

We construct an analog of Steffensen’s method for solving nonlinear operator equations. Proposed method is a kind of two stage iterative process. We study the order of convergence of the method. It is shown that the proposed analog of Stefensen’s method, which does not use derivatives, has higher order of convergency then Newton method, other generalizations of chord method or other known modif...

We present a numerical scheme, based on Godunov’s method (REA algorithm), for the variance of the solution of the 1D random linear transport equation, with homogeneous random velocity and random initial condition. We obtain the stability conditions of the method and we also show its consistency with a deterministic nonhomogeneous advective-diffusive equation, which means convergency. Numerical ...

Abstract This paper proposes a novel variable learning rate to address two main challenges of the conventional Self-Organizing Maps (SOM) termed VLRSOM: high accuracy with fast convergence and low topological error. We empirically showed that proposed method exhibits faster behavior. It is also more robust in topology preservation as it maintains an optimal until end maximum iterations. Since a...

Traditionally, AI models are trained on the central cloud with data collected from end devices. This leads to high communication cost, long response time and privacy concerns. Recently Edge empowered AI, namely has been proposed support model learning deployment at network edge closer sources. Existing research including federated adopts a centralized architecture for where server aggregates up...

Using a suitable representation of real numbers as Cauchy sequences of rational numbers with fixed rate of convergency (e.g. 2) the predicate ≤ becomes Π1 while < is Σ1. Hence A :≡ ( |F (x)| ≤ 2 → |G(x)| < 2 ) can be prenexed into a formula ∨ l ∈ INA0(x, n, k, l) with decidable A0. Furthermore for a suitable standard representation of X (such that the elements of X are represented by functions ...

In this paper, for the numerical approximation of random partial differential equations (RPDEs) of parabolic type, an explicit higher order finite difference scheme is constructed. In continuation the main properties of deterministic difference schemes, i.e. consistency, stability and convergency are developed for the random cases. It is shown that the proposed random difference scheme has thes...