Search results for "kernel"
showing 10 items of 357 documents
Multiframe image restoration in the presence of noisy blur kernel
2009
We wish to recover an original image u from several blurry-noisy versions f k , called frames. We assume a more severe degradation model, in which the image u has been blurred by a noisy (stochastic) point spread function. We consider the problem of restoring the degraded image in a variational framework. Since the recovery of u from one single frame f is a highly ill-posed problem, we formulate two minimization problems based on the multiframe approach proposed for image super-resolution by Marquina-Osher [13]. Several experimental results for image restoration are shown, illustrating that the proposed models give visually satisfactory results.
Formulation and test of an ice aggregation scheme for two-moment bulk microphysics schemes
2013
A simple formulation of aggregation for 2-moment bulk microphysical models is de-rived. The solution involves the evaluation of a double integral of the collection kernelweighted with the crystal size (or mass) distribution. This quantity is to be inserted intothe differential equation for the crystal number concentration which has classical form. The double integrals are evaluated numerically for log-normal size distributions overa large range of geometric mean masses. A polynomial fit of the results is given thatyields good accuracy. Various tests of the new parameterization are described: aggre-gation as stand-alone process, in a box-model, and in 2-D simulations of a cirrostratuscloud. …
Cell-average multiresolution based on local polynomial regression. Application to image processing
2014
In Harten (1996) [32] presented a general framework about multiresolution representation based on four principal operators: decimation and prediction, discretization and reconstruction. The discretization operator indicates the nature of the data. In this work the pixels of a digital image are obtained as the average of a function in some defined cells. A family of Harten cell-average multiresolution schemes based on local polynomial regression is presented. The stability is ensured by the linearity of the operators obtained and the order is calculated. Some numerical experiments are performed testing the accuracy of the prediction operators in comparison with the classical linear and nonli…
Distributed learning automata-based scheme for classification using novel pursuit scheme
2020
Learning Automata (LA) is a popular decision making mechanism to “determine the optimal action out of a set of allowable actions” (Agache and Oommen, IEEE Trans Syst Man Cybern-Part B Cybern 2002(6): 738–749, 2002). The distinguishing characteristic of automata-based learning is that the search for the optimising parameter vector is conducted in the space of probability distributions defined over the parameter space, rather than in the parameter space itself (Thathachar and Sastry, IEEE Trans Syst Man Cybern-Part B Cybern 32(6): 711–722, 2002). Recently, Goodwin and Yazidi pioneered the use of Ant Colony Optimisation (ACO) for solving classification problems (Goodwin and Yazidi 2016). In th…
Hyplets - Multi Exception Level Kernel towards Linux RTOS
2018
This paper presents the concept of a Multi-Exception level operating system. We add a hypervisor awareness to the Linux kernel and execute code in hyp exception level. We do that through the use of Hyplets. Hyplets are an innovative way to code interrupt service routines under ARM. Hyplets provide high performance, security, running time predictability, an RPC mechanism and a possible solution for the priority inversion problem. Hyplets uses special features of ARM8va hypervisor memory architecture.
An Efficient Numerical Method for Time Domain Computational Electromagnetic Simulation
2018
In this paper an efficient numerical method in approximating the electric and magnetic fields is provided. The method is based on an implicit leapfrog arrangement in time and without mesh in space. Moreover, a projection scheme is introduced in order to improve the accuracy of the proposed approach and applied into the computational electromagnetic (CEM) framework. The PDEs governing the process are solved and some numerical results are reported to validate the numerical process.
Multiplicity theorems for the Dirichlet problem involving the p-Laplacian
2003
Multiplicity theorems for the Dirichlet problem involving the p-Laplacian were proved using variational approach. It was shown that there existed an open interval and a positive real number, and each problem admits at least three weak solutions. Results on the existence of at least three weak solutions for the Dirichlet problems were established.
Malliavin Calculus of Bismut Type for Fractional Powers of Laplacians in Semi-Group Theory
2011
We translate into the language of semi-group theory Bismut's Calculus on boundary processes (Bismut (1983), Lèandre (1989)) which gives regularity result on the heat kernel associated with fractional powers of degenerated Laplacian. We translate into the language of semi-group theory the marriage of Bismut (1983) between the Malliavin Calculus of Bismut type on the underlying diffusion process and the Malliavin Calculus of Bismut type on the subordinator which is a jump process.
Stability of the fixed point property in Hilbert spaces
2005
In this paper we prove that if X X is a Banach space whose Banach-Mazur distance to a Hilbert space is less than 5 + 17 2 \sqrt {\frac {5+\sqrt {17}}{2}} , then X X has the fixed point property for nonexpansive mappings.
Evolution problems of Leray-Lions type with nonhomogeneous Neumann boundary conditions in metric random walk spaces
2019
Abstract In this paper we study evolution problems of Leray–Lions type with nonhomogeneous Neumann boundary conditions in the framework of metric random walk spaces. This covers cases with the p -Laplacian operator in weighted discrete graphs and nonlocal operators with nonsingular kernel in R N .