• Title/Summary/Keyword: Nystr$\ddot{o}$m approximation

Search Result 4, Processing Time 0.016 seconds

THE DISCRETE SLOAN ITERATE FOR CAUCHY SINGULAR INTEGRAL EQUATIONS

  • KIM, SEKI
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.2 no.2
    • /
    • pp.81-95
    • /
    • 1998
  • The superconvergence of the Sloan iterate obtained from a Galerkin method for the approximate solution of the singular integral equation based on the use of two sets of orthogonal polynomials is investigated. The discrete Sloan iterate using Gaussian quadrature to evaluate the integrals in the equation becomes the Nystr$\ddot{o}$m approximation obtained by the same rules. Consequently, it is impossible to expect the faster convergence of the Sloan iterate than the discrete Galerkin approximation in practice.

  • PDF

Fixed size LS-SVM for multiclassification problems of large data sets

  • Hwang, Hyung-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.3
    • /
    • pp.561-567
    • /
    • 2010
  • Multiclassification is typically performed using voting scheme methods based on combining a set of binary classifications. In this paper we use multiclassification method with a hat matrix of least squares support vector machine (LS-SVM), which can be regarded as the revised one-against-all method. To tackle multiclass problems for large data, we use the $Nystr\ddot{o}m$ approximation and the quadratic Renyi entropy with estimation in the primal space such as used in xed size LS-SVM. For the selection of hyperparameters, generalized cross validation techniques are employed. Experimental results are then presented to indicate the performance of the proposed procedure.

Robust Multidimensional Scaling for Multi-robot Localization (멀티로봇 위치 인식을 위한 강화 다차원 척도법)

  • Je, Hong-Mo;Kim, Dai-Jin
    • The Journal of Korea Robotics Society
    • /
    • v.3 no.2
    • /
    • pp.117-122
    • /
    • 2008
  • This paper presents a multi-robot localization based on multidimensional scaling (MDS) in spite of the existence of incomplete and noisy data. While the traditional algorithms for MDS work on the full-rank distance matrix, there might be many missing data in the real world due to occlusions. Moreover, it has no considerations to dealing with the uncertainty due to noisy observations. We propose a robust MDS to handle both the incomplete and noisy data, which is applied to solve the multi-robot localization problem. To deal with the incomplete data, we use the Nystr$\ddot{o}$m approximation which approximates the full distance matrix. To deal with the uncertainty, we formulate a Bayesian framework for MDS which finds the posterior of coordinates of objects by means of statistical inference. We not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).

  • PDF

Multi-Robot Localization based on Bayesian Multidimensional Scaling

  • Je, Hong-Mo;Kim, Dai-Jin
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2007.11a
    • /
    • pp.357-361
    • /
    • 2007
  • This paper presents a multi-robot localization based on Bayesian Multidimensional Scaling (BMDS). We propose a robust MDS to handle both the incomplete and noisy data, which is applied to solve the multi-robot localization problem. To deal with the incomplete data, we use the Nystr${\ddot{o}}$m approximation which approximates the full distance matrix. To deal with the uncertainty, we formulate a Bayesian framework for MDS which finds the posterior of coordinates of objects by means of statistical inference. We not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).

  • PDF