Spherical basis function approximation with particular trend functions

The radial basis function (RBF) approximation is a rapidly developing field of mathematics. In the paper, we are concerned with the measurement of scalar physical quantities at nodes on sphere in the 3D Euclidean space and the spherical RBF interpolation of the data acquired. We employ a multiquadric as the radial basis function and the corresponding trend is a polynomial of degree 2 considered in Cartesian coordinates. Attention is paid to geodesic metrics that define the distance of two points on a sphere. The choice of a particular geodesic metric function is an important part of the construction of interpolation formula.We show the existence of an interpolation formula of the type considered. The approximation formulas of this type can be useful in the interpretation of measurements of various physical quantities. We present an example concerned with the sampling of anisotropy of magnetic susceptibility having extensive applications in geosciences and demonstrate the advantages and drawbacks of the formulas chosen, in particular the strong dependence of interpolation results on condition number of the matrix of the system considered and on round-off errors in general.

CO₂ emission is considerably dependent on energy consumption and on share of energy sources as well as on the extent of economic activities. Consequently, these factors must be considered for CO₂ emission prediction for seven middle eastern countries including Iran, Kuwait, United Arab Emirates, Turkey, Saudi Arabia, Iraq and Qatar. In order to propose a predictive model, a Multilayer Perceptron Artificial Neural Network (MLP ANN) is applied. Three transfer functions including logsig, tansig and radial basis functions are utilized in the hidden layer of the network. Moreover, various numbers of neurons are applied in the structure of the models. It is revealed that using MLP ANN makes it possible to accurately predict CO₂ emission of these countries. In addition, it is concluded that using logsig transfer function leads to the highest accuracy with minimum value of mean squared error (MSE) which is followed by the networks with radial basis and tansig transfer functions. The R-squared of the networks with logsig, radial basis and tansig transfer functions are 0.9998, 0.9997 and 0.9996, respectively. Finally, comparison of the proposed model with a similar study, considered five countries in the same region, reveals higher accuracy in term of MSE.

Fast computation of RBF coefficients using FFT

When radial basis functions (RBFs) are made increasingly flat, the interpolation error typically decreases steadily until some point when Runge-type oscillations either halt or reverse this trend. Because the most obvious method to calculate an RBF interpolant becomes a numerically unstable algorithm for a stable problem in the case of near-flat basis functions, there will typically also be a separate point at which disastrous ill-conditioning enters. We introduce here a new method, RBF-QR, which entirely eliminates such ill-conditioning, and we apply it in the special case when the data points are distributed over the surface of a sphere. This algorithm works even for thousands of node points, and it allows the RBF shape parameter to be optimized without the limitations imposed by stability concerns. Since interpolation in the flat RBF limit on a sphere is found to coincide with spherical harmonics interpolation, new insights are gained as to why the RBF approach (with nonflat basis functions) often is the more accurate of the two methods.

This paper proposes a generic criterion that defines the optimum number of basis functions for radial basis function (RBF) neural networks. The generalization performance of an RBF network relates to its prediction capability on independent test data. This performance gives a measure of the quality of the chosen model. An RBF network with an overly restricted basis gives poor predictions on new data, since the model has too little flexibility. By contrast, an RBF network with too many basis functions also gives poor generalization performance since it is too flexible and fits too much of the noise on the training data. Bias and variance are complementary quantities, and it is necessary to assign the number of basis function optimally in order to achieve the best compromise between them. In this paper we use Stein's unbiased risk estimator to derive an analytical criterion for assigning the appropriate number of basis functions. Two cases of known and unknown noise have been considered and the efficacy of this criterion in both situations is illustrated experimentally. The paper also shows an empirical comparison between this method and two well known classical methods, cross validation and the Bayesian information criterion, BIC.

Background: Implicit surface is a kind of surface modeling tool, which is widely used in point cloud reconstruction, deformation and fusion due to its advantages of good smoothness and Boolean operation. The most typical method is the surface reconstruction with Radial Basis Functions (RBF) under normal constraints. RBF has become one of the main methods of point cloud fitting because it has a strong mathematical foundation, an advantage of computation simplicity, and the ability of processing nonuniform points. Objective: Techniques and patents of implicit surface reconstruction interpolation with RBF are surveyed. Theory, algorithm, and application are discussed to provide a comprehensive summary for implicit surface reconstruction in RBF and Hermite Radial Basis Functions (HRBF) interpolation. Methods: RBF implicit surface reconstruction interpolation can be divided into RBF interpolation under the constraints of points and HRBF interpolation under the constraints of points and corresponding normals. Results: A total of 125 articles were reviewed, in which more than 30% were related to RBF in the last decade. The continuity properties and application fields of the popular global supported radial basis functions and compactly supported radial basis functions are analyzed. Different methods of RBF and HRBF implicit surface reconstruction are evaluated, and the challenges of these methods are discussed. Conclusion: In future work, implicit surface reconstruction via RBF and HRBF should be further studied in fitting accuracy, computation speed, and other fundamental problems. In addition, it is a more challenging but valuable research direction to construct a new RBF with both compact support and improved fitting accuracy.

Radial basis function (RBF) methods have been actively developed in the last decades. RBF methods are global methods which do not require the use of specialized points and that yield high order accuracy if the function is smooth enough. Like other global approximations, the accuracy of RBF approximations of discontinuous problems deteriorates due to the Gibbs phenomenon, even as more points are added. In this paper we show that it is possible to remove the Gibbs phenomenon from RBF approximations of discontinuous functions as well as from RBF solutions of some hyperbolic partial differential equations. Although the theory for the resolution of the Gibbs phenomenon by reprojection in Gegenbauer polynomials relies on the orthogonality of the basis functions, and the RBF basis is not orthogonal, we observe that the Gegenbauer polynomials recover high order convergence from the RBF approximations of discontinuous problems in a variety of numerical examples including the linear and nonlinear hyperbolic partial differential equations. Our numerical examples using multi-quadric RBFs suggest that the Gegenbauer polynomials are Gibbs complementary to the RBF multi-quadric basis.

Radial basis function (RBF) network can be viewed as a fuzzy rule base with specified membership functions and fuzzy inference operations. However, there is a trade-off between the approximation performance of RBF network and the number of hidden neurons. To tackle this problem, this paper proposes a dynamic RBF (DRBF) network with a constructive learning. This DRBF network not only can create the new hidden neurons, but also can prune the insignificant hidden neurons. Then, an adaptive dynamic RBF fuzzy neural control (ADRFNC) system, including a neural controller and a saturation compensator, is developed. The neural controller uses a DRBF network to on-line mimic an ideal controller and the saturation compensator is designed to dispel the approximation error introduced by the neural controller. Finally, the proposed ADRFNC system is applied to a chaotic circuit and a DC motor control system. Simulation and experimental results show the proposed ADRFNC system can achieve a favorable tracking performance when the controller’s parameters have been learned and the network structure has been constructed by the proposed learning algorithm.

In this paper we propose a method of wavelet data processing in analytical instruments by radial basis function (RBF) using. The wavelet transform (VT) is carried out in two stages. On the first stage the interpolation of the initial signal samples by RBF using is carried. On the second stage is reduced continuously VT of the original signal with using of the linearity property of the wavelet transform and with knowing of the weight coefficients of the basis functions, the analytical expression for a continual VT and wavelet basis function.

Spectral sensitivity, as one of the most important parameters of a digital camera, is playing a key role in many computer vision applications. In this paper, a confidence voting convolutional neural network (CVNet) is proposed to rebuild the spectral sensitivity function, modeled as the sum of weighted basis functions. By evaluating useful information supplied by different image segments, disparate confidence is calculated to automatically learn basis functions' weights, only using one image captured by the object camera. Three types of basis functions are made up and employed in the network, including Fourier basis function (FBF), singular value decomposition basis function (SVDBF), and radial basis function (RBF). Results show that the accuracy of the proposed method with FBF, SVDBF, and RBF is 97.92%, 98.69%, and 99.01%, respectively. We provide theory for network design, build a dataset, demonstrate training process, and present experimental results with high precision. Without bulky benchtop setups and strict experimental limitations, this proposed simple and effective method could be an alternative in the future for spectral sensitivity function estimation.

Neural networks using radial basis functions (RBFs) are a popular representation for inducing classification schemes. However, RBF neural networks often require a large number of hidden units (basis functions) in order to adequately model the class distinctions. This is due to the static nature of each basis function. This paper uses an evolutionary program to induce dynamic basis functions whose receptive fields are dependent on the input vector. This technique requires only a single basis function per class to perform on par with RBF networks.

Background and ObjectiveLarge, uniformly spaced, complex and time varying datasets derived from high resolution medical image velocimetry can provide a wealth of information regarding small-scale transient physiological flow phenomena and pulsation of anatomical boundaries. However, there remains a need for interpolation techniques to effectively reconstruct a fully 4-dimensional functional relationship from this data. This paper presents a preliminary evaluation of a 4-dimensional local radial basis function (RBF) algorithm as a means of addressing this problem for laminar flows. MethodsA 4D interpolation algorithm is proposed based on a Local Hermitian Interpolation (LHI) using a combination of multi-quadric RBF with a partition of unity scheme. The domain is divided into uniform sub-systems with size restricted to immediately neighbouring points. The validity of the algorithm is first established on a known 4D analytical dataset and a CFD based laminar flow phantom. Application is then demonstrated through characterisation of a large 4D laminar flow dataset obtained from magnetic resonance imaging (MRI) measurements of cerebrospinal fluid velocities in the brain. ResultsPerformance of the algorithm is compared to that of a quad-linear interpolation, demonstrating favourable improvement in accuracy. The technique is shown to be robust, computationally efficient and capable of refined interpolation in Euclidean space and time. Application to MR velocimetry data is shown to produce promising results for the 4D reconstruction of the transient flow field and movement of the fluid boundaries at spatial and temporal locations intermediate to the original data. ConclusionThis study has demonstrated feasibility of an accurate, stable and efficient 4-dimensional local RBF interpolation method for large, transient laminar flow velocimetry datasets. The proposed approach does not suffer from ill-conditioning or high computational cost due to domain decomposition into local stencils where the RBF is only ever applied to a limited number of points. This work offers a potential tool to assist medical diagnoses and drug delivery through better understanding of physiological flow fields such as cerebrospinal fluid. Further work will evaluate the technique on a wider range of flow fields and against CFD simulation.

We had previously shown that regularization principles lead to approximation schemes that are equivalent to networks with one layer of hidden units, called regularization networks. In particular, standard smoothness functionals lead to a subclass of regularization networks, the well known radial basis functions approximation schemes. This paper shows that regularization networks encompass a much broader range of approximation schemes, including many of the popular general additive models and some of the neural networks. In particular, we introduce new classes of smoothness functionals that lead to different classes of basis functions. Additive splines as well as some tensor product splines can be obtained from appropriate classes of smoothness functionals. Furthermore, the same generalization that extends radial basis functions (RBF) to hyper basis functions (HBF) also leads from additive models to ridge approximation models, containing as special cases Breiman's hinge functions, some forms of projection pursuit regression, and several types of neural networks. We propose to use the term generalized regularization networks for this broad class of approximation schemes that follow from an extension of regularization. In the probabilistic interpretation of regularization, the different classes of basis functions correspond to different classes of prior probabilities on the approximating function spaces, and therefore to different types of smoothness assumptions. In summary, different multilayer networks with one hidden layer, which we collectively call generalized regularization networks, correspond to different classes of priors and associated smoothness functionals in a classical regularization principle. Three broad classes are (1) radial basis functions that can be generalized to hyper basis functions, (2) some tensor product splines, and (3) additive splines that can be generalized to schemes of the type of ridge approximation, hinge functions, and several perceptron-like neural networks with one hidden layer.

Implicit planar curve and surface fitting to a set of scattered points plays an important role in solving a wide variety of problems occurring in computer graphics modelling, computer graphics animation, and computer assisted surgery. The fitted implicit surfaces can be either algebraic or non‐algebraic. The main problem with most algebraic surface fitting algorithms is that the surface fitted to a given data set is often unbounded, multiple sheeted, and disconnected when a high degree polynomial is used, whereas a low degree polynomial is too simple to represent general shapes. Recently, there has been increasing interest in non‐algebraic implicit surface fitting. In these techniques, one popular way of representing an implicit surface has been the use of radial basis functions. This type of implicit surface can represent various shapes to a high level of accuracy. In this paper, we present an implicit surface fitting algorithm using radial basis functions with an ellipsoid constraint. This method does not need to build interior and exterior layers for the given data set or to use information on surface normal but still can fit the data accurately. Furthermore, the fitted shape can still capture the main features of the object when the data sets are extremely sparse. The algorithm involves solving a simple general eigen‐system and a computation of the inverse or psedo‐inverse of a matrix, which is straightforward to implement.

این مطالعه به منظور بررسی پیش بینی شاخص های عملکرد تولیدی در مرغان تخم گذار با استفاده از شبکه های عصبی مصنوعی و رگرسیون غیرخطی چندگانه انجام شد. بررسی بر روی اطلاعات چهار دوره متوالی پرورش در یک واحد پرورش مرغ تخم گذار صورت گرفت. روش های داده-کاوی شامل رگرسیون خطی و غیر خطی، شبکه عصبی پرسپترون سه لایه، شبکه عصبی پرسپترون چهار لایه و شبکه عصبی با تابع پایه ای شعاعی بود. در این مدل ها از متغیرهای سن گله، میزان خوراک مصرفی و فصل تولید به عنوان متغیر پیشگو و شاخص های عملکرد تولیدی شامل درصد تخم-گذاری، وزن توده ای تخم مرغ تولیدی و ضریب تبدیل غذایی به عنوان متغیر پاسخ استفاده شد. نتایج نهایی رگرسیون های خطی نشان داد که برای تمامی متغیرهای وابسته مورد مطالعه متغیر مستقل سن گله معنی دار می باشد. بنابراین رگرسیون غیر خطی شاخص های عملکرد تولیدی در مقابل سن برای مقایسه با شبکه های عصبی مختلف مورد بررسی قرار گرفت و برای مقایسه کلیه مدل ها از ضریب تعیین (R2) و میانگین قدر مطلق خطا (MAE) استفاده شد. نتایج نشان داد بین شبکه های عصبی مصنوعی مختلف مورد مطالعه، شبکه با تابع پایه ای شعاعی بهتر از سایر مدل های در پیش‌بینی شاخص های عملکرد تولیدی مرغان تخم گذار عمل می کند.