• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.76-78
• /
• 2019

Sampling-based algorithms are one of the most commonly approaches which give good results in robot path planning with many degree of freedom. So that many proposed methods as well as their improvement based on these approaches have been proposed. The purpose of this paper is to survey some current algorithms using for path planning, the original proposed methods as well as their improvement. Some advantages and disadvantages of these algorithms will be also mentioned, how the improved version of the proposed methods overcome the original proposed methods' drawback.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.384-390
• /
• 2004

In this paper we compare the performance of 4 different algorithms for converting the sampling frequency of an audio from 44.1KHz to 48KHz. The algorithms considered here include the basic polyphase method. sine function based method. multi-stage method. and B-spline based method. For a fair comparison, the sampling rate converters using the 4 algorithms are redesigned under a high fidelity condition. Then, their H/W complexities are compared in terms of the computational complexity and the memory size. As a result, it is shown that the basic polyphase method and sine function based method outperform the other two in terms of the computational complexity, while the B-spline based method requires less memory than the others.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.27-39
• /
• 2016

This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

• Journal of Power Electronics
• /
• v.16 no.6
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• The Korean Journal of Applied Statistics
• /
• v.27 no.3
• /
• pp.357-371
• /
• 2014

There are many studies related to imbalanced data in which the class distribution is highly skewed. To address the problem of imbalanced data, previous studies deal with resampling techniques which correct the skewness of the class distribution in each sampled subset by using under-sampling, over-sampling or hybrid-sampling such as SMOTE. Ensemble methods have also alleviated the problem of class imbalanced data. In this paper, we compare around a dozen algorithms that combine the ensemble methods and resampling techniques based on simulated data sets generated by the Backbone model, which can handle the imbalance rate. The results on various real imbalanced data sets are also presented to compare the effectiveness of algorithms. As a result, we highly recommend the resampling technique combining ensemble methods for imbalanced data in which the proportion of the minority class is less than 10%. We also find that each ensemble method has a well-matched sampling technique. The algorithms which combine bagging or random forest ensembles with random undersampling tend to perform well; however, the boosting ensemble appears to perform better with over-sampling. All ensemble methods combined with SMOTE outperform in most situations.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.295-298
• /
• 2000

In this research, a novel sampling strategy for a CMM to inspect freeform surfaces is proposed. Unlike primitive surfaces, it is not easy to determine the number of sampling points and their locations for inspecting freeform surfaces. Since a CMM operates with slower speed in measurement than optical measuring devices, it is important to optimize the number and the locations of sampling points in the inspection process. When a complete inspection of a surface is required, it becomes more critical. Among various factors to cause shape errors of a final product, curvature characteristic is essential due to its effect such as stair-step errors in rapid prototyping and interpolation errors in NC tool paths generation. Shape errors are defined in terms of the average and standard deviation of differences between an original model and a produced part. Proposed algorithms determine the locations of sampling points by analyzing curvature distribution of a given surface. Based on the curvature distribution, a surface area is divided into several sub-areas. In each sub-area, sampling points are located as further as possible. The optimal number of sub-areas. In each sub-area, sampling points are located as further as possible. The optimal number os sub-areas is determined by estimating the average of curvatures. Finally, the proposed method is applied to several surfaces that have shape errors for verification.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.239-247
• /
• 2003

Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, etc. CHAID(Chi-square Automatic Interaction Detector), is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose and CHAID algorithm by cube-based sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.5
• /
• pp.534-542
• /
• 2019

In active SONAR, several different methods are used to detect range-Doppler information of the target. Compressive sensing based method is more accurate than conventional methods and shows superior performance. There are several compressive sensing algorithms for range-Doppler estimation of active sonar. The ability of each algorithm depends on algorithm type, mutual coherence of sensing matrix, and signal to noise ratio. In this paper, we compared and analyzed computational performance and accuracy of various compressive sensing algorithms for range-Doppler estimation of active sonar. The performance of OMP (Orthogonal Matching Pursuit), CoSaMP (Compressive Sampling Matching Pursuit), BPDN (CVX) (Basis Pursuit Denoising), LARS (Least Angle Regression) algorithms is respectively estimated for varying SNR (Signal to Noise Ratio), and mutual coherence. The optimal compressive sensing algorithm is presented according to the situation.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.04a
• /
• pp.39-50
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID(Chi-square Automatic Interaction Detector) uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.803-816
• /
• 2004

The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud dection, data reduction and variable screening, category merging, etc. CHAID uses the chi-squired statistic to determine splitting and is an exploratory method used to study the relationship between a dependent variable and a series of predictor variables. In this paper we propose CHAID algorithm by cube-based proportional sampling and explore CHAID algorithm in view of accuracy and speed by the number of variables.