• Title/Summary/Keyword: Radial basis function interpolation

Search Result 49, Processing Time 0.021 seconds

Relations among the multidimensional linear interpolation fuzzy reasoning , and neural networks

  • Om, Kyong-Sik;Kim, Hee-Chan;Byoung-Goo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.562-567
    • /
    • 1998
  • This paper examined the relations among the multidimensional linear interpolation(MDI) and fuzzy reasoning , and neural networks, and showed that an showed that an MDI is a special form of Tsukamoto's fuzzy reasoning and regularization networks in the perspective of fuzzy reasoning and neural networks, respectively. For this purposes, we proposed a special Tsukamoto's membership (STM) systemand triangular basis function (TBF) networks, Also we verified the condition when our proposed TBF becomes a well-known radial basis function (RBF).

  • PDF

An Analysis of Accuracy for Submarine Topographic Information by Interpolation Method (보간기법에 따른 해저지형의 정확도 분석)

  • Kim Ga-Ya;Moon Doo-Youl;Seo Dong-Ju
    • Journal of Ocean Engineering and Technology
    • /
    • v.20 no.3 s.70
    • /
    • pp.67-76
    • /
    • 2006
  • Three-dimensional information of submarine topography was acquired by assembling DGPS and Echo Sounder, which is mainly used in the marine survey. However, the features of submarine topography, derived according to mechanical data, were confirmed using human eyes. Because the dredging capacity using a submarine surveying data influences harbor public affairs, analysis and the process method of surveying data is a very special element in construction costs. In this study, information on submarine topography is acquired by assembling DGPS and Echo Sounder. Moreover, the dredging capacity in harbor public affairs has been analyzed by the interpolation method: inverse distance to a power, kriging, minimum curvature, nearest neighbor, and radial basis function. Also, utilization of DGPS and Echo Sounder method in calculation of the dredging capacity have been confirmed by comparing and analyzing the dredging capacity and the actual one, as per each interpolation. According to this comparison result, in the case of applying Radial basis function interpolation and Kriging, 3.94 % and 4.61 % of error rates have been shown, respectively. In the case of the study for application of the proper interpolation, as per characteristics of submarine topography, is preceded in calculation of the dredging capacity relevant to harbor public affairs, it is expected that more speedy and correct calculation for the dredging capacity can be made.

Filling Holes in Large Polygon Models Using an Implicit Surface Scheme and the Domain Decomposition Method

  • Yoo, Dong-Jin
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.8 no.1
    • /
    • pp.3-10
    • /
    • 2007
  • A new approach based on implicit surface interpolation combined with domain decomposition is proposed for filling complex-shaped holes in a large polygon model, A surface was constructed by creating a smooth implicit surface from an incomplete polygon model through which the actual surface would pass. The implicit surface was defined by a radial basis function, which is a continuous scalar-value function over the domain $R^{3}$. The generated surface consisted of the set of all points at which this scalar function is zero. It was created by placing zero-valued constraints at the vertices of the polygon model. The well-known domain decomposition method was used to treat the large polygon model. The global domain of interest was divided into smaller domains in which the problem could be solved locally. The LU decomposition method was used to solve the set of small local problems; the local solutions were then combined using weighting coefficients to obtain a global solution. The validity of this new approach was demonstrated by using it to fill various holes in large and complex polygon models with arbitrary topologies.

A Study on the Adaptive Refinement Method for the Stress Analysis of the Meshfree Method (적응적 세분화 방법을 이용한 무요소법의 응력 해석에 관한 연구)

  • Han, Sang-Eul;Kang, Noh-Won;Joo, Jung-Sik
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2008.04a
    • /
    • pp.8-13
    • /
    • 2008
  • In this study, an adaptive node generation procedure in the radial point interpolation method is proposed. Since we set the initial configuration of nodes by subdivision of background cell, abrupt changes of inter-nodal distance between higher and lower error regions are unavoidable. This unpreferable nodal spacing induces additional errors. To obtain the smoothy nodal configuration, it's regenerated by local Delaunay triangulation algorithm This technique was originally developed to generate a set of well-shaped triangles and tetrahedra. To demonstrate the performance of proposed scheme, the results of making optimal nodal configuration with adaptive refinement method are investigated for stress concentration problems.

  • PDF

SOLVING PARTIAL DIFFERENTIAL ALGEBRAIC EQUATIONS BY COLLOCATION AND RADIAL BASIS FUNCTIONS

  • Bao, Wendi;Song, Yongzhong
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.5_6
    • /
    • pp.951-969
    • /
    • 2012
  • In this paper, we propose a class of meshless collocation approaches for the solution of time dependent partial differential algebraic equations (PDAEs) in terms of a radial basis function interpolation numerical scheme. Kansa's method and the Hermite collocation method (HCM) for PDAEs are given. A sensitivity analysis of the solutions from different shape parameter c is obtained by numerical experiments. With use of the random collocation points, we have obtain the more accurate solution by the methods than those by the finite difference method for the PDAEs with index-2, i.e, we avoid the influence from an index jump of PDAEs in some degree. Several numerical experiments show that the methods are efficient.

Meshless local Petrov-Galerkin method for rotating Rayleigh beam

  • Panchore, Vijay
    • Structural Engineering and Mechanics
    • /
    • v.81 no.5
    • /
    • pp.607-616
    • /
    • 2022
  • In this work, the free vibration problem of a rotating Rayleigh beam is solved using the meshless Petrov-Galerkin method which is a truly meshless method. The Rayleigh beam includes rotatory inertia in addition to Euler-Bernoulli beam theory. The radial basis functions, which satisfy the Kronecker delta property, are used for the interpolation. The essential boundary conditions can be easily applied with radial basis functions. The results are obtained using six nodes within a subdomain. The results accurately match with the published literature. Also, the results with Euler-Bernoulli are obtained to compare the change in higher natural frequencies with change in the slenderness ratio (${\sqrt{A_0R^2/I_0}}$). The mass and stiffness matrices are derived where we get two stiffness matrices for the node and boundary respectively. The non-dimensional form is discussed as well.

A Radial Basis Function Approach to Pattern Recognition and Its Applications

  • Shin, Mi-Young;Park, Chee-Hang
    • ETRI Journal
    • /
    • v.22 no.2
    • /
    • pp.1-10
    • /
    • 2000
  • Pattern recognition is one of the most common problems encountered in engineering and scientific disciplines, which involves developing prediction or classification models from historic data or training samples. This paper introduces a new approach, called the Representational Capability (RC) algorithm, to handle pattern recognition problems using radial basis function (RBF) models. The RC algorithm has been developed based on the mathematical properties of the interpolation and design matrices of RBF models. The model development process based on this algorithm not only yields the best model in the sense of balancing its parsimony and generalization ability, but also provides insights into the design process by employing a design parameter (${\delta}$). We discuss the RC algorithm and its use at length via an illustrative example. In addition, RBF classification models are developed for heart disease diagnosis.

  • PDF

Charted Depth Interpolation: Neuron Network Approaches

  • Chaojian, Shi
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2004.08a
    • /
    • pp.37-44
    • /
    • 2004
  • Continuous depth data are often required in applications of both onboard systems and maritime simulation. But data available are usually discrete and irregularly distributed. Based on the neuron network technique, methods of interpolation to the charted depth are suggested in this paper. Two algorithms based on Levenberg-Marquardt back-propaganda and radial-basis function networks are investigated respectively. A dynamic neuron network system is developed which satisfies both real time and mass processing applications. Using hyperbolic paraboloid and typical chart area, effectiveness of the algorithms is tested and error analysis presented. Special process in practical applications such as partition of lager areas, normalization and selection of depth contour data are also illustrated.

  • PDF

Analysis of Precision of Interpolation of Reservoir bed Through Comparison of Data Acquired by Using UAV and Echo Sounder (UAV와 Echo Sounder 취득 자료의 비교를 통한 저수지 하상의 공간 보간별 정확도 분석)

  • Roh, Tae-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.23 no.3
    • /
    • pp.85-99
    • /
    • 2020
  • Reservoir is an important infrastructure of our society because it can store immense amount of water for various usages - manufacturing, agriculture, drinking, power generation, tourism etc. For maintenance of reservoir, various efforts in administrative and technological aspects are periodically conducted and monitoring the conditions of reservoir bed is the first priority for maintenance of reservoir. To check the conditions of reservoir bed, we measured depth of reservoir by using echo sounder, which is relatively reliable, prior to discharging of stored water and surveyed topography of reservoir by using UAV after discharging of water. Then, we conducted interpolation of measured depth of water by means of inverse distance weighting interpolation, Kriging interpolation, minimum curvature interpolation and radial basis function interpolation and calculated the volume of reservoir for each interpolation method. We compared the calculated volume of reservoir with the volume of water calculated by UAV after discharging of water and found the following results: First, as results of the above processes, we found that the Kriging interpolation was 97% correct in measurement of the volume of reservoir. Second, as results of comparison of differences between topographical areas and interpolated areas after selection of cross section for comparison, Kriging interpolation was found to have the most similar configuration with the topographical configuration by showing the least difference in the area of cross section. Therefore, it is determined that the optimal modeling of reservoir bed with the water depth data measured by echo sounder shall provide basic information for efficient maintenance of reservoir.

A Study on Filling Holes of Large Polygon Model using Implicit Surface Scheme and Domain Decomposition Method (음함수 곡면기법과 영역 분할법을 이용한 대형 폴리곤 모델의 홀 메움에 관한 연구)

  • Yoo Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.1 s.178
    • /
    • pp.174-184
    • /
    • 2006
  • In order to fill the holes with complex shapes in the large polygon model, a new approach which is based on the implicit surface interpolation method combined with domain decomposition method is presented. In the present study, a surface is constructed by creating smooth implicit surface from the incomplete polygon model through which the surface should pass. In the method an implicit surface is defined by a radial basis function, a continuous scalar-valued function over the domain $R^3$ The generated surface is the set of all points at which this scalar function takes on the value zero and is created by placing zero-valued constraints at the vertices of the polygon model. In this paper the well-known domain decomposition method is used in order to treat the large polygon model. The global domain of interest is divided into smaller domains where the problem can be solved locally. LU decomposition method is used to solve a set of small local problems and their local solutions are combined together using the weighting coefficients to obtain a global solution. In order to show the validity of the present study, various hole fillings are carried out fur the large and complex polygon model of arbitrary topology.