Search results for "Kernel"

showing 10 items of 357 documents

An improved smoothed particle electromagnetics method in 3D time domain simulations

2011

In this paper, an enhanced variant of the meshless smoothed particle electromagnetics (SPEM) method is performed in order to solve PDEs in time domain describing 3D transient electromagnetic phenomena. The method appears to be very efficient in approximating spatial derivatives in the numerical treatment of Maxwell's curl equations. In many cases, very often, accuracy degradation, due to a lack of particle consistency, severely limits the usefulness of this approach. A numerical corrective strategy, which allows to restore the SPEM consistency, without any modification of the smoothing kernel function and its derivatives, is presented. The method allows to restore the same order of consiste…

Curl (mathematics)Mathematical optimizationElectromagneticsModeling and SimulationApplied mathematicsTime domainElectrical and Electronic EngineeringSmoothing kernelComputer Science ApplicationsMathematicsInternational Journal of Numerical Modelling: Electronic Networks, Devices and Fields
researchProduct

Heat Kernel Measure on Central Extension of Current Groups in any Dimension

2006

We define measures on central extension of current groups in any dimension by using infinite dimensional Brownian motion.

Current (mathematics)lcsh:MathematicsMathematical analysisProbability (math.PR)central extensionExtension (predicate logic)Group Theory (math.GR)lcsh:QA1-939Measure (mathematics)Dimension (vector space)Mathematics::ProbabilityFOS: MathematicsGeometry and TopologyBrownian motionMathematics - Group TheoryMathematical PhysicsAnalysisHeat kernelBrownian motionMathematics - ProbabilityMathematicscurrent groups
researchProduct

Cloud masking and removal in remote sensing image time series

2017

Automatic cloud masking of Earth observation images is one of the first required steps in optical remote sensing data processing since the operational use and product generation from satellite image time series might be hampered by undetected clouds. The high temporal revisit of current and forthcoming missions and the scarcity of labeled data force us to cast cloud screening as an unsupervised change detection problem in the temporal domain. We introduce a cloud screening method based on detecting abrupt changes along the time dimension. The main assumption is that image time series follow smooth variations over land (background) and abrupt changes will be mainly due to the presence of clo…

Data processingEarth observation010504 meteorology & atmospheric sciencesComputer sciencebusiness.industry0211 other engineering and technologiesImage processingCloud computing02 engineering and technology01 natural sciencesKernel methodFeature (computer vision)General Earth and Planetary SciencesSatellite Image Time SeriesbusinessChange detection021101 geological & geomatics engineering0105 earth and related environmental sciencesRemote sensingJournal of Applied Remote Sensing
researchProduct

Forest of Normalized Trees: Fast and Accurate Density Estimation of Streaming Data

2018

Density estimation of streaming data is a relevant task in numerous domains. In this paper, a novel non-parametric density estimator called FRONT (forest of normalized trees) is introduced. It uses a structure of multiple normalized trees, segments the feature space of the data stream through a periodically updated linear transformation and is able to adapt to ever evolving data streams. FRONT provides accurate density estimation and performs favorably compared to existing online density estimators in terms of the average log score on multiple standard data sets. Its low complexity, linear runtime as well as constant memory usage, makes FRONT by design suitable for large data streams. Final…

Data streamComputer scienceData stream miningFeature vectorEstimator02 engineering and technologyDensity estimation01 natural sciencesData modeling010104 statistics & probabilityKernel (statistics)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0101 mathematicsRandom variableAlgorithm2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA)
researchProduct

Optimal extension of multispectral image demosaicking algorithms for setting up a one-shot camera video acquisition system

2022

Multispectral images are acquired using multispectral cameras equipped with CCD or CMOS sensors which sample the visible or near infrared spectrum according to specific spectral bands. A mosaic of multispectral MSFA filters is superimposed on the surface of the sensors to acquire a raw image called an MSFA image. In the MSFA image, only one spectral band is available per pixel, the demosaicking process is necessary to estimate the multispectral image at full spatio-spectral resolution. Motivated by the success of single-sensor cameras capturing the image in a single exposure that use CFA filters, we performed a comparative study of a few recent color image demosaicking algorithms and experi…

Demosaicking algorithmAdaptive Kernel regressionInterpolation bilinéaire pondéréeMultispectral imagesnoyau adaptatif de régressionBiorthogonal waveletsMultispectral filter arrayRéseau de filtres multispectrauxImages multispectralesConvolutionComposante de luminance[INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV]LMMSEWeighted bilinear interpolationAlgorithme de démosaïquageLuminance componentOndelettes biorthogonales
researchProduct

Focal plane array infrared camera transfer function calculation and image restoration

2004

Infrared images often present distortions induced by the measurement system. Image processing is thus an essential part of infrared measurements. A distortion model based on a convolution product is presented. The analytical form of the convolution kernel has been obtained from an image formation theory, along with an analysis of the sampling of the focal plane array camera detector's matrix. Image restoration is an ill-posed problem, and its solution can be obtained using regularization methods. In this work, image restoration is performed using a variation of Tikhonov regularization that makes use of the particular form of the convolution kernel matrix, which is built as a block-circulant…

DiffractionImage formationDiagonal formComputer sciencebusiness.industryDetectorGeneral EngineeringImage processingRegularization (mathematics)Atomic and Molecular Physics and OpticsConvolutionTikhonov regularizationMatrix (mathematics)Cardinal pointKernel (image processing)DistortionComputer visionArtificial intelligencebusinessImage restorationOptical Engineering
researchProduct

Generalized dirichlet problem in nonlinear potential theory

1990

The operator extending the classical solution of the Dirichlet problem for the quasilinear elliptic equation divA(x,▽u)=0 akin to thep-Laplace equation is shown to be unique providedA obeys a specific order principle. The Keldych lemma is also generalized to this nonlinear setting.

Dirichlet problemDirichlet kernelsymbols.namesakeDirichlet eigenvalueGeneral MathematicsDirichlet's principleDirichlet boundary conditionMathematical analysissymbolsDirichlet L-functionDirichlet's energyElliptic boundary value problemMathematicsManuscripta Mathematica
researchProduct

Evolution Problems Associated to Linear Growth Functionals: The Dirichlet Problem

2003

Let Ω be a bounded set inIR N with Lipschitz continuous boundary ∂Ω. We are interested in the problem

Dirichlet problemPure mathematicsBounded setMathematical analysisBoundary (topology)Dirichlet's energyLipschitz continuityElliptic boundary value problemDirichlet kernelsymbols.namesakeDirichlet's principlesymbolsMathematics::Metric GeometryMathematics
researchProduct

Mixed intersections of non quasi-analytic classes

2008

Given two semi-regular matrices M and M' and two open subsets O and O' [resp. two compact subsets K and K'] of Rr and Rs respectively, we introduce the spaces E(M×M')(O × O') and D(M×M')(O × O') [resp. D(M×M')(K × K')]. In this paper we study their locally convex properties and the structure of their elements. This leads in [10] to tensor product representations of these spaces and to some kernel theorems.

Discrete mathematicsCombinatoricsComputational MathematicsAlgebra and Number TheoryTensor productKernel (set theory)Applied MathematicsStructure (category theory)Regular polygonGeometry and TopologyAnalysisMathematicsRevista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
researchProduct

Kernel theorems in the setting of mixed nonquasi-analytic classes

2008

Abstract Let Ω 1 ⊂ R r and Ω 2 ⊂ R s be nonempty and open. We introduce the Beurling–Roumieu spaces D ( ω 1 , ω 2 } ( Ω 1 × Ω 2 ) , D ( M , M ′ } ( Ω 1 × Ω 2 ) and obtain tensor product representations of them. This leads for instance to kernel theorems of the following type: every continuous linear map from the Beurling space D ( ω 1 ) ( Ω 1 ) (respectively D ( M ) ( Ω 1 ) ) into the strong dual of the Roumieu space D { ω 2 } ( Ω 2 ) (respectively D { M ′ } ( Ω 2 ) ) can be represented by a continuous linear functional on D ( ω 1 , ω 2 } ( Ω 1 × Ω 2 ) (respectively D ( M , M ′ } ( Ω 1 × Ω 2 ) ).

Discrete mathematicsCombinatoricsLinear mapTensor productKernel (set theory)Applied MathematicsLinear formType (model theory)Space (mathematics)AnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct