• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.4
• /
• pp.315-319
• /
• 2006

Support vector machines in biped humanoid robot are presented in this paper. The trajectory of the ZMP in biped walking robot poses an important criterion for the balance of the walking robots but complex dynamics involved make robot control difficult. We are establishing empirical relationships based on the dynamic stability of motion using SVMs. SVMs and kernel method have become very popular method for learning from examples. We applied SVM to model the practical humanoid robot. Three kinds of kernels are employed also and each result has been compared. As a result, SVM based on kernel method have been found to work well. Especially SVM with RBF kernel function provides the best results. The simulation results show that the generated ZMP from the SVM can be improve the stability of the biped walking robot and it can be effectively used to model and control practical biped walking robot.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.148-151
• /
• 2001

We suggest AKL(abstract kernel layer) to. the design and implementation of WAP on basis of multi-platform. AKL is running on the various kernel including REX, MS-DOS, MS-Windows, UNIX and LINUX. For the purpose of it, AKL makes machine-dependant features be minimized and supports a consistent interface on API(application program interface) point of views. Therefore, It makes porting times of a device be shorten and makes easy of maintenance. We validated our suggestion as a consequent of porting WAP into PalmV PDA and mobile phone with AKL.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.735-744
• /
• 2007

Support vector machine(SVM) is capable of providing a more complete description of the linear and nonlinear relationships among random variables. In this paper we propose a sparse kernel regression(SKR) to overcome a weak point of SVM, which is, the steep growth of the number of support vectors with increasing the number of training data. The iterative reweighted least squares(IRWLS) procedure is used to solve the optimal problem of SKR with a Laplacian prior. Furthermore, the generalized cross validation(GCV) function is introduced to select the hyper-parameters which affect the performance of SKR. Experimental results are then presented which illustrate the performance of the proposed procedure.

• Korean Journal of Mathematics
• /
• v.17 no.4
• /
• pp.375-383
• /
• 2009

In this note, we determine the properties of the coefficients of Bell domains in the plane and find some coefficients to consist of Bell domain.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.1
• /
• pp.1-11
• /
• 2023

Deep-learning-based image segmentation is one of the most widely employed lane detection approaches, and it requires a post-process for extracting the key points on the lanes. A general approach for key-point extraction is using a fixed threshold defined by a user. However, finding the best threshold is a manual process requiring much effort, and the best one can differ depending on the target data set (or an image). We propose a novel key-point extraction algorithm that automatically adapts to the target image without any manual threshold setting. In our adaptive key-point extraction algorithm, we propose a line-level normalization method to distinguish the lane region from the background clearly. Then, we extract a representative key point for each lane at a line (row of an image) using a kernel density estimation. To check the benefits of our approach, we applied our method to two lane-detection data sets, including TuSimple and CULane. As a result, our method achieved up to 1.80%p and 17.27% better results than using a fixed threshold in the perspectives of accuracy and distance error between the ground truth key-point and the predicted point.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.4
• /
• pp.765-775
• /
• 2012

The cross-validation is a popular method to select bandwidth in all types of kernel estimation. The maximum likelihood cross-validation, the least squares cross-validation and biased cross-validation have been proposed for bandwidth selection in kernel density estimation. In the case that the probability density function has a discontinuity point, Huh (2012) proposed a method of bandwidth selection using the maximum likelihood cross-validation. In this paper, two forms of cross-validation with the one-sided kernel function are proposed for bandwidth selection to estimate the location and jump size of the discontinuity point of density. These methods are motivated by the least squares cross-validation and the biased cross-validation. By simulated examples, the finite sample performances of two proposed methods with the one of Huh (2012) are compared.

• Journal of applied mathematics & informatics
• /
• v.36 no.1_2
• /
• pp.1-14
• /
• 2018

In this paper, we prove the existence, uniqueness and stability of solution for some nonlinear functional-integral equations by using generalized coupled Lipschitz condition. We prove a fixed point theorem to obtain the mentioned aim in Banach space $X=C([a,b],{\mathbb{R}})$. As application we study some volterra integral equations with linear, nonlinear and single kernel.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.103-108
• /
• 2002

We consider an estimation of discontinuous variance function in nonparametric heteroscedastic random design regression model. We first propose estimators of a change point and jump size in variance function and then construct an estimator of entire variance function. We examine the rates of convergence of these estimators and give results on their asymptotics. Numerical work reveals that the effectiveness of change point analysis in variance function estimation is quite significant.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.206-221
• /
• 2019

Source localization in three-dimensional (3-D) wireless sensor networks (WSNs) is becoming a major research focus. Due to the complicated air-ground environments in 3-D positioning, many of the traditional localization methods, such as received signal strength (RSS) may have relatively poor accuracy performance. Benefit from prior learning mechanisms, fingerprinting-based localization methods are less sensitive to complex conditions and can provide relatively accurate localization performance. However, fingerprinting-based methods require training data at each grid point for constructing the fingerprint database, the overhead of which is very high, particularly for 3-D localization. Also, some of measured data may be unavailable due to the interference of a complicated environment. In this paper, we propose an efficient kernel based 3-D localization algorithm via tensor completion. We first exploit the spatial correlation of the RSS data and demonstrate the low rank property of the RSS data matrix. Based on this, a new training scheme is proposed that uses tensor completion to recover the missing data of the fingerprint database. Finally, we propose a kernel based learning technique in the matching phase to improve the sensitivity and accuracy in the final source position estimation. Simulation results show that our new method can effectively eliminate the impairment caused by incomplete sensing data to improve the localization performance.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.987-994
• /
• 2011

From the point view of credit evaluation whose population is divided into the default and non-default state, two methods are considered to estimate conditional distribution functions: one is to estimate under the assumption that the data is followed the mixture normal distribution and the other is to use the kernel density estimation. The parameters of normal mixture are estimated using the EM algorithm. For the kernel density estimation, five kinds of well known kernel functions and four kinds of the bandwidths are explored. In addition, the corresponding ROC functions are obtained based on the estimated distribution functions. The goodness-of-fit of the estimated distribution functions are discussed and the performance of the ROC functions are compared. In this work, it is found that the kernel distribution functions shows better fit, and the ROC function obtained under the assumption of normal mixture shows better performance.