Search results for "Basis function"
showing 10 items of 103 documents
Pentagon functions for massless planar scattering amplitudes
2018
Loop amplitudes for massless five particle scattering processes contain Feynman integrals depending on the external momentum invariants: pentagon functions. We perform a detailed study of the analyticity properties and cut structure of these functions up to two loops in the planar case, where we classify and identify the minimal set of basis functions. They are computed from the canonical form of their differential equations and expressed in terms of generalized polylogarithms, or alternatively as one-dimensional integrals. We present analytical expressions and numerical evaluation routines for these pentagon functions, in all kinematical configurations relevant to five-particle scattering …
A Novel System for Multi-level Crohn’s Disease Classification and Grading Based on a Multiclass Support Vector Machine
2020
Crohn’s disease (CD) is a chronic inflammatory condition of the gastrointestinal tract that can highly alter patient’s quality of life. Diagnostic imaging, such as Enterography Magnetic Resonance Imaging (E-MRI), provides crucial information for CD activity assessment. Automatic learning methods play a fundamental role in the classification of CD and allow to avoid the long and expensive manual classification process by radiologists. This paper presents a novel classification method that uses a multiclass Support Vector Machine (SVM) based on a Radial Basis Function (RBF) kernel for the grading of CD inflammatory activity. To validate the system, we have used a dataset composed of 800 E-MRI…
Learning with the kernel signal to noise ratio
2012
This paper presents the application of the kernel signal to noise ratio (KSNR) in the context of feature extraction to general machine learning and signal processing domains. The proposed approach maximizes the signal variance while minimizes the estimated noise variance in a reproducing kernel Hilbert space (RKHS). The KSNR can be used in any kernel method to deal with correlated (possibly non-Gaussian) noise. We illustrate the method in nonlinear regression examples, dependence estimation and causal inference, nonlinear channel equalization, and nonlinear feature extraction from high-dimensional satellite images. Results show that the proposed KSNR yields more fitted solutions and extract…
Distributed learning automata for solving a classification task
2016
In this paper, we propose a novel classifier in two-dimensional feature spaces based on the theory of Learning Automata (LA). The essence of our scheme is to search for a separator in the feature space by imposing a LA based random walk in a grid system. To each node in the gird we attach an LA, whose actions are the choice of the edges forming the separator. The walk is self-enclosing, i.e, a new random walk is started whenever the walker returns to starting node forming a closed classification path yielding a many edged polygon. In our approach, the different LA attached at the different nodes search for a polygon that best encircles and separates each class. Based on the obtained polygon…
Robust L1 fixed-order filtering for switched LPV systems with parameter-dependent delays
2015
Abstract This paper is concerned with the L1 fixed-order filtering problem for a class of switched linear parameter-varying (LPV) systems in which the system matrices and the time delays are dependent on the real-time measured parameters. The authors׳ attention is concentrated on designing the fixed-order filter that guarantees the filtering error system to be exponentially stable and to satisfy a prescribed L1 disturbance attenuation level with respect to all amplitude-bounded disturbances. Based on the switching logic with the minimum average dwell time (ADT), the delay-dependent L1 performance criterion for the switched LPV systems is first established. As there exists coupling between a…
Kernelizing LSPE(λ)
2007
We propose the use of kernel-based methods as underlying function approximator in the least-squares based policy evaluation framework of LSPE(λ) and LSTD(λ). In particular we present the 'kernelization' of model-free LSPE(λ). The 'kernelization' is computationally made possible by using the subset of regressors approximation, which approximates the kernel using a vastly reduced number of basis functions. The core of our proposed solution is an efficient recursive implementation with automatic supervised selection of the relevant basis functions. The LSPE method is well-suited for optimistic policy iteration and can thus be used in the context of online reinforcement learning. We use the hig…
Adaptive Gaussian particle method for the solution of the Fokker-Planck equation
2012
The Fokker-Planck equation describes the evolution of the probability density for a stochastic ordinary differential equation (SODE). A solution strategy for this partial differential equation (PDE) up to a relatively large number of dimensions is based on particle methods using Gaussians as basis functions. An initial probability density is decomposed into a sum of multivariate normal distributions and these are propagated according to the SODE. The decomposition as well as the propagation is subject to possibly large numeric errors due to the difficulty to control the spatial residual over the whole domain. In this paper a new particle method is derived, which allows a deterministic error…
Representation and estimation of spectral reflectances using projection on PCA and wavelet bases
2008
In this article, we deal with the problem of spectral reflectance function representation and estimation in the context of multispectral imaging. Because the reconstruction of such functions is an inverse problem, slight variations in input data completely skew the expected results. Therefore, stabilizing the reconstruction process is necessary. To do this, we propose to use wavelets as basis functions, and we compare those with Fourier and PCA bases. We present the idea and compare these three methods, which belong to the class of linear models. The PCA method is training-set dependent and confirms its robustness when applied to reflectance estimation of the training sets. Fourier and wave…
An Introduction to Kernel Methods
2009
Machine learning has experienced a great advance in the eighties and nineties due to the active research in artificial neural networks and adaptive systems. These tools have demonstrated good results in many real applications, since neither a priori knowledge about the distribution of the available data nor the relationships among the independent variables should be necessarily assumed. Overfitting due to reduced training data sets is controlled by means of a regularized functional which minimizes the complexity of the machine. Working with high dimensional input spaces is no longer a problem thanks to the use of kernel methods. Such methods also provide us with new ways to interpret the cl…
Adaptive estimation of Laguerre models with time-varying delay
2000
Abstract An Orthonormal Basis Functions (OBF) approach is effectively used in adaptive parameter estimation of linear(ized) open-loop stable, possibly nonminimum phase plants with time-varying delay. In particular, discrete Laguerre models are considered in detail. A special attention is paid to the numerical conditioning issue in case of ’poor’ excitation of a plant under control, where OBF models are of particular value. Closed-loop predictive control simulations confirm the usefulness of adaptive OBF modelling, especially for systems with time-varying delays.