نتایج جستجو برای: radial basis function

تعداد نتایج: 1582170  

2002
A. Jonathan Howell Hilary Buxton

In this paper we introduce adaptive vision techniques used, for example, in video-conferencing applications. Radial Basis Function (RBF) networks have been trained for gesture-based communication with colour/motion cues to direct face detection and capture ‘attentional frames’. These focus the processing for Visually Mediated Interaction via an appearance-based approach with Gabor filter coeffi...

1998
Valentina Colla Mirko Sgarbi Leonardo M. Reyneri

In this work several attemps are proposed for extracting the Jominy hardness pro les of steel directly from the steel chemical composition. It is essentially a black{box modelling problem: the neural approach seems powerful, especially compared with classical models commonly found in literature. Several network structures have been implemented, which all can be viewed under the uni cation parad...

2003
Roland Vollgraf Michael Scholz Ian A. Meinertzhagen Klaus Obermayer

Nonlinear filtering can solve very complex problems, but typically involve very time consuming calculations. Here we show that for filters that are constructed as a RBF network with Gaussian basis functions, a decomposition into linear filters exists, which can be computed efficiently in the frequency domain, yielding dramatic improvement in speed. We present an application of this idea to imag...

2005
Zhichao Li Pilian He Ming Lei

To effectively organize and analyze massive Web information, in this paper, we have designed a Web classification mining system. BP network has lots of disadvantages, so we have proposed a method that uses RBFNN (Radial Basis Function Neural Network) to classify the text information in Web pages. In this paper, the model of classification system mainly includes RBF (Radial Basis Function) class...

2007
Sreangsu Acharyya Amitabha Mukerjee

Dynamic behaviour learning in the face of adversarial opponents involves a) learning a basic set of strategies, and b) tuning these strategies for the specific opponents involved. Iterative approaches to dynamic learning are often slow for large state spaces, especially since in many dynamic situations, the reward is not obvious immediately, but may need to be temporally apportioned over multip...

2000
Shimon Cohen Nathan Intrator

A hybrid architecture that includes Radial Basis Functions (RBF) and projection based hidden units is introduced together with a simple gradient based training algorithm. Classification and regression results are demonstrated on various data sets and compared with several variants of RBF networks. In particular, best classification results are achieved on the vowel classification data [1].

2003
Natacha Gueorguieva Iren Valova

In this paper we propose a strategy to shape adaptive radial basis functions through potential functions. DYPOF (DYnamic POtential Functions) neural network (NN) is designed based on radial basis functions (RBF) NN with a two-stage training procedure. Static (fixed number of RBF) and dynamic (ability to add or delete one or more RBF) versions of our learning algorithm are introduced. We investi...

2006
Yuehui Chen Lizhi Peng Ajith Abraham

Forecasting exchange rates is an important financial problem that is receiving increasing attention especially because of its difficulty and practical applications. This paper proposes a Hierarchical Radial Basis Function Network (HiRBF) model for forecasting three major international currency exchange rates. Based on the pre-defined instruction sets, HRBF model can be created and evolved. The ...

2011
K Althöfer D A Fraser G Bugmann J Turán

This paper proposes a neural-network-based method for the computation of the configuration space for robotic manipulators. The configuration space can be obtained by repeatedly computing configuration space patterns for elementary obstacle primitives. For any manipulator, these patterns depend only on the distance between the base of the manipulator and the obstacle primitive. An RBF-network is...

Journal: :J. Complexity 2004
Hrushikesh Narhar Mhaskar

The problem is said to be tractable if there exist constants c, α, β independent of q (but possibly dependent on μ and F) such that En(F , μ) ≤ cqαn−β. We explore different regions (including manifolds), function classes, and measures for which this problem is tractable. Our results include tractability theorems for integration with respect to non-tensor product measures, and over unbounded and...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید